Incidence Bounds for Block Designs

DOI10.1137/140996707zbMath1353.05028arXiv1407.7513OpenAlexW2964144116MaRDI QIDQ2830440

Shubhangi Saraf, Ben D. Lund

Publication date: 28 October 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7513

zbMATH Keywords

finite fieldsincidence bounds

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Extremal combinatorics (05D99)

Related Items (13)

Triangle-free induced subgraphs of the unitary polarity graph ⋮ Finite Field Kakeya and Nikodym Sets in Three Dimensions ⋮ New values for the bipartite Ramsey number of the four-cycle versus stars ⋮ Number of directions determined by a set in \(\mathbb{F}_q^2\) and growth in \(\mathrm{Aff}(\mathbb{F}_q)\) ⋮ Long lines in subsets of large measure in high dimension ⋮ Elementary methods for incidence problems in finite fields ⋮ Threshold functions for incidence properties in finite vector spaces ⋮ Distinct spreads in vector spaces over finite fields ⋮ Extending Erdős-Beck's theorem to higher dimensions ⋮ Unnamed Item ⋮ Incidences between planes over finite fields ⋮ Minimal multiple blocking sets ⋮ Distinct distances between points and lines in \(\mathbb{F}_q^2\)

Cites Work

• Unnamed Item
• Unnamed Item
• The Szemerédi-Trotter theorem in the complex plane
• Areas of triangles and Beck's theorem in planes over finite fields
• On point-line incidences in vector spaces over finite fields
• On the Erdős distinct distances problem in the plane
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
• A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields
• Explicit construction of linear sized tolerant networks
• A sum-product estimate in finite fields, and applications
• Algebraic methods in discrete analogs of the Kakeya problem
• Combinatorial problems in finite fields and Sidon sets
• Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
• Sum-product theorems and incidence geometry
• An extension of a theorem of the Bruijn and Erdős on combinatorial designs
• Incidence Theorems and Their Applications
• Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets
• AN INCIDENCE CONJECTURE OF BOURGAIN OVER FIELDS OF POSITIVE CHARACTERISTIC
• The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane
• On the number of sums and products
• Fp is locally like ℂ
• From harmonic analysis to arithmetic combinatorics
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• On a problem in combinatorial geometry

This page was built for publication: Incidence Bounds for Block Designs