Related papers: On the Bivariate Characteristic Polynomial of the …

C. Greene introduced the shuffle lattice as an idealized model for DNA mutation and discovered remarkable combinatorial and enumerative properties of this structure. We attempt an explanation of these properties from a lattice-theoretic…

Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…

In this paper we study some combinatorial properties of the shuffle algebra $S_{q_{1},q_{2}}$ with two complex parameters and, in particular, obtain the Hilbert series for $S_{q_{1},q_{2}}/I$, where $I$ is the ideal generated by $z-\lambda$…

The commutative trigonometric shuffle algebra ${\mathrm A}$ is a space of symmetric rational functions satisfying certain wheel conditions. We describe a ring isomorphism between ${\mathrm A}$ and the center of the Hecke algebra using a…

We show that the poset of shuffles introduced by Greene in 1988 is flag-symmetric, and we describe a "local" permutation action of the symmetric group on the maximal chains which is closely related to the flag symmetric function of the…

This paper studies biased riffle shuffles, first defined by Diaconis, Fill, and Pitman. These shuffles generalize the well-studied Gilbert-Shannon-Reeds shuffle and convolve nicely. An upper bound is given for the time for these shuffles to…

We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site…

We elaborate on the recent observation that evolution for twist knots simplifies when described in terms of triangular evolution matrix ${\cal B}$, not just its eigenvalues $\Lambda$, and provide a universal formula for ${\cal B}$,…

The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…

In this paper, we describe properties of the characteristic polynomial of a weighted lattice and show that it has a recursive description, which we use to obtain results on the critical exponent of $q$-polymatroids. We give a Critical…

The M-convexity of dual Schubert polynomials was first proven by Huh, Matherne, M\'esz\'aros, and St. Dizier in 2022. We give a full characterization of the supports of dual Schubert polynomials, which yields an elementary alternative proof…

We initiate the study of the Macdonald intersection polynomials $\operatorname{I}_{\mu^{(1)},\dots,\mu^{(k)}}[X;q,t]$, which are indexed by $k$-tuples of partitions $\mu^{(1)},\dots,\mu^{(k)}$. These polynomials are conjectured to be equal…

We investigate generalizations of the Charlier and the Meixner polynomials on the lattice N and on the shifted lattice N+1-\beta. We combine both lattices to obtain the bi-lattice N \cup (N+1-\beta) and show that the orthogonal polynomials…

Generalizing the famous Bernstein-Kushnirenko Theorem, Khovanskii proved in 1978 a combinatorial formula for the arithmetic genus of the compactification of a generic complete intersection associated to a family of lattice polytopes.…

To a singular knot K with n double points, one can associate a chord diagram with n chords. A chord diagram can also be understood as a 4-regular graph endowed with an oriented Euler circuit. L. Traldi introduced a polynomial invariant for…

We study matrix elements of the "chromomagnetic" operator on the lattice. This operator is contained in the strangeness-changing effective Hamiltonian which describes electroweak effects in the Standard Model and beyond. Having dimension 5,…

In 2007, the first author gave an alternative proof of the refined alternating sign matrix theorem by introducing a linear equation system that determines the refined ASM numbers uniquely. Computer experiments suggest that the numbers…

In order to have a multiresolution analysis, the scaling function must be refinable. That is, it must be the linear combination of 2-dilation, $\mathbb{Z}$-translates of itself. Refinable functions used in connection with wavelets are…

The goal of this article is to give an elementary proof of the double shuffle relations directly for the Goncharov and Manin motivic multiple zeta values. The shuffle relation is straightforward, but for the stuffle we use a modification of…

Brion's Formula realizes the Laurent polynomial of lattice points in a lattice polytope P as the sum of rational functions associated to the vertices of P. In this paper, we consider the special case where P is a generalized permutohedron.…