Search arXivSearch

arXiv · math/9805128

Orlik-Solomon algebras and Tutte polynomials

Abstract

The $OS$ algebra $A$ of a matroid $M$ is a graded algebra related to the Whitney homology of the lattice of flats of $M$. In case $M$ is the underlying matroid of a hyperplane arrangement \A in $\C^r$, $A$ is isomorphic to the cohomology algebra of the complement $\C^r\setminus \bigcup \A.$ Few examples are known of pairs of arrangements with non-isomorphic matroids but isomorphic $OS$ algebras. In all known examples, the Tutte polynomials are identical, and the complements are homotopy equivalent but not homeomorphic. We construct, for any given simple matroid $M_0$, a pair of infinite families of matroids $M_n$ and $M'_n$, $n\geq 1$, each containing $M_0$ as a submatroid, in which corresponding pairs have isomorphic $OS$ algebras. If the seed matroid $ M_0$ is connected, then $M_n$ and $M'_n$ have different Tutte polynomials. As a consequence of the construction, we obtain, for any $m$, $m$ different matroids with isomorphic $OS$ algebras. Suppose one is given a pair of central complex hyperplane arrangements $\A_0$ and $\A_1$. Let $§$ denote the arrangement consisting of the hyperplane $\{0\}$ in $\C^1$. We define the parallel connection $P(\A_0,\A_1)$, an arrangement realizing the parallel connection of the underlying matroids, and show that the direct sums $\A_0 \oplus \A_1$ and $§\oplus P(\A_0,\A_1)$ have diffeomorphic complements.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Carrie Eschenbrenner, Michael Falk. 1998-05-27. Orlik-Solomon algebras and Tutte polynomials. https://arxiv.org/abs/math/9805128

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

KEEP EXPLORING

Related papers

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

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