Related papers: Generalized Monotone Triangles: an extended Combin…

In the case of two combinatorial polynomials, we show that they can exhibited as moments of paramaterized families of orthogonal polynomials, and hence derive their Hankel transforms. Exponential Riordan arrays are the main vehicles used…

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

In 2017 Aguiar and Ardila provided a generic way to construct polynomial invariants of combinatorial objects using the notions of Hopf monoids and characters of Hopf monoids. They show that it is possible to find a combinatorial…

In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta,…

We show that certain weighted average of the alpha-determinant of a $kn$ by $kn$ matrix of the form $A\otimes1_{1,k}$, the Kronecker product of a $kn$ by $n$ matrix $A$ and $1$ by $k$ all one matrix $1_{1,k}$, over permutations of $kn$…

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

In this paper, we consider a two-parameter polynomial generalization, denoted by G_{a,b}(n,k;r), of the r-Lah numbers which reduces to these recently introduced numbers when a=b=1. We present several identities for G_{a,b}(n,k;r) that…

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

We show that there exists a simple generalization of Kazakov's multicritical one-matrix model, which interpolates between the various multicritical points of the model. The associated multicritical potential takes the form of a power series…

This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

The incomplete tribonacci polynomials, denoted by T_n^{(s)}(x), generalize the usual tribonacci polynomials T_n(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial…

Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…

Let $A$ be an $n\times n$ matrix and let $\vee^k A$ be its $k$-th symmetric tensor product. We express the normalized trace of $\vee^k A$ as an integral of the $k$-th powers of the numerical values of $A$ over the unit sphere…

Combinatorial objects called rigged configurations give rise to q-analogues of certain Littlewood-Richardson coefficients. The Kostka-Foulkes polynomials and two-column Macdonald-Kostka polynomials occur as special cases. Conjecturally…