Imagen de Portada

New upper bounds for the size of set systems with restricted intersections modulo prime powers

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Hegedüs, Gábor
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics 05D05, 12D99, 15A03
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Upper bounds for the size of ordered $L$-intersecting set systems
por: Hegedüs, Gábor
Publicado: (2024)

A new upper bound for codes with a single Hamming distance
por: Hegedüs, Gábor
Publicado: (2024)

About Füredi's conjecture
por: Hegedüs, Gábor
Publicado: (2024)

A uniform version of a theorem by Lindström
por: Hegedüs, Gábor
Publicado: (2026)

On hierarchically closed fractional intersecting families
por: Balachandran, Niranjan, et al.
Publicado: (2022)

An ensemble of high rank matrices arising from tournaments
por: Balachandran, Niranjan, et al.
Publicado: (2021)

Disjoint pairs in set systems and combinatorics of low rank matrices
por: Hunter, Zach, et al.
Publicado: (2024)

The maximal sum of sizes of cross intersecting families for multisets
por: Wang, Hongkui, et al.
Publicado: (2024)

Bounded fractional intersecting families are linear in size
por: Balachandran, Niranjan, et al.
Publicado: (2024)

Large sets near idempotent and its product
por: Biswas, Surajit, et al.
Publicado: (2024)

More Shattering News
por: Sali, Attila, et al.
Publicado: (2026)

Parametrizing the Ramsey theory of vector spaces I: Discrete spaces
por: Smythe, Iian B.
Publicado: (2021)

Maximal sets of a given diameter in Hamming cubes
por: Bukh, Boris, et al.
Publicado: (2025)

What is the maximal connected partial symmetry index of a connected graph of a given size?
por: Janelidze, Z., et al.
Publicado: (2025)

Note as to size-minimal hypercompletly separating systems
por: Batikova, B., et al.
Publicado: (2026)

On degree bounds of $k$-uniform hypergraphs with bounded matching number
por: Zhang, Haixiang, et al.
Publicado: (2026)

Multiple typical ranks in matrix completion
por: Dressler, Mareike, et al.
Publicado: (2020)

Non-empty pairwise cross-intersecting families
por: Huang, Yang, et al.
Publicado: (2023)

Counting sunflowers with restricted matching number
por: Zhang, Haixiang, et al.
Publicado: (2026)

Cofinal families of finite VC-dimension
por: Ben-Neria, Omer, et al.
Publicado: (2025)

Most frequent subsequences in a word
por: Bukh, Boris, et al.
Publicado: (2025)

Characterization of matchable sets and subspaces via Dyson transforms
por: Aliabadi, Mohsen, et al.
Publicado: (2025)

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

A generalization of Croot-Lev-Pach's Lemma and a new upper bound for the size of difference sets in polynomial rings
por: Hegedüs, Gábor
Publicado: (2018)

Matching and intersection problems for non-trivial $r$-partite $r$-uniform hypergraphs
por: Frankl, Peter, et al.
Publicado: (2026)

Product of some large sets near idempotent
por: Biswas, Surajit, et al.
Publicado: (2021)

Obligatory hypergraphs
por: Reiher, Christian
Publicado: (2024)

The Newton polytope and Lorentzian property of chromatic symmetric functions
por: Matherne, Jacob P., et al.
Publicado: (2022)

Balancing games on unbounded sets
por: Bárány, Imre, et al.
Publicado: (2025)

Triangular tensors and set-intersection problems
por: Ahmadi, Omran, et al.
Publicado: (2025)

Alternating Power Difference and Matrix Symmetry: Closed-Form Formulas for the First Appearance Degree $m_1$
por: Takemura, Kenichi
Publicado: (2025)

Structured sunflowers and canonical Ramsey properties
por: Sullivan, Rob, et al.
Publicado: (2026)

The measurable Hall theorem fails for treeings
por: Kun, Gábor
Publicado: (2021)

Hermitian rank in ideal powers
por: Helal, Abdullah Al, et al.
Publicado: (2025)

The barrier Ramsey theorem
por: Marcone, Alberto, et al.
Publicado: (2025)

Further generalization of central sets theorem for partial semigroups and vip systems
por: Pramanick, Anik, et al.
Publicado: (2025)

New bounds on even cycle creating Hamiltonian paths using expander graphs
por: Harcos, Gergely, et al.
Publicado: (2019)

Intersecting families with bounded intersections
por: Ago, Kristina, et al.
Publicado: (2026)

Pattern Forcing (0,1)-Matrices
por: Cao, Lei, et al.
Publicado: (2025)

Upper Bounds for Sequence Saturation
por: Kanungo, Shihan
Publicado: (2025)