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