Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.07737

Liftable Point-Line Configurations: Defining Equations and Irreducibility of Associated Matroid and Circuit Varieties

Oliver Clarke·Giacomo Masiero·Fatemeh Mohammadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which an $n$-tuple of collinear points can be lifted to a non-degenerate realisation of a point-line configuration. We show that forest configurations are liftable and characterise the realisation space of liftable configurations as the solution set of certain linear systems of equations. Moreover, we study the Zariski closure of the realisation spaces of liftable and quasi-liftable configurations, known as matroid varieties, and establish their irreducibility. Additionally, we compute an irreducible decomposition for their corresponding circuit varieties. Applying these liftability properties, we present a procedure generate some of the defining equations of the associated matroid varieties. As corollaries, we provide a geometric representation for the defining equations of two specific examples: the quadrilateral set and the $3\times4$ grid. While the polynomials for the latter were previously computed using specialised algorithms tailored for this configuration, the geometric interpretation of these generators was missing. We compute a minimal generating set for the corresponding ideals.

Explore related subjects

math.COmath.ACmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Clarke, Giacomo Masiero, Fatemeh Mohammadi. 2024-02-12. Liftable Point-Line Configurations: Defining Equations and Irreducibility of Associated Matroid and Circuit Varieties. https://arxiv.org/abs/2402.07737

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗