Imagen de Portada

"Weak yet strong" restrictions of Hindman's Finite Sums Theorem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Carlucci, Lorenzo
Formato:	Preprint
Publicado:	2016
Materias:	Logic Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

New bounds on the strength of some restrictions of Hindman's Theorem
por: Carlucci, Lorenzo, et al.
Publicado: (2017)

A weak variant of Hindman's Theorem stronger than Hilbert's Theorem
por: Carlucci, Lorenzo
Publicado: (2016)

Regressive versions of Hindman's Theorem
por: Carlucci, Lorenzo, et al.
Publicado: (2022)

A note on Hindman-type theorems for uncountable cardinals
por: Carlucci, Lorenzo
Publicado: (2017)

The strength of Ramsey Theorem for coloring relatively large sets
por: Carlucci, Lorenzo, et al.
Publicado: (2012)

The adjacent Hindman's theorem for uncountable groups
por: Carlucci, Lorenzo, et al.
Publicado: (2020)

Reductions of well-ordering principles to combinatorial theorems
por: Carlucci, Lorenzo, et al.
Publicado: (2024)

Simple Models of Randomization and Preservation Theorems
por: Khanaki, Karim, et al.
Publicado: (2024)

Measurable Brooks's Theorem for Directed Graphs
por: Higgins, Cecelia
Publicado: (2024)

Hall's Harem Theorem with controlled sizes of cycles
por: Duda, Karol
Publicado: (2025)

Enumeration of Finite Distance Monoids
por: Luo, Yunjie, et al.
Publicado: (2025)

Finite combinatorics and computability theory
por: Dzhafarov, Damir D., et al.
Publicado: (2026)

Growth of regular partitions 2: Weak regularity
por: Terry, C.
Publicado: (2024)

Growth of regular partitions 4: strong regularity and the pairs partition
por: Terry, C.
Publicado: (2024)

Growth of regular partitions 3: strong regularity and the vertex partition
por: Terry, C.
Publicado: (2024)

Courcelle's Theorem: A Self-Contained Proof and a Path-Width Variant
por: Rettich, Adrian
Publicado: (2024)

Advances in Algorithmic Meta Theorems
por: Siebertz, Sebastian, et al.
Publicado: (2024)

A note on strong Erdős-Hajnal for graphs with bounded VC-minimal complexity
por: Fu, Yayi
Publicado: (2023)

The strength of Ramsey's theorem for $α$-large sets
por: Carlucci, Lorenzo, et al.
Publicado: (2026)

The adjacent Hindman's theorem and the $\mathbb Z$-Ramsey's theorem
por: Aceves-Martínez, Bruno Fernando, et al.
Publicado: (2024)

Weihrauch reducibility between Ramsey-type theorems and well-ordering principles at the level of $Σ^0_2$-induction: A pilot study
por: Carlucci, Lorenzo, et al.
Publicado: (2025)

Ramsey-like theorems for the Schreier barrier
por: Carlucci, Lorenzo, et al.
Publicado: (2024)

Polynomials as terms and the Boolean Independence Theorem
por: Klazar, M.
Publicado: (2024)

Partitioning Theorems for Sets of Semi-Pfaffian Sets, with Applications
por: Lotz, Martin, et al.
Publicado: (2024)

Composition Direction of Seymour's Theorem for Regular Matroids -- Formally Verified
por: Dvorak, Martin, et al.
Publicado: (2025)

A computable version of Hall's Harem Theorem and Geometric von Neumann Conjecture
por: Duda, Karol
Publicado: (2021)

Exponential Schur and Hindman Theorem in Ramsey Theory
por: Goswami, Sayan, et al.
Publicado: (2024)

On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
por: Džamonja, Mirna, et al.
Publicado: (2017)

Stable functions and Følner's Theorem
por: Conant, Gabriel
Publicado: (2024)

Free sets, thin sets and rainbows for barriers
por: Carlucci, Lorenzo, et al.
Publicado: (2026)

Borel Vizing's Theorem for Graphs of Subexponential Growth
por: Bernshteyn, Anton, et al.
Publicado: (2023)

The Finite Length Property of the Rado Graph and Friends
por: Yang, Jingjie, et al.
Publicado: (2026)

Indivisibility and uniform computational strength
por: Gill, Kenneth
Publicado: (2023)

Decomposing graphs into stable and ordered parts
por: Buffière, Hector, et al.
Publicado: (2025)

Monadic Second-Order Logic of Permutations
por: Jelínek, Vít, et al.
Publicado: (2025)

Decidability for Sturmian words
por: Hieronymi, Philipp, et al.
Publicado: (2021)

Local and global $d$-rigidity are not definable in the first order logic of graphs
por: Bernstein, Daniel Irving, et al.
Publicado: (2025)

Classification properties for some ternary structures
por: Miguel-Gómez, Alberto
Publicado: (2024)

The structure of subsets of $\mathbb{F}_p^n$ of bounded $\mathrm{VC}_2$-dimension
por: Terry, C., et al.
Publicado: (2025)

On the linear complexity of subsets of $\mathbb{F}_p^n$ bounded $\textrm{VC}_2$-dimension
por: Sheats, Hannah, et al.
Publicado: (2025)