Related papers: A Combinatorial Description of Certain Polynomials…
The Born-Oppenheimer approximation is one of the very successful tools for solving the hydrogen atom problem. The experimental discovery of hidden heavy flavor tetraquarks, $Q\bar{Q}q \bar{q}$ ($Q=c,b$ and $q=u,d,s$), provides great…
We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a…
We construct an integrable colored five-vertex model whose partition function is a Lascoux atom based on the five-vertex model of Motegi and Sakai [arXiv:1305.3030] and the colored five-vertex model of Brubaker, the first author, Bump, and…
Let $\{P_n \}_{n\ge0}$ be a sequence of monic orthogonal polynomials with respect to a quasi--definite linear functional $u$ and $\{Q_n \}_{n\ge0}$ a sequence of polynomials defined by $$Q_n(x)=P_n(x)+s_n P_{n-1}(x)+t_n P_{n-2}(x),\quad…
The recent observation of a hadronic resonance $d^*$ in the proton-neutron system with isospin $I = 0$ and spin-parity $J^P = 3^+$ raises the possibility of producing other novel six-quark dibaryon configurations allowed by QCD. A dramatic…
We study a $q$-version of the chromatic polynomial of a given graph $G=(V,E)$, namely, \[ \chi_G^\lambda(q,n) \ := \sum_{\substack{\text{proper colorings}\\ c\,:\,V\to[n]}} q^{ \sum_{ v \in V } \lambda_v c(v) }, \] where $\lambda \in…
We consider projections of points onto fundamental chambers of finite real reflection groups. Our main result shows that for groups of type $A_n$, $B_n$, and $D_n$, the coefficients of the characteristic polynomial of the reflection…
Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…
We describe coherent states and associated generalized Grassmann variables for a system of $m$ independent $q$-boson modes. A resolution of unity in terms of generalized Berezin integrals leads to generalized Grassmann symbolic calculus.…
The standard supercharacter theory of the finite unipotent upper-triangular matrices $U_n(q)$ gives rise to a beautiful combinatorics based on set partitions. As with the representation theory of the symmetric group, embeddings of…
Let $(P_n(x;z;\lambda))_{n\geq 0}$ be the sequence of monic orthogonal polynomials with respect to the symmetric linear functional $\mathbf{s}$ defined by $$\langle\mathbf{s},p\rangle=\int_{-1}^1 p(x)(1-x^2)^{(\lambda-1/2)}…
We show that for any set $S\subseteq \mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $\mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of…
Let P(z) and Q(y) be polynomials of the same degree k>=1 in the complex variables z and y, respectively. In this extended abstract we study the non-linear functional equation P(z)=Q(y(z)), where y(z) is restricted to be analytic in a…
There are a number of well-known problems and conjectures about partitioning graphs to satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum, Seymour, van der Zypen and Wood states that every directed…
In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go…
Consider the collection of hyperplanes in $\mathbb{R}^n$ whose defining equations are given by $\{x_i + x_j = 0\mid 1\leq i<j\leq n\}$. This arrangement is called the threshold arrangement since its regions are in bijection with labeled…
We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a $q$-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an…
We consider the quantum Knizhnik-Zamolodchikov-Bernard equation for a face model with elliptic weights, the SOS model. We provide explicit solutions as theta functions. On the so-called combinatorial line, in which the model is equivalent…
We derive closed formulas for the number of $k$-coloured partitions and the number of plane partitions of $n$ in terms of the Bell polynomials.
In this article we describe a canonical way to expand a certain kind of $(\mathbb Z_2)^{n+1}$-colored regular graphs into closed $n$-manifolds by adding cells determined by the edge-colorings inductively. We show that every closed…