Arcs in \(\mathbb{F}_q^2\)

DOI10.1016/j.ejc.2022.103512zbMath1487.05038arXiv2003.03656OpenAlexW4213077935MaRDI QIDQ2136192

Oliver Roche-Newton, Audie Warren

Publication date: 10 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(p\)-random setCounting \(k\)-arcs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20)

Cites Work

• Unnamed Item
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Hypergraph containers
• For which densities are random triangle-free graphs almost surely bipartite?
• Applications of graph containers in the Boolean lattice
• An Asymptotic Formula in <inline-formula> <tex-math notation="TeX">\(q\) </tex-math></inline-formula> for the Number of <inline-formula> <tex-math notation="TeX">\([n, k~q\) </tex-math></inline-formula>-Ary MDS Codes]
• A Lower Bound for Heilbronn'S Problem
• Maximal Independent Subsets in Steiner Systems and in Planar Sets
• On the number of points in general position in the plane
• Formula for the number of [9,3 MDS codes]
• Independent sets in hypergraphs
• Ovals In a Finite Projective Plane
• Four‐term progression free sets with three‐term progressions in all large subsets

This page was built for publication: Arcs in \(\mathbb{F}_q^2\)