Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.22175

Irreducibility, Smoothness, and Connectivity of Realization Spaces of Matroids and Hyperplane Arrangements

Emiliano Liwski·Fatemeh Mohammadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the realization spaces of matroids and hyperplane arrangements. First, we define the notion of naive dimension for the realization space of matroids and compare it with the expected dimension and the algebraic dimension, exploring the conditions under which these dimensions coincide. Next, we introduce the family of inductively connected matroids and investigate their realization spaces, establishing that they are smooth, irreducible, and isomorphic to a Zariski open subset of a complex space with a known dimension. Furthermore, we present an explicit procedure for computing their defining equations. As corollaries, we identify families of hyperplane arrangements whose moduli spaces are connected. Finally, we apply our results to study the rigidity of matroids. Rigidity, which involves matroids with a unique realization under projective transformations, is key to understanding the connectivity of the moduli spaces of the corresponding hyperplane arrangements.

Explore related subjects

math.COmath.ACmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emiliano Liwski, Fatemeh Mohammadi. 2024-10-29. Irreducibility, Smoothness, and Connectivity of Realization Spaces of Matroids and Hyperplane Arrangements. https://arxiv.org/abs/2410.22175

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗