Related papers: Corners and simpliciality in oriented matroids and…
We analyze combinatorial structures which play a central role in determining spectral properties of the volume operator in loop quantum gravity (LQG). These structures encode geometrical information of the embedding of arbitrary valence…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
In our recent work we described conditions under which a multi-parameter random simplicial complex is connected and simply connected. We showed that the Betti numbers of multi-parameter random simplicial complexes in one specific dimension…
Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…
This paper examines the spectral characterizations of oriented graphs. Let $\Sigma$ be an $n$-vertex oriented graph with skew-adjacency matrix $S$. Previous research mainly focused on self-converse oriented graphs, proposing arithmetic…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…
Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…
A well-known conjecture of Stanley is that the h-vector of a matroid is a pure O-sequence. There have been numerous papers with partial progress on this conjecture, but it is still wide open. In particular, for graphic matroids coming from…
A sweep of a point configuration is any ordered partition induced by a linear functional. Posets of sweeps of planar point configurations were formalized and abstracted by Goodman and Pollack under the theory of allowable sequences of…
Given a 3-connected biased graph $\Omega$ with a balancing vertex, and with frame matroid $F(\Omega)$ nongraphic and 3-connected, we determine all biased graphs $\Omega'$ with $F(\Omega') = F(\Omega)$. As a consequence, we show that if $M$…
We initiate the axiomatic study of affine oriented matroids (AOMs) on arbitrary ground sets, obtaining fundamental notions such as minors, reorientations and a natural embedding into the frame work of Complexes of Oriented Matroids. The…
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most $k$ of its vertices. In a breakthrough result Reed, Smith, and Vetta (Operations Research Letters, 2004) gave a $\BigOh(4^kkmn)$…
Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to…
We consider collections of disjoint simple closed curves in a compact orientable surface which decompose the surface into pairs of pants. The isotopy classes of such curve systems form the vertices of a 2-complex, whose edges correspond to…
Positive geometries are semialgebraic sets equipped with a canonical differential form whose residues mirror the boundary structure of the geometry. Every full-dimensional projective polytope is a positive geometry. Motivated by the…
We introduce the poset of biflats of a matroid $M$, a Lagrangian analog of the lattice of flats of $M$, and study the topology of its order complex, which we call the biflats complex. This work continues the study of the Lagrangian…
We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…
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 is an introductory paper about the category of regular oriented matroids (ROMs). We compare the homotopy types of the categories of regular and binary matroids. For example, in the unoriented case, they have the same fundamental group…