Search arXivSearch

arXiv · math/0010167

Line-closed matroids, quadratic algebras, and formal arrangements

Abstract

Let $G$ be a matroid on ground set \A. The Orlik-Solomon algebra $A(G)$ is the quotient of the exterior algebra \E on \A by the ideal \I generated by circuit boundaries. The quadratic closure $\bar{A}(G)$ of $A(G)$ is the quotient of \E by the ideal generated by the degree-two component of \I. We introduce the notion of \nbb set in $G$, determined by a linear order on \A, and show that the corresponding monomials are linearly independent in the quadratic closure $\bar{A}(G)$. As a consequence, $A(G)$ is a quadratic algebra only if $G$ is line-closed. An example of S.~Yuzvinsky proves the converse false. These results generalize to the degree $r$ closure of $\A(G)$. The motivation for studying line-closed matroids grew out of the study of formal arrangements. This is a geometric condition necessary for \A to be free and for the complement $M$ of \A to be a $K(π,1)$ space. Formality of \A is also necessary for $A(G)$ to be a quadratic algebra. We clarify the relationship between formality, line-closure, and other matroidal conditions related to formality. We give examples to show that line-closure of $G$ is not necessary or sufficient for $M$ to be a $K(π,1)$, or for \A to be free.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Falk. 2001-09-25. Line-closed matroids, quadratic algebras, and formal arrangements. https://arxiv.org/abs/math/0010167

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