discrete-mathematics

Documents about discrete-mathematics

• Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#919982arXiv (OAI Expanded)
• Characterizations and Complexity of Minimum Forward and Integer Cycle Bases#924213arXiv (All)
• Moments of crosscorrelation demerit factors of binary sequences#972815arXiv (All)
• A sharp version of Talagrand's selector process conjecture, with applications to rounding fractional covers and Bernoulli Sudakov minoration#974171arXiv (All)
• Matematika Diskrit Teori Graf Pada LRT dalam Mengatasi Kemacetan : Studi Literatur#1004235Pentagon : Jurnal Matematika dan Ilmu Pengetahuan Alam
• Structural Parameterizations for Eternal Vertex Cover#1011606arXiv (All)
• Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis#1014108arXiv (All)
• An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#788456arXiv (OAI Expanded)
• A Simplified Analysis of the Good-Bad $3/2$-Approximation Algorithm for Some Minimum-Cost Graph Problems#790063arXiv (OAI Expanded)
• An Exposition of the $\widetilde{O}(\log^{1/4} n)$ Bound for the Komlós Problem#792456arXiv (All)
• A Simplified Analysis of the Good-Bad $3/2$-Approximation Algorithm for Some Minimum-Cost Graph Problems#794082arXiv (All)
• Order 14 is the largest order for which every 4-total coloring of every cubic graph is equitable#972196arXiv (All)
• Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width#985164arXiv (All)
• Block Structure and Spectrum of Zero-Divisor Graphs of Lipschitz Quaternion Rings Modulo $n$#1012160arXiv (All)
• The speed of convergence in the Cooper-Dutle dueling game#1048324arXiv (All)
• Phase computations and phase models for discrete molecular oscillators#954693Koc University Digital Collections
• Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth#173285arXiv (OAI)
• Petri net applications: a success story#416645Springer Nature OA
• An explicit construction of two completely independent spanning trees in the four-dimensional dual-cube#664392arXiv (OAI Expanded)
• An explicit construction of two completely independent spanning trees in the four-dimensional dual-cube#665892arXiv (All)
• Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes#920504arXiv (OAI Expanded)
• Extremal Asymmetric Depth of Planar Graphs and Hidden Near-Mirror Symmetries of IPR Fullerenes#924738arXiv (All)
• Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133arXiv (All)
• A Better-Than-$3$ Approximation Algorithm for Demand Matching via Knapsack Intersection LP and Contention Resolution#1011644arXiv (All)
• Robustness of Boolean networks to update modes: an application to hereditary angioedema#177064arXiv (OAI)
• Edge-coloring problems with forbidden patterns and planted colors#177099arXiv (OAI)
• Equitable Decompositions: A Gateway to Spectral Theory Through Graph Automorphisms#268172DigitalCommons@CalPoly
• The Maximum Mutual Visibility Set on a Cactus Graph and the Self-stabilizing Constructions#975304arXiv (All)
• Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825arXiv (All)
• Verification Software for Independent Sets on Trees#780710Figshare
• Bilevel programming for generating discrete representations in multiobjective optimization#955430Koc University Digital Collections
• Numerical experiments to "Robust fully discrete error bounds for the Kuznetsov equation in the inviscid limit"#976756Radar OAI Repository
• Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings#996848arXiv (All)
• Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism#1034478arXiv (All)
• Local Representatives and Shortest Completions for Next-to-Shortest Paths in Directed Graphs#1037623arXiv (All)
• Cluster deletion and clique partitioning in graphs with bounded clique number#617322arXiv (OAI Expanded)
• Cluster deletion and clique partitioning in graphs with bounded clique number#617822arXiv (All)
• Updated numerical experiments to "Robust fully discrete error bounds for the Kuznetsov equation in the inviscid limit"#976757Radar OAI Repository
• Computational Simulation and Algorithm Analysis for Solving Combinatorial Optimization Problems in Graph Theory and Discrete Mathematics#246976International Journal of Applied Mathematics and Computing
• Tag-systems for the Hilbert curve#970909HAL Science
• A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix#984772arXiv (All)
• Various Properties of Various Ultrafilters, Various Graph Width Parameters, and Various Connectivity Systems (with Survey)#147016arXiv (OAI)
• Enhancing sensor attack detection in supervisory control systems modeled by probabilistic automata#299174Springer Nature OA
• On the Number of Ways to Express a Set as a Union of Individually Interesting Sets#249822DigitalCommons@CalPoly
• Zero-error communication under discrete-time Markovian dynamics#254276HAL (France)
• Exterior-Algebra Port Holonomy in the Caccetta-Häggkvist Packet Reduction: No-Go Results, a Cycle-Type Defect Inequality, Stochastic Scattering, and Reproducible Finite Certificates#478438Figshare
• Independent Sets on Trees: Consecutive Log-Concavity Failures and an Exact Covariance Threshold#780711Figshare
• The Prime Clockwork: A Dynamic Representation of Modular and Multiplicative Arithmetic#926764arXiv (All)
• Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#661036arXiv (OAI Expanded)
• Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees#662086arXiv (All)