Related papers: Cycle algebras and polytopes of matroids
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…
We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
In this paper, we study the notion of chordality and cycles in hypergraphs from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. However, there is no…
We prove that the topological cycles of an arbitrary infinite graph induce a matroid. This matroid in general is neither finitary nor cofinitary.
A matroid base polytope is a polytope in which each vertex has 0,1 coordinates and each edge is parallel to a difference of two coordinate vectors. Matroid base polytopes are described combinatorially by integral submodular functions on a…
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
We begin with a review of Tutte's homotopy theory, which concerns the structure of certain graph associated to a matroid (together with some extra data). Concretely, Tutte's path theorem asserts that this graph is connected, and his…
This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a…
In 2011, a topic containing the concepts of upper and lower periodic subsets of (basic) algebraic structures was introduced and studied. The concept of ``upper periodic subsets'' can be considered as a generalized topic of ideals and…
Formulas about the side lengths, diagonal lengths or radius of the circumcircle of a cyclic polygon in Euclidean geometry, hyperbolic geometry or spherical geometry can be unified.
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
A cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its…
This paper studies the algebraic boundary of the elliptope $\mathcal{E}(G)$ of a graph $G$. In particular, we completely characterize the algebraic boundary of $\mathcal{E}(G)$ when $G$ is cycle completable. In this case, the boundary is a…
This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…