:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Zhao, Neil, Brockner, Emilee, Winslow, Asia, Seraydarian, Megan
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics 68U20
Online Access:	https://arxiv.org/abs/2401.12023
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On sampling diluted Spin-Glasses with unbounded interactions
by: Efthymiou, Charilaos, et al.
Published: (2026)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
by: López, Francisco, et al.
Published: (2023)

Belief Propagation Guided Decimation on Random k-XORSAT
by: Chatterjee, Arnab, et al.
Published: (2025)

De Bruijn Sequences with Minimum Discrepancy
by: Álvarez, Nicolás, et al.
Published: (2024)

Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
by: Chatterjee, Arnab
Published: (2025)

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank
by: Oki, Taihei, et al.
Published: (2022)

On sampling symmetric Gibbs distributions on sparse random graphs and hypergraphs
by: Efthymiou, Charilaos
Published: (2020)

An asymptotically optimal algorithm for generating bin cardinalities
by: Devroye, Luc, et al.
Published: (2024)

Regular $K_3$-irregular graphs
by: Hak, Artem, et al.
Published: (2025)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
by: Hatzel, Meike, et al.
Published: (2024)

Homomorphically Full Oriented Graphs
by: Bellitto, Thomas, et al.
Published: (2022)

A Weak Structural Form of Commutative Equivalence in Finite Codes
by: Kraizberg, Dean
Published: (2026)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)

Impact of (a)Synchronism on ECA: Towards a New Classification
by: Donoso-Leiva, Isabel, et al.
Published: (2025)

Circularity and repetitiveness in non-injective DF0L systems
by: Goulet-Ouellet, Herman, et al.
Published: (2025)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
by: S, Rajeshwari, et al.
Published: (2022)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Recovery of cyclic words by their subwords
by: Luchinin, Sergey, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)

Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)

Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)

Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)

Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)

On the pseudorandomness of Parry--Bertrand automatic sequences
by: Popoli, Pierre, et al.
Published: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)

Trifferent codes with small lengths
by: Kurz, Sascha
Published: (2023)

Dirac's theorem and the switch geometry of perfect matchings
by: Kang, Ross J., et al.
Published: (2026)

Homotopy equivalence of digital pictures in $\mathbb{Z}^2$
by: Lee, Dae-Woong, et al.
Published: (2025)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

Morse and Lusternik-Schnirelmann for graphs
by: Knill, Oliver
Published: (2024)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)

Faster and shorter synthesis of Hamiltonian simulation circuits
by: de Brugière, Timothée Goubault, et al.
Published: (2024)