Related papers: Convolution-multiplication identities for Tutte po…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
We introduce a binary matroid M(IAS(G)) associated with a looped simple graph G. M(IAS(G)) classifies G up to local equivalence, and determines the delta-matroid and isotropic system associated with G. Moreover, a parametrized form of its…
We show that the linear coefficient of the Ehrhart polynomial of a matroid base polytope evaluated at $t-1$ is equal to, up to normalization, the $\beta$-invariant of the matroid. This yields a lattice-point counting formula for the…
Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.
We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
Given an arbitrary ordered pair of coprime integers (a,b) we obtain a pair of identities of the Rogers--Ramanujan type. These identities have the same product side as the (first) Andrews--Gordon identity for modulus 2ab\pm 1, but an…
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.
Starting from the characteristic polynomial for ordinary matrices we give a combinatorial deduction of the Mandelstam identities and viceversa, thus showing that the two sets of relations are equivalent. We are able to extend this…
We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…
Let $UT_2$ be the algebra of $2\times 2$ upper triangular matrices over a field $F$ of characteristic zero. Here we study the generalized polynomial identities of $UT_2$, i.e., identical relations holding for $UT_2$ regarded as…
Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…
A new connection between two different necessary conditions for a polymatroid to be linearly representable is presented. Specifically, we prove that the existence of a tensor product with the uniform matroid of rank two on three elements…
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
In this article, certain symmetry identities for the 2-variable Apostol type polynomials are derived. By taking suitable values of parameters and indices, the symmetry identities for the special cases of the 2-variable Apostol type…
Convolution is a broadly useful operation with applications including signal processing, machine learning, probability, optics, polynomial multiplication, and efficient parsing. Usually, however, this operation is understood and implemented…
A map between manifolds induces stratifications of both the source and the target according to the occurring multisingularities. In this paper, we study universal expressions-called higher Thom polynomials-that describe the…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
We generalize theories of graph, matroid, and ribbon-graph activities to delta-matroids. As a result, we obtain an activities based feasible-set expansion for a transition polynomial of delta-matroids defined by Brijder and Hoogeboom. This…