Search arXivSearch

arXiv · 0709.0104

Symmetry classes connected with the magnetic Heisenberg ring

Abstract

We define symmetry classes and commutation symmetries in the Hilbert space H of the 1D spin-1/2 Heisenberg magnetic ring with N sites and investigate them by means of tools from the representation theory of symmetric groups S_N such as decompositions of ideals of the group ring C[S_N], idempotents of C[S_N], discrete Fourier transforms of S_N, Littlewood-Richardson products. In particular, we determine smallest symmetry classes and stability subgroups of both single eigenvectors v and subspaces U of eigenvectors of the Hamiltonian of the magnet. The determination of the smallest symmetry class for U bases on an algorithm which calculates explicitely a generating idempotent for a non-direct sum of right ideals of C[S_N]. Let U be a subspace of eigenvectors of a a fixed eigenvalue μof the Hamiltonian with weight (r_1,r_2). If one determines the smallest symmetry class for every v in U then one can observe jumps of the symmetry behaviour. For ''generic'' v all smallest symmetry classes have the same maximal dimension d and structure. But U can contain linear subspaces on which the dimension of the smallest symmetry class of v jumps to a value smaller than d. Then the stability subgroup of v can increase. We can calculate such jumps explicitely. In our investigations we use computer calculations by means of the Mathematica packages PERMS and HRing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bernd Fiedler. 2007-09-02. Symmetry classes connected with the magnetic Heisenberg ring. https://doi.org/10.1088/1742-6596%2F104%2F1%2F012035

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