Related papers: Enumerative combinatorics on determinants and sign…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
We initiate a study of determinantal representations with symmetry. We show that Grenet's determinantal representation for the permanent is optimal among determinantal representations respecting left multiplication by permutation and…
We define some generalizations of the classical descent and inversion statistics on signed permutations that arise from the work of Sack and Ulfarsson [20] and called after width-k descents and width-k inversionsof type A in Davis's work…
Motivated by the combinatorial properties of products in Lie algebras, we investigate the subset of permutations that naturally appears when we write the long commutator $[x_1, x_2, ..., x_m]$ as a sum of associative monomials. We…
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by D\'{e}sarm\'{e}nien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a…
We give a simple proof of a major index determinant formula in the symmetric group discovered by Krattenthaler and first proved by Thibon using noncommutative symmetric functions. We do so by proving a factorization of an element in the…
We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…
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…
We define multideterminantal probability measures, a family of probability measures on $[k]^n$ where $[k]=\{1,2,\dots,k\}$, generalizing determinantal measures (which correspond to the case $k=2$). We give examples coming from the positive…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…
A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…
We give an extension of the classical Schensted correspondence to the case of ribbon tableaux, where ribbons are allowed to be of different sizes. This is done by extending Fomin's growth diagram approach of the classical correspondence…
Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…
We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…
By introducing the notion of relative derangements of type $B$, also called signed relative derangements, which are defined in terms of signed permutations, we obtain a type $B$ analogue of the well-known relation between relative…
We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…
We are concerned with the problem of decomposing the parameter space of a parametric system of polynomial equations, and possibly some polynomial inequality constraints, with respect to the number of real solutions that the system attains.…
From a transfer formula in multivariate finite operator calculus, comes an expansion for the determinant similar to Ryser's formula for the permanent. Although this one contains many more terms than the usual determinant formula. To prove…