SearcharxivSearch

arXiv · 1512.05937

A combinatorial Hopf algebra for the boson normal ordering problem

Abstract

In the aim to understand the generalization of Stirling numbers occurring in the bosonic normal ordering problem, several combinatorial models have been proposed. In particular, Blasiak \emph{et al.} defined combinatorial objects allowing to interpret the number of $S_{\bf{r,s}}(k)$ appearing in the identity $(a^\dag)^{r_n}a^{s_n}\cdots(a^\dag)^{r_1}a^{s_1}=(a^\dag)^\alpha\displaystyle\sum S_{\bf{r,s}}(k)(a^\dag)^k a^k$, where $\alpha$ is assumed to be non-negative. These objects are used to define a combinatorial Hopf algebra which specializes to the enveloping algebra of the Heisenberg Lie algebra. Here, we propose a new variant of this construction which admits a realization with variables. This means that we construct our algebra from a free algebra $\mathbb{C}\langle A \rangle$ using quotient and shifted product. The combinatorial objects (B-diagrams) are slightly different from those proposed by Blasiak \emph{et al.}, but give also a combinatorial interpretation of the generalized Stirling numbers together with a combinatorial Hopf algebra related to Heisenberg Lie algebra. The main difference comes from the fact that the B-diagrams have the same number of inputs and outputs. After studying the combinatorics and the enumeration of B-diagrams, we propose two constructions of algebras called Fusion algebra $\mathcal{F}$, defined using formal variable and another algebra $\mathcal{B}$ constructed directly from the B-diagrams. We show the connection between these two algebras and that $\mathcal{B}$ can be endowed with a Hopf structure. We recognize two already known combinatorial Hopf subalgebras of $\mathcal{B}$ : $\mathrm{WSym}$ the algebra of word symmetric functions indexed by set partitions and $\mathrm{BWSym}$ the algebra of biword symmetric functions indexed by set partitions into lists.

Explore related subjects

Keep this discovery

BibTeXRIS

Imad Eddine Bousbaa, Ali Chouria, Jean-Gabriel Luque. 2015-12-18. A combinatorial Hopf algebra for the boson normal ordering problem. https://doi.org/10.4171/aihpd%2F48

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO