Related papers: Combinatorial Cremona automorphisms and Coxeter ar…
We introduce a combinatorial model for the Milnor fibration of a complexified real arrangement using oriented matroids. It is a poset quasi-fibration, a notion recently introduced by the first author, whose domain is a subdivision of the…
Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…
This thesis presents new applications of Gale duality to the study of polytopes, point configurations and oriented matroids with extremal combinatorial properties. The first part of the thesis explores construction techniques for neighborly…
We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
This paper investigates the question of uniqueness of the reduced oriented matroid structure arising from root systems of a Coxeter group in real vector spaces. We settle the question for finite Coxeter groups, irreducible affine Weyl…
We study the combinatorics of modular flats of oriented matroids and the topological consequences for their Salvetti complexes. We show that the natural map to the localized Salvetti complex at a modular flat of corank one is what we call a…
Let $M$ be an arbitrary matroid with circuits $\mathcal{C}(M)$. We propose a definition of a derived matroid $\delta M$ that has as its ground set $\mathcal{C}(M)$. Unlike previous attempts of such a definition, our definition applies to…
We investigate the combinatorial and geometric properties of automorphism groups of universal right-angled Coxeter groups, which are the automorphism groups of free products of copies of Z_2. It is currently an open question as to whether…
A~$k$-associahedron is a simplicial complex whose facets, called~$k$-triangulations, are the inclusion maximal sets of diagonals of a convex polygon where no~$k+1$ diagonals mutually cross. Such complexes are conjectured for about a decade…
Quasiperiodic patterns described by polyhedral "atomic surfaces" and admitting matching rules are considered. It is shown that the cohomology ring of the continuous hull of such patterns is isomorphic to that of the complement of a torus…
Matroids are ubiquitous in modern combinatorics. As discovered by Gelfand, Goresky, MacPherson and Serganova there is a beautiful connection between matroid theory and the geometry of Grassmannians: realizable matroids correspond to torus…
Decorated and augmented nonlinear Grassmannians can be used to parametrize coadjoint orbits of classical diffeomorphism groups. We provide a general framework for decoration and augmentation functors that facilitates the construction of a…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…
It is known that there exist hyperplane arrangements with same underlying matroid that admit non-homotopy equivalent complement manifolds. In this work we show that, in any rank, complex central hyperplane arrangements with up to 7…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
A Euclidean oriented matroid program yields a partial ordering of the cocircuits of its cocircuit graph. We show that every linear extension of that ordering yields a topological sweep and induces a recursive atom-ordering (a shelling of…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
Polymatroids are combinatorial abstractions of subspace arrangements in the same way that matroids are combinatorial abstractions of hyperplane arrangements. By introducing augmented Chow rings of polymatroids, modeled after augmented…