Search arXivSearch

arXiv · math/0002094

Parallel connections and bundles of arrangements

Abstract

Let \A be a complex hyperplane arrangement, and let $X$ be a modular element of arbitrary rank in the intersection lattice of \A. We show that projection along $X$ restricts to a fiber bundle projection of the complement of \A to the complement of the localization $\A_X$ of \A at $X$. The fiber is the decone of a realization of the complete principal truncation of the underlying matroid of \A along the flat corresponding to $X$. This result gives a topological realization of results of Stanley, Brylawsky, and Terao on modular factorization. We show that (generalized) parallel connection of matroids corresponds to pullback of fiber bundles, clarifying the notion that all examples of diffeomorphisms of complements of inequivalent arrangements result from the triviality of the restriction of the Hopf bundle to the complement of a hyperplane. The modular fibration result also yields a new method for identifying $K(π,1)$ arrangements of rank greater than three. We identify a new families of $K(π,1)$ arrangements, providing more evidence for the conjecture that factored arrangements of arbitrary rank are $K(π,1)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael J. Falk, Nicholas J. Proudfoot. 2000-07-18. Parallel connections and bundles of arrangements. https://arxiv.org/abs/math/0002094

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