Related papers: Combinatorial Cremona automorphisms and Coxeter ar…
In this paper, we consider the automorphism groups of the Cayley graph with respect to the Coxeter generators and the Davis complex of an arbitrary Coxeter group. We determine for which Coxeter groups these automorphism groups are discrete.…
This paper examines a systematic method to construct a pair of (inter-related) root systems for arbitrary Coxeter groups from a class of non-standard geometric representations. This method can be employed to construct generalizations of…
Matroids and semigraphoids are discrete structures abstracting and generalizing linear independence among vectors and conditional independence among random variables, respectively. Despite the different nature of conditional independence…
2-colored quasi best match graphs (2-qBMGs) are directed graphs that arose in phylogenetics. Investigations of 2-qBMGs have mostly focused on computational issues. However, 2-qBMGs also have relevant properties for structural graph theory;…
We give a combinatorial characterization of minimally rigid planar frameworks with orientation-preserving crystallographic symmetry, under the constraint of forced symmetry. The main theorems are proved by extending the methods of the first…
Given a dissimilarity map $\delta$ on finite set $X$, the set of ultrametrics (equidistant tree metrics) which are $l^\infty$-nearest to $\delta$ is a tropical polytope. We give an internal description of this tropical polytope which we use…
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
In this paper, we investigate birational toric morphisms between quantum toric stacks -- namely, toric (analytic) stacks associated with fans whose cones may be irrational -- focusing on two primary classes of examples: weighted blow-ups…
We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic.…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in $\Sigma_2^p$. In the case of linear matroids, which are represented over polynomially growing fields, we note that the problem is…
We show that Verdier duality for certain sheaves on the moduli spaces of graphs associated to Koszul operads corresponds to Koszul duality of operads. This in particular gives a conceptual explanation of the appearance of graph cohomology…
We provide a combinatorial interpretation of the Kazhdan--Lusztig polynomial of the matroid arising from the braid arrangement of type $\mathrm{A}_{n-1}$, which gives an interpretation of the intersection cohomology Betti numbers of the…
We introduce a new class of matroids, called graph curve matroids. A graph curve matroid is associated to a graph and defined on the vertices of the graph as a ground set. We prove that these matroids provide a combinatorial description of…
We present a combinatorial procedure (based on the W-graph of the Coxeter group) which shows that the characters of many intersection cohomology complexes on low rank complex flag varieties with coefficients in an arbitrary field are given…
To any bimodule which is finitely generated and projective on one side one can associate a coring, known as a comatrix coring. A new description of comatrix corings in terms of data reminiscent of a Morita context is given. It is also…
Assuming the spin-independence for confining force, we give a covariant quark representation of general composite meson systems with definite Lorentz transformation properties. For benefit of this representation we are able to deduce…
Matroids give rise to several natural constructions of polytopes. Inspired by this, we examine polytopes that arise from the signed circuits of an oriented matroid. We give the dimensions of these polytopes arising from graphical oriented…
Schubert varieties of hyperplane arrangements, also known as matroid Schubert varieties, play an essential role in the proof of the Dowling-Wilson conjecture and in Kazhdan-Lusztig theory for matroids. We study these varieties as…
The investigation of combinatorial diameters of polyhedra is a classical topic in linear programming due to its connection with the possibility of an efficient pivot rule for the simplex method. We are interested in the diameters of…