On maximizing the number of heads when you need to set aside at least one coin every round
Fuente:
arXiv
Guardado en:
| Autor principal: | van Doorn, Wouter |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
por: Janson, Svante, et al.
Publicado: (2025)
por: Janson, Svante, et al.
Publicado: (2025)
How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?
por: Ekhad, Shalosh B., et al.
Publicado: (2024)
por: Ekhad, Shalosh B., et al.
Publicado: (2024)
A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
por: Segert, Simon
Publicado: (2024)
por: Segert, Simon
Publicado: (2024)
Moments for generalizations of a coin flip game
por: Huang, Jia
Publicado: (2026)
por: Huang, Jia
Publicado: (2026)
A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
por: Pham, Huy Tuan
Publicado: (2024)
por: Pham, Huy Tuan
Publicado: (2024)
The Lovász number of random circulant graphs
por: Bandeira, Afonso S., et al.
Publicado: (2025)
por: Bandeira, Afonso S., et al.
Publicado: (2025)
Concentration of the hypergraph's weak independence number
por: Vakhrushev, Stepan
Publicado: (2025)
por: Vakhrushev, Stepan
Publicado: (2025)
Unimodular random one-ended planar graphs are sofic
por: Timar, Adam
Publicado: (2019)
por: Timar, Adam
Publicado: (2019)
The chromatic number of very dense random graphs
por: Yan, Zhifei
Publicado: (2024)
por: Yan, Zhifei
Publicado: (2024)
The number of descendants in a preferential attachment graph
por: Janson, Svante, et al.
Publicado: (2024)
por: Janson, Svante, et al.
Publicado: (2024)
On the number of spanning trees in random regular graphs
por: Greenhill, Catherine, et al.
Publicado: (2013)
por: Greenhill, Catherine, et al.
Publicado: (2013)
Universality of the matching number in percolated regular graphs
por: Diskin, Sahar, et al.
Publicado: (2025)
por: Diskin, Sahar, et al.
Publicado: (2025)
On the chromatic number of random triangle-free graphs
por: Mizgerd, Clayton, et al.
Publicado: (2025)
por: Mizgerd, Clayton, et al.
Publicado: (2025)
On the joint distribution of the area and the number of peaks for Bernoulli excursions
por: Kargin, Vladislav
Publicado: (2024)
por: Kargin, Vladislav
Publicado: (2024)
Lower bounds for the isoperimetric numbers of random regular graphs
por: Kolesnik, Brett, et al.
Publicado: (2013)
por: Kolesnik, Brett, et al.
Publicado: (2013)
Surprising identities for the greedy independent set on Cayley trees
por: Contat, Alice
Publicado: (2021)
por: Contat, Alice
Publicado: (2021)
Fibonacci numbers and the probability of polygon formation using random length sticks
por: Brennan, Mark, et al.
Publicado: (2026)
por: Brennan, Mark, et al.
Publicado: (2026)
A new lower bound for the Ramsey numbers $R(3,k)$
por: Campos, Marcelo, et al.
Publicado: (2025)
por: Campos, Marcelo, et al.
Publicado: (2025)
The largest $K_r$-free set of vertices in a random graph
por: Bohman, Tom, et al.
Publicado: (2026)
por: Bohman, Tom, et al.
Publicado: (2026)
A central limit theorem for the matching number of a sparse random graph
por: Glasgow, Margalit, et al.
Publicado: (2024)
por: Glasgow, Margalit, et al.
Publicado: (2024)
Triangle-free $d$-degenerate graphs have small fractional chromatic number
por: Martinsson, Anders
Publicado: (2025)
por: Martinsson, Anders
Publicado: (2025)
Sharp analysis on the joint distribution of the number of descents and inverse descents in a random permutation
por: Fredes, Luis, et al.
Publicado: (2024)
por: Fredes, Luis, et al.
Publicado: (2024)
Persistence probabilities of MA(1) sequences with Laplace innovations and $q$-deformed zigzag numbers
por: Aurzada, Frank, et al.
Publicado: (2025)
por: Aurzada, Frank, et al.
Publicado: (2025)
An explicit family of 30 blocks meeting every 6-set of [60] in at least two points
por: Gomes, Paulo Henrique Cunha
Publicado: (2026)
por: Gomes, Paulo Henrique Cunha
Publicado: (2026)
Power-law bounds for increasing subsequences in Brownian separable permutons and homogeneous sets in Brownian cographons
por: Borga, Jacopo, et al.
Publicado: (2023)
por: Borga, Jacopo, et al.
Publicado: (2023)
Normal approximation of the numbers of isolated edges and isolated 2-stars in uniform simple graphs with given vertex degrees
por: Imai, Ryo
Publicado: (2026)
por: Imai, Ryo
Publicado: (2026)
Fluctuations in the Aztec diamonds via a space-like maximal surface in Minkowski 3-space
por: Chelkak, Dmitry, et al.
Publicado: (2020)
por: Chelkak, Dmitry, et al.
Publicado: (2020)
The typical structure of dense claw-free graphs
por: Perkins, Will, et al.
Publicado: (2025)
por: Perkins, Will, et al.
Publicado: (2025)
A symbolic computational approach to the generalized gambler's ruin problem in one and two dimensions
por: Martinez, Lucy
Publicado: (2024)
por: Martinez, Lucy
Publicado: (2024)
Tree-indexed sums of Catalan numbers
por: Bostan, Alin, et al.
Publicado: (2025)
por: Bostan, Alin, et al.
Publicado: (2025)
Chebyshev centers and radius of the set of permutons
por: Maga, Balázs
Publicado: (2026)
por: Maga, Balázs
Publicado: (2026)
Completely greedy coin sets
por: Young, Andrew J.
Publicado: (2024)
por: Young, Andrew J.
Publicado: (2024)
Lacunary sequences whose reciprocal sums represent all rational numbers in an interval
por: van Doorn, Wouter, et al.
Publicado: (2025)
por: van Doorn, Wouter, et al.
Publicado: (2025)
Sunflowers in set systems with small VC-dimension
por: Balogh, József, et al.
Publicado: (2024)
por: Balogh, József, et al.
Publicado: (2024)
A proof of the Erdős primitive set conjecture
por: Lichtman, Jared Duker
Publicado: (2022)
por: Lichtman, Jared Duker
Publicado: (2022)
The proportion of permutations fixing a $k$-set
por: Green, Ben, et al.
Publicado: (2026)
por: Green, Ben, et al.
Publicado: (2026)
On the longest increasing subsequence and number of cycles of butterfly permutations
por: Peca-Medlin, John, et al.
Publicado: (2024)
por: Peca-Medlin, John, et al.
Publicado: (2024)
Short proofs in combinatorics, probability and number theory II
por: Alexeev, Boris, et al.
Publicado: (2026)
por: Alexeev, Boris, et al.
Publicado: (2026)
Recoverable systems and the maximal hard-core model on the triangular lattice
por: Wang, Geyang, et al.
Publicado: (2026)
por: Wang, Geyang, et al.
Publicado: (2026)
Self-avoiding walk is ballistic on graphs with more than one end
por: Lehner, Florian, et al.
Publicado: (2024)
por: Lehner, Florian, et al.
Publicado: (2024)
Ejemplares similares
-
How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
por: Janson, Svante, et al.
Publicado: (2025) -
How to Answer Questions of the Type: If you toss a coin n times, how likely is HH to show up more than HT?
por: Ekhad, Shalosh B., et al.
Publicado: (2024) -
A proof that HT is more likely to outnumber HH than vice versa in a sequence of n coin flips
por: Segert, Simon
Publicado: (2024) -
Moments for generalizations of a coin flip game
por: Huang, Jia
Publicado: (2026) -
A sharp version of Talagrand's selector process conjecture and an application to rounding fractional covers
por: Pham, Huy Tuan
Publicado: (2024)