Gröbner bases for increasing sequences

DOI10.37236/11437zbMATH Open1542.13023MaRDI QIDQ6574394

Gábor Hegedüs, Lajos Rónyai

Publication date: 18 July 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Gröbner basesKakeya problem

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Combinatorial aspects of finite geometries (05B25) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved lower bound on the size of Kakeya sets over finite fields
• On the finite field Kakeya problem in two dimensions
• Covering the cube by affine hyperplanes
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• Some tapas of computer algebra
• On intersection sets in Desarguesian affine spaces
• Standard monomials and extremal vector systems
• Intersection sets in AG(\(n,q\)) and a characterization of the hyperbolic quadric in PG\((3,q\))
• Recognizing graph theoretic properties with polynomial ideals
• New affine-invariant codes from lifting
• Some Combinatorial Applications of Gröbner Bases
• On the size of Kakeya sets in finite fields
• Combinatorial Nullstellensatz
• Finite Field Kakeya and Nikodym Sets in Three Dimensions
• New bounds on the density of lattice coverings
• Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
• Covering all points except one

This page was built for publication: Gröbner bases for increasing sequences