While two-dimensional symmetry-enriched topological phases (𝖲𝖤𝖳s) have been studied intensively and systematically, three-dimensional ones are still open issues. We propose an algorithmic approach of imposing global symmetry Gs on gauge theories (denoted by 𝖦𝖳) with gauge group Gg. The resulting symmetric gauge theories are dubbed "symmetry-enriched gauge theories" (𝖲𝖤𝖦), which may be served as low-energy effective theories of three-dimensional symmetric topological quantum spin liquids. We focus on 𝖲𝖤𝖦s with gauge group Gg=ℤN1×ℤN2×⋯ and on-site unitary symmetry group Gs=ℤK1×ℤK2×⋯ or Gs=U(1)×ℤK1×⋯. Each 𝖲𝖤𝖦(Gg,Gs) is described in the path integral formalism associated with certain symmetry assignment. From the path-integral expression, we propose how to physically diagnose the ground state properties (i.e., 𝖲𝖤𝖳 orders) of 𝖲𝖤𝖦s in experiments of charge-loop braidings (patterns of symmetry fractionalization) and the \emph{mixed} multi-loop braidings among deconfined loop excitations and confined symmetry fluxes. From these symmetry-enriched properties, one can obtain the map from 𝖲𝖤𝖦s to 𝖲𝖤𝖳s. By giving full dynamics to background gauge fields, 𝖲𝖤𝖦s may be eventually promoted to a set of new gauge theories (denoted by 𝖦𝖳∗). Based on their gauge groups, 𝖦𝖳∗s may be further regrouped into different classes each of which is labeled by a gauge group G∗g. Finally, a web of gauge theories involving 𝖦𝖳, 𝖲𝖤𝖦, 𝖲𝖤𝖳 and 𝖦𝖳∗ is achieved. We demonstrate the above symmetry-enrichment physics and the web of gauge theories through many concrete examples.

We study novel variations of Voronoi games (and associated random processes) that we call Voronoi choice games. These games provide a rich framework for studying questions regarding the power of small numbers of choices in multi-player, competitive scenarios in a geometric setting. Our work can be seen as a natural variation of the classical framework of Hotelling. While games based on Voronoi diagrams have appeared recently in the literature, our variations appear to be the first that take into account a notion of limited choices and the corresponding asymmetries in player strategies. As a problem example, suppose a group of n miners (or players) are staking land claims through the following process: each miner has m associated points in the unit square (or, for symmetry, the unit torus), so the kth miner will have associated points pk1, pk2, . . . , pkm. We generally here think of m as being a small constant, such as 2. Each miner chooses one of these points as the base point for their claim. Generally the points will be distinct for each miner. Each miner obtains mining rights for the area of the square that is closest to their chosen base; that is, they obtain the Voronoi cell corresponding to their chosen point in the Voronoi diagram of the n chosen points. Each player’s goal is simply to maximize the amount of land under their control. What can we say about the players’ strategy and the equilibria of such games? We provide several results on games in this setting. For example, we show that a correlated equilibrium can be found in polynomial time for the natural 1, 2, and 3-dimensional variations of the problem. For the one-dimensional version of the problem on the unit circle, we show that a pure Nash equilibrium exists when each player owns the part of the circle nearest to their point, but it is NP-hard to determine whether a pure Nash equilibrium exists when each player owns the arc starting from their point clockwise to the next point. We also consider a random version of the game, where players have m points chosen uniformly at random. We derive bounds on the expected number of pure Nash equilibria for a variation of the 1-dimensional game in this setting using interesting properties of random arc lengths on circles.

We consider the mixed q-Gaussian algebras introduced by Speicher which are generated by the variables Xi = li + l ∗ i , i = 1, . . . , N, where l ∗ i lj − qij lj l ∗ i = δi,j and −1 < qij = qji < 1. Using the free monotone transport theorem of Guionnet and Shlyakhtenko, we show that the mixed q-Gaussian von Neumann algebras are isomorphic to the free group von Neumann algebra L(FN ), provided that maxi,j |qij | is small enough. Similar results hold in the reduced C ∗ -algebra setting. The proof relies on some estimates which are generalizations of Dabrowski’s results for the special case qij ≡ q.

No abstract uploaded!

We consider a discrete, non-Hermitian random matrix model, which can be expressed as a shift of a rank-one perturbation of an anti-symmetric matrix. We show that, asymptotically almost surely, the real parts of the eigenvalues of the non-Hermitian matrix around any fixed index are interlaced with those of the anti-symmetric matrix. Along the way, we show that some tools recently developed to study the eigenvalue distributions of Hermitian matrices extend to the anti-symmetric setting.