Search arXivSearch

arXiv · math/0212154

Fermionic expressions for minimal model Virasoro characters

Abstract

Fermionic expressions for all minimal model Virasoro characters $χ^{p, p'}_{r, s}$ are stated and proved. Each such expression is a sum of terms of fundamental fermionic form type. In most cases, all these terms are written down using certain trees which are constructed for $s$ and $r$ from the Takahashi lengths and truncated Takahashi lengths associated with the continued fraction of $p'/p$. In the remaining cases, in addition to such terms, the fermionic expression for $χ^{p, p'}_{r, s}$ contains a different character $χ^{\hat p, \hat p'}_{\hat r,\hat s}$, and is thus recursive in nature. Bosonic-fermionic $q$-series identities for all characters $χ^{p, p'}_{r, s}$ result from equating these fermionic expressions with known bosonic expressions. In the cases for which $p=2r$, $p=3r$, $p'=2s$ or $p'=3s$, Rogers-Ramanujan type identities result from equating these fermionic expressions with known product expressions for $χ^{p, p'}_{r, s}$. The fermionic expressions are proved by first obtaining fermionic expressions for the generating functions $χ^{p, p'}_{a, b, c}(L)$ of length $L$ Forrester-Baxter paths, using various combinatorial transforms. In the $L\to\infty$ limit, the fermionic expressions for $χ^{p, p'}_{r, s}$ emerge after mapping between the trees that are constructed for $b$ and $r$ from the Takahashi and truncated Takahashi lengths respectively.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trevor A. Welsh. 2004-02-04. Fermionic expressions for minimal model Virasoro characters. https://arxiv.org/abs/math/0212154

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO