Related papers: Valuative invariants for large classes of matroids
We consider a specialization $Y_M(q,t)$ of the Tutte polynomial of a matroid $M$ which is inspired by analogy with the Potts model from statistical mechanics. The only information lost in this specialization is the number of loops of $M$.…
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a…
We provide a deletion formula for the inverse Kazhdan--Lusztig polynomial and the inverse $Z$-polynomial of a matroid. Our formulas provide analogues to the deletion formulas of Braden--Vysogorets for Kazhdan--Lusztig and $Z$-polynomials.…
In this paper we study the interplay between the operation of circuit-hyperplane relaxation and the Kazhdan--Lusztig theory of matroids. We obtain a family of polynomials, not depending on the matroids but only on their ranks, that relate…
We establish a connection between the algebraic geometry of the type B permutohedral toric variety and the combinatorics of delta-matroids. Using this connection, we compute the volume and lattice point counts of type B generalized…
Here we study the space of real hyperbolic plane curves that are invariant under actions of the cyclic and dihedral groups and show they have determinantal representations that certify this invariance. We show an analogue of Nuij's theorem…
A conjecture by Higman asserts that the number of conjugacy classes in the unipotent group of upper triangular matrices over a finite field depends polynomially on the number of elements of the field. We will study several alternative…
Continuous dually epi-translation invariant valuations on convex functions are characterized in terms of the Fourier-Laplace transform of the associated Goodey-Weil distributions. This description is used to obtain integral representations…
In 1999 Merino and Welsh conjectured that evaluations of the Tutte polynomial of a graph satisfy an inequality. In this short article we show that the conjecture generalized to matroids holds for the large class of all split matroids by…
Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…
The Tutte polynomial is a fundamental invariant associated to a graph, matroid, vector arrangement, or hyperplane arrangement. This short survey focuses on some of the most important results on Tutte polynomials of hyperplane arrangements.…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We introduce a presentation of the Chow ring of a matroid by a new set of generators, called "simplicial generators." These generators are analogous to nef divisors on projective toric varieties, and admit a combinatorial interpretation via…
In this note we generalize the convolution formula for the Tutte polynomial of Kook-Reiner-Stanton and Etienne-Las Vergnas to a more general setting that includes both arithmetic matroids and delta-matroids. As corollaries, we obtain new…
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…
We outline an algorithm for construction of functional bases of absolute invariants under the rotation group for sets of rank 2 tensors and vectors in the Euclidean space of arbitrary dimension. We will use our earlier results for symmetric…
The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
We partition in classes the set of matroids of fixed dimension on a fixed vertex set. In each class we identify two special matroids, respectively with minimal and maximal h-vector in that class. Such extremal matroids also satisfy a…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…