Related papers: Combinatorial interpretation and positivity of Ker…

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…

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…

We give a formula, in terms of products of commutators, for the application of the odd multiplicative character to higher Loday symbols. On our way we construct a product on the relative K-groups and investigate the multiplicative…

We prove a conjecture of Kontsevich, which asserts that the iterations of the noncommutative rational map $F_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1})$ are given by noncommutative Laurent polynomials with nonnegative integer coefficients.

We characterize compatible families of real-rooted polynomials, allowing both positive and negative leading coefficients. Our characterization naturally generalizes the same-sign characterization used by Chudnovsky and Seymour in their…

The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…

We consider the problem of defining polynomials over function fields of positive characteristic. Among other results, we show that the following assertions are true. 1. Let $\G_p$ be an algebraic extension of a field of $p$ elements and…

We give an elementary proof of the Kontsevich conjecture that asserts that the iterations of the noncommutative rational map K_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1}) are given by noncommutative Laurent polynomials.

In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…

We study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…

We give a simple proof of an explicit formula for Kerov polynomials. This formula is closely related to a formula of Goulden and Rattan.

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…

We give new definitions for the determinant over commutative ring $K$, noncommutative ring $\mathbf{K}$, noncommutative ring $\mathcal{K}$ with associative powers, over noncommutative nonassociative ring $\mathfrak{K}$, and study their…

Let $k$ be an algebraically closed field of positive characteristic $p$. We describe the full lattice of subfunctors of the diagonal $p$-permutation functor $kR_k$ obtained by $k$-linear extension from the functor $R_k$ of linear…

The Schur functions play a crucial role in the modern description of HOMFLY polynomials for knots and of topological vertices in DIM-based network theories, which could merge into a unified theory still to be developed. The Macdonald…

Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

We prove a conjecture of Lecouvey, which proposes a closed, positive combinatorial formula for symplectic Kostka-Foulkes polynomials, in the case of rows of arbitrary weight. To show this, we construct a new algorithm for computing…