Search arXivSearch

arXiv · 2402.07882

Affine vector space partitions and spreads of quadrics

Abstract

An affine spread is a set of subspaces of $\mathrm{AG}(n, q)$ of the same dimension that partitions the points of $\mathrm{AG}(n, q)$. Equivalently, an {\em affine spread} is a set of projective subspaces of $\mathrm{PG}(n, q)$ of the same dimension which partitions the points of $\mathrm{PG}(n, q) \setminus H_{\infty}$; here $H_{\infty}$ denotes the hyperplane at infinity of the projective closure of $\mathrm{AG}(n, q)$. Let $\mathcal{Q}$ be a non degenerate quadric of $H_\infty$ and let $Π$ be a generator of $\mathcal{Q}$, where $Π$ is a $t$-dimensional projective subspace. An affine spread $\mathcal{P}$ consisting of $(t+1)$-dimensional projective subspaces of $\mathrm{PG}(n, q)$ is called hyperbolic, parabolic or elliptic (according as $\mathcal{Q}$ is hyperbolic, parabolic or elliptic) if the following hold: each member of $\mathcal{P}$ meets $H_\infty$ in a distinct generator of $\mathcal{Q}$ disjoint from $Π$; elements of $\mathcal{P}$ have at most one point in common; if $S, T \in \mathcal{P}$, $|S \cap T| = 1$, then $\langle S, T \rangle \cap \mathcal{Q}$ is a hyperbolic quadric of $\mathcal{Q}$. In this note it is shown that a hyperbolic, parabolic or elliptic affine spread of $\mathrm{PG}(n, q)$ is equivalent to a spread of $\mathcal{Q}^+(n+1, q)$, $\mathcal{Q}(n+1, q)$ or $\mathcal{Q}^-(n+1, q)$, respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Somi Gupta, Francesco Pavese. 2024-02-12. Affine vector space partitions and spreads of quadrics. https://arxiv.org/abs/2402.07882

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO