Search arXivSearch

arXiv · math/0512536

Fermionic Formulas For Unrestricted Kostka Polynomials And Superconformal Characters

Abstract

The problem of finding fermionic formulas for the many generalizations of Kostka polynomials and for the characters of conformal field theories has been a very exciting research topic for the last few decades. In this dissertation we present new fermionic formulas for the unrestricted Kostka polynomials extending the work of Kirillov and Reshetikhin. We also present new fermionic formulas for the characters of N=1 and N=2 superconformal algebras which extend the work of Berkovich, McCoy and Schilling. Fermionic formulas for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ in the case of symmetric and anti-symmetric crystal paths were given by Hatayama et al. We present new fermionic formulas for the unrestricted Kostka polynomials of type $A_{n-1}^{(1)}$ for all crystal paths based on Kirillov-Reshetihkin modules. We interpret the fermionic formulas in terms of a new set of unrestricted rigged configurations. Fermionic formulas for the N=1 and N=2 superconformal algebras are derived using the Bailey lemma by establishing new Bailey flows from the nonunitary minimal models to the superconformal models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lipika Deka. 2006-01-04. Fermionic Formulas For Unrestricted Kostka Polynomials And Superconformal Characters. https://arxiv.org/abs/math/0512536

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