Search arXivSearch

arXiv · 2607.25598

Projective Ore-Degree Conditions for Intersection Theorems in Vector Spaces

Abstract

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb F_q$, and let $\mathcal F\subsetneq\genfrac{[}{]}{0pt}{}{V}{k}$. The \emph{projective Ore-degree} of $\mathcal F$ is the minimum, over all $k$-subspaces $S\notin\mathcal F$, of the sum of the $\mathcal F$-degrees of the projective points contained in $S$. We prove sharp projective Ore analogues of the vector-space Erdős--Ko--Rado and Hilton--Milner theorems. The Ore--Erdős--Ko--Rado theorem holds for $n\ge2k+1$, with equality only for a full point-star. For nontrivial intersecting families, we determine the sharp Ore--Hilton--Milner threshold, together with the complete equality classification, when $q\ge3$ and $n\ge2k+1$, or when $q\ge2$ and $n\ge2k+2$. We further determine a sharp projective Ore-degree threshold forcing a direct-sum matching of size $s$ when $s\ge3$ and $n\ge(2s-1)k-s+4$, and derive a multicolour Ramsey consequence.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mengyu Cao, Mei Lu, Xuyang Yan, Haixiang Zhang. 2026-07-29. Projective Ore-Degree Conditions for Intersection Theorems in Vector Spaces. https://arxiv.org/abs/2607.25598

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

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO