Related papers: Combinatorial interpretation and positivity of Ker…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
We investigate a family of permutation polynomials of finite fields of characteristic 2. Through a connection between permutation polynomials and quadratic forms, a general treatment is presented to characterize these permutation…
In this paper, we get several new results on permutation polynomials over finite fields. First, by using the linear translator, we construct permutation polynomials of the forms $L(x)+\sum_{j=1}^k \gamma_jh_j(f_j(x))$ and…
We establish a set of recursion relations for the coefficients in the chromatic polynomial of a graph or a hypergraph. As an application we provide a generalization of Whitney's broken cycle theorem for hypergraphs, as well as deriving an…
Let $K$ be an algebraically closed field and $\mathrm{M}(2,K)$ be the $2\times 2$ matrix algebra over $K$ and $\mathrm{GL}(2,K)$ be the invertible elements in $\mathrm{M}(2,K)$. We explore the image of polynomials with constants, namely…
In this paper we construct a bivariant Chern character defined on ``families of spectral triples''. Such families should be viewed as a version of unbounded Kasparov bimodules adapted to the category of bornological algebras. The Chern…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
Let $p\ge 5$ be a prime and let $P$ be a Sylow $p$-subgroup of a finite symmetric group. To every irreducible character of $P$ we associate a collection of labelled, complete $p$-ary trees. The main results of this article describe Sylow…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
An algebraic interpretation of the bivariate Krawtchouk polynomials is provided in the framework of the 3-dimensional isotropic harmonic oscillator model. These polynomials in two discrete variables are shown to arise as matrix elements of…
We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.
We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We obtain an explicit combinatorial formula for certain parabolic Kostka-Shoji polynomials associated with the cyclic quiver, generalizing results of Shoji and of Liu and Shoji.
We generalize the positivity conjecture on (Kauffman bracket) skein algebras to Roger--Yang skein algebras. To generalize it, we use explicit polynomials like Chebyshev polynomials of the first kind to give candidates of positive bases.…
We determine the factorization of X*f(X)-Y*g(Y) over K[X,Y] for all squarefree additive polynomials f,g in K[X] and all fields K of odd characteristic. This answers a question of Kaloyan Slavov, who needed these factorizations in connection…
We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. Andre on the number of up-down permutations. The…
This article is a natural construction of our previous works. In this article, we employ similar ideas due to MacLane to provide an estimate of IC(K(X)|K,v) when (K(X)|K,v) is a valuation algebraic extension. Our central result is an…