Note on a Coin Tossing Problem Posed by Daniel Litt
Fuente:
arXiv
Guardado en:
| Autor principal: | Levin, Bruce |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"
por: Levin, Bruce
Publicado: (2025)
por: Levin, Bruce
Publicado: (2025)
Daniel Litt's Probability Puzzle
por: Paterson, Maura B., et al.
Publicado: (2024)
por: Paterson, Maura B., et al.
Publicado: (2024)
Note on extremal problems about connected subgraph sums
por: Cambie, Stijn, et al.
Publicado: (2025)
por: Cambie, Stijn, et al.
Publicado: (2025)
Note on down-set thresholds
por: Warnke, Lutz
Publicado: (2023)
por: Warnke, Lutz
Publicado: (2023)
What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
por: Addario-Berry, Louigi, et al.
Publicado: (2026)
por: Addario-Berry, Louigi, et al.
Publicado: (2026)
Limits of Weighted Graphs via Random Quotients
por: Levin, Eitan, et al.
Publicado: (2025)
por: Levin, Eitan, et al.
Publicado: (2025)
The largest common subtree of two random trees
por: Angel, Omer, et al.
Publicado: (2025)
por: Angel, Omer, et al.
Publicado: (2025)
Lecture Notes on Edge Universality for Random Regular Graphs
por: Huang, Jiaoyang, et al.
Publicado: (2026)
por: Huang, Jiaoyang, et al.
Publicado: (2026)
Fringe trees of Patricia tries, compressed binary search trees, and three other random full binary trees
por: Janson, Svante
Publicado: (2024)
por: Janson, Svante
Publicado: (2024)
Asymptotics for the harmonic descent chain and applications to critical beta-splitting trees
por: Brandenberger, Anna, et al.
Publicado: (2025)
por: Brandenberger, Anna, et al.
Publicado: (2025)
Counting records in a random, non-uniform, permutation
por: Pittel, Boris
Publicado: (2025)
por: Pittel, Boris
Publicado: (2025)
Tight universal bounds on the height times the width of random trees
por: Donderwinkel, Serte, et al.
Publicado: (2024)
por: Donderwinkel, Serte, et al.
Publicado: (2024)
Critical trees are neither too short nor too fat
por: Addario-Berry, Louigi, et al.
Publicado: (2023)
por: Addario-Berry, Louigi, et al.
Publicado: (2023)
Terminal Defects, Growing Multiplicity, and Variance Extremality in the Double Dixie Cup Problem
por: Long, Christopher D.
Publicado: (2026)
por: Long, Christopher D.
Publicado: (2026)
Countable homogeneous ordered bipartite graphs
por: Truss, J. K.
Publicado: (2024)
por: Truss, J. K.
Publicado: (2024)
Strong coalitions in graphs
por: Golmohammadi, Hamidreza, et al.
Publicado: (2024)
por: Golmohammadi, Hamidreza, et al.
Publicado: (2024)
When will (game) wars end?
por: Bhatia, Manan, et al.
Publicado: (2023)
por: Bhatia, Manan, et al.
Publicado: (2023)
Random Domino Tilings and the Arctic Circle Theorem
por: Jockusch, William, et al.
Publicado: (1998)
por: Jockusch, William, et al.
Publicado: (1998)
On the class reconstruction number of trees
por: Krasikov, Ilia, et al.
Publicado: (2023)
por: Krasikov, Ilia, et al.
Publicado: (2023)
Logical aspects of isomorphism of controllable graphs and cospectrality of distance-regularized graphs
por: Abiad, Aida, et al.
Publicado: (2026)
por: Abiad, Aida, et al.
Publicado: (2026)
Leaper Embeddings
por: Beluhov, Nikolai
Publicado: (2025)
por: Beluhov, Nikolai
Publicado: (2025)
The $(\leq 6)$-half-reconstructibility of digraphs
por: Salem, Baraa, et al.
Publicado: (2013)
por: Salem, Baraa, et al.
Publicado: (2013)
Extending the Affirmative Action Problem: mixing numbers and integrated colorings of graphs
por: Burnette, Charles, et al.
Publicado: (2025)
por: Burnette, Charles, et al.
Publicado: (2025)
Central limit theorem for crossings in randomly embedded graphs
por: Arenas-Velilla, Santiago, et al.
Publicado: (2023)
por: Arenas-Velilla, Santiago, et al.
Publicado: (2023)
Central limit theorem for components in meandric systems through high moments
por: Janson, Svante, et al.
Publicado: (2023)
por: Janson, Svante, et al.
Publicado: (2023)
Limit distributions for cycles of random parking functions
por: Paguyo, J. E., et al.
Publicado: (2025)
por: Paguyo, J. E., et al.
Publicado: (2025)
Graph isomorphism and multivariate graph spectrum
por: Wang, Wei, et al.
Publicado: (2024)
por: Wang, Wei, et al.
Publicado: (2024)
On Oriented Colourings of Graphs on Surfaces
por: Clow, Alexander
Publicado: (2024)
por: Clow, Alexander
Publicado: (2024)
Paired domination in trees: A linear algorithm and asymptotic normality
por: Henning, Michael A., et al.
Publicado: (2025)
por: Henning, Michael A., et al.
Publicado: (2025)
On identity Seidel switches
por: Gervacio, Severino V.
Publicado: (2026)
por: Gervacio, Severino V.
Publicado: (2026)
Reconstruction of C_4-free graphs from the set of closed neighborhoods and digital convexity
por: Borgwardt, Steffen, et al.
Publicado: (2025)
por: Borgwardt, Steffen, et al.
Publicado: (2025)
Bound for the energy of graphs in terms of degrees and leaves
por: Arizmendi, Octavio, et al.
Publicado: (2025)
por: Arizmendi, Octavio, et al.
Publicado: (2025)
Packing subdivisions into regular graphs
por: Montgomery, Richard, et al.
Publicado: (2025)
por: Montgomery, Richard, et al.
Publicado: (2025)
Homomorphic Preimages of Geometric Cycles
por: Cockburn, Sally
Publicado: (2015)
por: Cockburn, Sally
Publicado: (2015)
Fair coalition in graphs
por: Alikhani, Saeid, et al.
Publicado: (2025)
por: Alikhani, Saeid, et al.
Publicado: (2025)
A note on the distribution of the sum of lengths of the initial longest increasing sequences in cycles of random permutations
por: Mutafchiev, Ljuben
Publicado: (2025)
por: Mutafchiev, Ljuben
Publicado: (2025)
Thresholds for patterns in random permutations with a given number of inversions
por: Bevan, David, et al.
Publicado: (2023)
por: Bevan, David, et al.
Publicado: (2023)
The sharp threshold for jigsaw percolation in random graphs
por: Cooley, Oliver, et al.
Publicado: (2018)
por: Cooley, Oliver, et al.
Publicado: (2018)
Monochromatic Subgraphs in Randomly Colored Dense Multiplex Networks
por: Andrade, Mauricio Daros, et al.
Publicado: (2025)
por: Andrade, Mauricio Daros, et al.
Publicado: (2025)
Large expander subgraphs in high genus triangulations
por: Lions, Tanguy, et al.
Publicado: (2026)
por: Lions, Tanguy, et al.
Publicado: (2026)
Ejemplares similares
-
Proof of a combinatorial conjecture posed in "The Blimpy Shape of Heady-s and Taily-s Bit Strings"
por: Levin, Bruce
Publicado: (2025) -
Daniel Litt's Probability Puzzle
por: Paterson, Maura B., et al.
Publicado: (2024) -
Note on extremal problems about connected subgraph sums
por: Cambie, Stijn, et al.
Publicado: (2025) -
Note on down-set thresholds
por: Warnke, Lutz
Publicado: (2023) -
What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
por: Addario-Berry, Louigi, et al.
Publicado: (2026)