相关论文: A Noncommutative Chromatic Symmetric Function
Cylindric skew Schur functions, a generalization of skew Schur functions, are closely related to the famous problem finding a combinatorial formula for the 3-point Gromov-Witten invariants of Grassmannian. In this paper, we prove cylindric…
A version of the classical Vieta theorem for free noncommuting variables is given. It leads to a new start in a construction of noncommutative symmetric functions
The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics, and LLT polynomials. In the case of, so-called, abelian Dyck paths…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
Let $G$ be a simple graph and let $\mathcal{L}(G)$ be the free partially commutative Lie algebra associated to $G$. In this paper, using heaps of pieces, we prove an expression for the generalized $\textbf k$-chromatic polynomial of $G$ in…
For a compact monotone symplectic manifold $X$ with Hamiltonian action of a compact Lie group $G$ and smooth symplectic reduction, we relate its gauged $2$-dimensional $A$-model to the $A$-model of $X/\!/G$. This (long conjectured) result…
We investigate the conditions under which the space of bounded harmonic functions of a probability measure $\mu$ on a group $G$ is contained in that of another measure $\theta$. We establish that asymptotic commutativity, defined by the…
The machinery of noncommutative Schur functions provides a general tool for obtaining Schur expansions for combinatorially defined symmetric functions. We extend this approach to a wider class of symmetric functions, explore its strengths…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
The chromatic polynomial of a graph $G$, denoted $P(G,m)$, is equal to the number of proper $m$-colorings of $G$. The list color function of graph $G$, denoted $P_{\ell}(G,m)$, is a list analogue of the chromatic polynomial that has been…
The noncommutative symmetric functions $\textbf{NSym}$ were first defined abstractly by Gelfand et al. in 1995 as the free associative algebra generated by noncommuting indeterminants $\{\boldsymbol{e}_n\}_{n\in \mathbb{N}}$ that were taken…
Let $G$ be a topological commutative semigroup with unit. We prove that a continuous function $f\colon G\to \cc$ is a generalized exponential polynomial if and only if there is an $n\ge 2$ such that $f(x_1 +\ldots +x_n )$ is decomposable;…
A weight-dependent generalization of the binomial theorem for noncommuting variables is presented. This result extends the well-known binomial theorem for q-commuting variables by a generic weight function depending on two integers. For a…
We extend the theory of circular game chromatic numbers to signed graphs by defining the invariant $\chi_c^g(G,\sigma)$ for signed graphs $(G,\sigma)$. Our analysis establishes tight bounds dependent on the structural properties of the…
We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…
For integer q>1, we derive edge q-colouring models for (i) the Tutte polynomial of a graph G on the hyperbola H_q, (ii) the symmetric weight enumerator of the set of group-valued q-flows of G, and (iii) a more general vertex colouring model…
The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are also…
We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
For a $(3+1)$-free poset $P$, we define a hybrid of $P$-tableaux and cylindric tableaux called cylindric $P$-tableaux. We introduce $P$-analogs of cylindric Schur functions, defined by a determinantal formula, and prove that they are the…