Covering grids with multiplicity

DOI10.5070/C63362787arXiv2305.00825MaRDI QIDQ6204684

Simona Boyadzhiyska, Shagnik Das, Anurag Bishnoi, Unnamed Author

Publication date: 2 April 2024

Published in: Combinatorial Theory (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingcombinatorial geometrygrid coveringAlon-Füredi theorem

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Punctured combinatorial Nullstellensätze
• Understanding and using linear programming
• Polynomial multiplicities over finite fields and intersection sets
• Covering the cube by affine hyperplanes
• Covering finite fields with cosets of subspaces
• Partitions of vector spaces
• Intersection sets in AG(\(n,q\)) and a characterization of the hyperbolic quadric in PG\((3,q\))
• Graph polynomials and group coloring of graphs
• The \(n\)-queens completion problem
• On almost \(k\)-covers of hypercubes
• On the sharpness of Bruen's bound for intersection sets in Desarguesian affine spaces
• Combinatorial Nullstellensatz
• On Zeros of a Polynomial in a Finite Grid
• Three Combinatorial Perspectives on Minimal Codes
• Covering all points except one
• Polynomials that vanish to high order on most of the hypercube

This page was built for publication: Covering grids with multiplicity