skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Phase transitions in the decomposition of SU(N) representations
We study the multiplicity of irreducible representations in the decomposition of 𝑛 fundamentals of π‘†π‘ˆ(𝑁) weighted by a power of their dimension in the large 𝑛 and large 𝑁 double scaling limit. A nontrivial scaling is obtained by keeping π‘›βˆ•π‘2 fixed, which plays the role of an order parameter. We find that the system generically undergoes a fourth order phase transition in this parameter, from a dense phase to a dilute phase. The transition is enhanced to third order for the unweighted multiplicity, and disappears altogether when weighting with the first power of the dimension. This corresponds to the infinite temperature partition function of non-Abelian ferromagnets, and the results should be relevant to the thermodynamic limit of such ferromagnets at high temperatures.  more » « less
Award ID(s):
2112729
PAR ID:
10532711
Author(s) / Creator(s):
;
Publisher / Repository:
Nuclear Physics B
Date Published:
Journal Name:
Nuclear Physics B
Volume:
999
Issue:
C
ISSN:
0550-3213
Page Range / eLocation ID:
116434
Subject(s) / Keyword(s):
Nonabelian, large-N, phase transitions, SU(N), representations
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We compute the multiplicity of the irreducible representations in the decomposition of the tensor product of an arbitrary number n of fundamental representations of SU(N), and we identify a duality in the representation content of this decomposition. Our method utilizes the mapping of the representations of SU(N) to the states of free fermions on the circle, and can be viewed as a random walk on a multidimensional lattice. We also derive the large-n limit and the response of the system to an external non-abelian magnetic field. These results can be used to study the phase properties of non-abelian ferromagnets and to take various scaling limits. 
    more » « less
  2. null (Ed.)
    In matter, any spontaneous symmetry breaking induces a phase transition characterized by an order parameter, such as the magnetization vector in ferromagnets, or a macroscopic many-electron wave function in superconductors. Phase transitions with unknown order parameter are rare but extremely appealing, as they may lead to novel physics. An emblematic and still unsolved example is the transition of the heavy fermion compound U R u 2 S i 2 (URS) into the so-called hidden-order (HO) phase when the temperature drops below T 0 = 17.5 K. Here, we show that the interaction between the heavy fermion and the conduction band states near the Fermi level has a key role in the emergence of the HO phase. Using angle-resolved photoemission spectroscopy, we find that while the Fermi surfaces of the HO and of a neighboring antiferromagnetic (AFM) phase of well-defined order parameter have the same topography, they differ in the size of some, but not all, of their electron pockets. Such a nonrigid change of the electronic structure indicates that a change in the interaction strength between states near the Fermi level is a crucial ingredient for the HO to AFM phase transition. 
    more » « less
  3. We explicitly construct an extractor for two independent sources on 𝑛 bits, each with min-entropy at least log𝐢𝑛 for a large enough constant 𝐢. Our extractor outputs one bit and has error π‘›βˆ’Ξ©(1). The best previous extractor, by Bourgain, required each source to have min-entropy .499𝑛. A key ingredient in our construction is an explicit construction of a monotone, almost-balanced Boolean function on 𝑛 bits that is resilient to coalitions of size 𝑛1βˆ’π›Ώ for any 𝛿>0. In fact, our construction is stronger in that it gives an explicit extractor for a generalization of non-oblivious bit-fixing sources on 𝑛 bits, where some unknown π‘›βˆ’π‘ž bits are chosen almost polylog(𝑛)-wise independently, and the remaining π‘ž=𝑛1βˆ’π›Ώ bits are chosen by an adversary as an arbitrary function of the π‘›βˆ’π‘ž bits. The best previous construction, by Viola, achieved π‘ž=𝑛1/2–𝛿. Our explicit two-source extractor directly implies an explicit construction of a 2(loglog𝑁)𝑂(1)-Ramsey graph over 𝑁 vertices, improving bounds obtained by Barak et al. and matching an independent work by Cohen. 
    more » « less
  4. The nature of the interplay between fluctuations and quenched random disorder is a long-standing open problem, particularly in systems with a continuous order parameter. This lack of a full theoretical treatment has been underscored by recent advances in experiments on charge density wave materials. To address this problem, we formulate an exactly solvable model of a two-dimensional randomly pinned incommensurate charge density wave, and use the large-N technique to map out the phase diagram and order parameter correlations. Our approach captures the physics of the Berezinskii–Kosterlitz–Thouless phase transition in the clean limit at largeN. We pay particular attention to the roles of thermal fluctuations and quenched random field disorder in destroying long-range order, finding a novel crossover between weakly- and strongly-disordered regimes. 
    more » « less
  5. For positive integers 𝑛, π‘Ÿ, 𝑠 with π‘Ÿ > 𝑠, the set-coloring Ramsey number 𝑅(𝑛; π‘Ÿ, 𝑠) is the minimum 𝑁 such that if every edge of the complete graph 𝐾_𝑁 receives a set of 𝑠 colors from a palette of π‘Ÿ colors, then there is guaranteed to be a monochromatic clique on 𝑛 vertices, that is, a subset of 𝑛 vertices where all of the edges between them receive a common color. In particular, the case 𝑠 = 1 corresponds to the classical multicolor Ramsey number. We prove general upper and lower bounds on 𝑅(𝑛; π‘Ÿ, 𝑠) which imply that 𝑅(𝑛; π‘Ÿ, 𝑠) = 2^Θ(π‘›π‘Ÿ) if 𝑠/π‘Ÿ is bounded away from 0 and 1. The upper bound extends an old result of ErdΕ‘s and SzemerΓ©di, who treated the case 𝑠 = π‘Ÿ βˆ’ 1, while the lower bound exploits a connection to error-correcting codes. We also study the analogous problem for hypergraphs. 
    more » « less