Imagen de Portada

Completely greedy coin sets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Young, Andrew J.
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A note on the random greedy independent set algorithm
por: Bennett, Patrick, et al.
Publicado: (2013)

Surprising identities for the greedy independent set on Cayley trees
por: Contat, Alice
Publicado: (2021)

On maximizing the number of heads when you need to set aside at least one coin every round
por: van Doorn, Wouter
Publicado: (2024)

The third positive element in the greedy $B_h$-set
por: Nathanson, Melvyn B.
Publicado: (2023)

The fourth positive element in the greedy $B_h$-set
por: Nathanson, Melvyn B., et al.
Publicado: (2023)

On eventually greedy best underapproximations by Egyptian fractions
por: Kovač, Vjekoslav
Publicado: (2024)

The change-making problem for six coin values and beyond
por: Van Cott, Cornelia A., et al.
Publicado: (2023)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
por: Beaudou, Laurent, et al.
Publicado: (2021)

Intervals in the greedy Tamari posets
por: Bousquet-Mélou, Mireille, et al.
Publicado: (2023)

Moments for generalizations of a coin flip game
por: Huang, Jia
Publicado: (2026)

A coin flip game and generalizations of Fibonacci numbers
por: Huang, Jia
Publicado: (2025)

On higher dimensional point sets in general position
por: Suk, Andrew, et al.
Publicado: (2022)

Large deviations of the greedy independent set algorithm on sparse random graphs
por: Kolesnik, Brett
Publicado: (2020)

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)

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)

On the set partitions that require maximum sorts through the $aba-$avoiding stack
por: Choi, Yunseo, et al.
Publicado: (2024)

A greedy heuristic for graph burning
por: García-Díaz, Jesús, et al.
Publicado: (2024)

There are infinitely many Hilbert cubes of dimension 3 in the set of squares
por: Bremner, Andrew, et al.
Publicado: (2026)

Separations of sets
por: Bowler, Nathan, et al.
Publicado: (2018)

How many coin tosses would you need until you get $n$ Heads or $m$ Tails?
por: Janson, Svante, et al.
Publicado: (2025)

General position sets, colinear sets, and Sierpiński product graphs
por: Klavžar, Sandi, et al.
Publicado: (2024)

On the number of minimum dominating sets and total dominating sets in forests
por: Petr, Jan, et al.
Publicado: (2022)

The sum-product problem for small sets
por: Clevenger, Ginny Ray, et al.
Publicado: (2023)

A note on strong blocking sets and higgledy-piggledy sets of lines
por: Lia, Stefano, et al.
Publicado: (2024)

Sumsets of random sets
por: Nenadov, Rajko, et al.
Publicado: (2026)

Profinite tree sets
por: Kneip, Jay Lilian
Publicado: (2019)

Towards a Complete Local-Global Principle
por: Kuzmanovski, Nikola
Publicado: (2024)

An EKR Theorem for the Cartesian Product of Complete Graphs
por: Joseph, Zaphenath
Publicado: (2025)

Colouring Complete Multipartite and Kneser-type Digraphs
por: Harutyunyan, Ararat, et al.
Publicado: (2023)

New Method for Constructing Complete Cap Sets
por: Karapetyana, Iskandar, et al.
Publicado: (2026)

Associated Permutations of Complete Non-Ambiguous Trees
por: Chen, Daniel, et al.
Publicado: (2022)

The speed of convergence in greedy Galois games
por: Shallit, Jeffrey
Publicado: (2026)

Zero forcing irredundant sets
por: Curtis, Bryan A., et al.
Publicado: (2024)

Nowhere dense Ramsey sets
por: Rödl, Vojtěch, et al.
Publicado: (2024)

On skew corner-free sets
por: Pohoata, Cosmin, et al.
Publicado: (2024)

Exact results on traces of sets
por: Li, Mingze, et al.
Publicado: (2024)

Minors in small-set expanders
por: Krivelevich, Michael, et al.
Publicado: (2025)

Regular fat linear sets
por: Smaldore, Valentino, et al.
Publicado: (2025)

Global coalition sets in graphs
por: Besharati, Nazli, et al.
Publicado: (2025)

Alternative Proof of the Determinant of Complete Non-Ambiguous Trees
por: Chen, Daniel
Publicado: (2024)