Related papers: A Combinatorial Description of Certain Polynomials…

Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of…

We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…

This paper presents three main results on coloring discrete $d$-pseudomanifolds: $(1)$ the general chromatic bounds $d+1 \leq X(K) \leq 2d+2$ for any $d$-pseudomanifold $K$; $(2)$ an improved bound $X(K) \leq 2d+1$ for pseudomanifolds…

We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Q_s colors, while all remaining vertices can take Q colors. The corresponding chromatic polynomial is related to the partition…

We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…

Within the Quartet Condensation Model (QCM), the isovector pairing correlations for $N = Z$ nuclei are described with a very high accuracy by a condensate of $\alpha$-like quartets. The usual approach involves cumbersome recurrence…

The color-flavor transformation for the unitary group (Zirnbauer 1996) is extended to the special unitary group. The resulting partition function is represented as sum over disconnected sectors characterized by a U(1)-charge. Application to…

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…

Colouring problems arising from group-based constructions provide a natural link between combinatorics and algebra, particularly in the study of Cayley graphs and Latin squares. We introduce the notion of colouring bijections of finite…

In "Homfly polynomial via an invariant of colored plane graphs", Murakami, Ohtsuki, and Yamada provide a state-sum description of the level $n$ Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose…

Greene and Zaslavsky proved that the number of acyclic orientations of a graph with a unique sink is, up to sign, the linear coefficient of the chromatic polynomial. We give three new proofs of this result using pure induction,…

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Quantum chromodynamics (QCD) with a general number of colors, $\Nc$, provides a powerful theoretical laboratory to explore the dynamics of non-Abelian gauge theories. Although $\Nc =3$ does not look a large number, the $1/\Nc$ expansion…

In a recent paper by the same authors, we constructed a stationary 1-dependent 4-coloring of the integers that is invariant under permutations of the colors. This was the first stationary k-dependent q-coloring for any k and q. When the…

We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…

In this paper, we consider polynomials associated with faces and internal quadrilaterals of a cuboctahedron and classify them under the requirement that they are consistent. These polynomials give rise to a system of partial difference…

We investigate the ratio asymptotic behavior of the sequence $(Q_{n})_{n=0}^{\infty}$ of multiple orthogonal polynomials associated with a Nikishin system of $p\geq 1$ measures that are compactly supported on the star-like set of $p+1$ rays…

In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…

The triangle of sorted binomial coefficients $\left\langle {n \atop k} \right\rangle = \binom{n}{\lfloor \frac{n - k}{2} \rfloor}$ for $0 \leq k \leq n$ has appeared several times in recent combinatorial works but has evaded dedicated…

We introduce the notion of "color rules" for computing class functions of $Z_k \wr S_n$, where $Z_k$ is the cyclic group of order $k$ and $S_n$ is the symmetric group on $n$ letters. Using a general sign-reversing involution and a map of…