Cover Image

Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Levin, Bruce
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 60C05
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Note on a Coin Tossing Problem Posed by Daniel Litt
by: Levin, Bruce
Published: (2024)

A combinatorial approach to phase transitions in random graph isomorphism problems
by: Diamantidis, Dimitris, et al.
Published: (2024)

A concentration inequality for random combinatorial optimisation problems
by: Danielsson, Joel Larsson
Published: (2024)

The acyclic directed bunkbed conjecture is false
by: Przybyłowski, Tomasz
Published: (2025)

Improvement on the Erdős-Kleitman conjecture via the KKL theorem
by: Ge, Gennian, et al.
Published: (2026)

Multinomial random combinatorial structures and $r$-versions of Stirling, Eulerian and Lah numbers
by: Iksanov, Alexander, et al.
Published: (2024)

The bunkbed conjecture remains true when gluing along a vertex
by: Meunier, Paul, et al.
Published: (2024)

An Alternative Proof for the Expected Number of Distinct Consecutive Patterns in a Random Permutation
by: Godbole, Anant, et al.
Published: (2023)

Generalization and Probabilistic Proofs of Some Combinatorial Identities
by: Vellaisamy, Palaniappan, et al.
Published: (2026)

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
by: Addario-Berry, Louigi, et al.
Published: (2026)

Limits of Weighted Graphs via Random Quotients
by: Levin, Eitan, et al.
Published: (2025)

Typical values of extremal-weight combinatorial structures with independent symmetric weights
by: Cheng, Yun, et al.
Published: (2022)

The largest common subtree of two random trees
by: Angel, Omer, et al.
Published: (2025)

The bunkbed conjecture is false
by: Gladkov, Nikita, et al.
Published: (2024)

On combinatorial properties of Gruenberg--Kegel graphs of finite groups
by: Chen, Mingzhu, et al.
Published: (2024)

Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
by: Brandenberger, Anna, et al.
Published: (2025)

Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
by: Janson, Svante
Published: (2024)

The bunkbed conjecture is not robust to generalisation
by: Hollom, Lawrence
Published: (2024)

Counting records in a random, non-uniform, permutation
by: Pittel, Boris
Published: (2025)

Minimum algebraic connectivity and maximum diameter: Aldous--Fill and Guiduli--Mohar conjectures
by: Abdi, Maryam, et al.
Published: (2022)

Tight universal bounds on the height times the width of random trees
by: Donderwinkel, Serte, et al.
Published: (2024)

Critical trees are neither too short nor too fat
by: Addario-Berry, Louigi, et al.
Published: (2023)

Leaper Embeddings
by: Beluhov, Nikolai
Published: (2025)

Countable homogeneous ordered bipartite graphs
by: Truss, J. K.
Published: (2024)

When will (game) wars end?
by: Bhatia, Manan, et al.
Published: (2023)

Random Domino Tilings and the Arctic Circle Theorem
by: Jockusch, William, et al.
Published: (1998)

On the class reconstruction number of trees
by: Krasikov, Ilia, et al.
Published: (2023)

Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
by: Abiad, Aida, et al.
Published: (2026)

Strong coalitions in graphs
by: Golmohammadi, Hamidreza, et al.
Published: (2024)

The $(\leq 6)$-half-reconstructibility of digraphs
by: Salem, Baraa, et al.
Published: (2013)

A combinatorial introduction to Adinkras
by: Donley Jr, Robert W., et al.
Published: (2024)

Limit distributions for cycles of random parking functions
by: Paguyo, J. E., et al.
Published: (2025)

Central limit theorem for crossings in randomly embedded graphs
by: Arenas-Velilla, Santiago, et al.
Published: (2023)

Central limit theorem for components in meandric systems through high moments
by: Janson, Svante, et al.
Published: (2023)

Paired domination in trees: A linear algorithm and asymptotic normality
by: Henning, Michael A., et al.
Published: (2025)

Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
by: Borgwardt, Steffen, et al.
Published: (2025)

Bound for the energy of graphs in terms of degrees and leaves
by: Arizmendi, Octavio, et al.
Published: (2025)

Packing subdivisions into regular graphs
by: Montgomery, Richard, et al.
Published: (2025)

Fair coalition in graphs
by: Alikhani, Saeid, et al.
Published: (2025)

On identity Seidel switches
by: Gervacio, Severino V.
Published: (2026)