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: Non-linearly realized discrete symmetries
A bstract While non-linear realizations of continuous symmetries feature derivative interactions and have no potential, non-linear realizations of discrete symmetries feature non-derivative interactions and have a highly suppressed potential. These Goldstone bosons of discrete symmetries have a non-zero potential, but the potential generated from quantum corrections is inherently very highly suppressed. We explore various discrete symmetries and to what extent the potential is suppressed for each of them.  more » « less
Award ID(s):
1914480
PAR ID:
10345725
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of High Energy Physics
Volume:
2020
Issue:
10
ISSN:
1029-8479
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Discrete symmetries are spatially ubiquitous but are often hidden in internal states of systems where they can have especially profound consequences. In this work we create and verify exotic magnetic phases of atomic spinor Bose–Einstein condensates that, despite their continuous character and intrinsic spatial isotropy, exhibit complex discrete polytope symmetries in their topological defects. Using carefully tailored spinor rotations and microwave transitions, we engineer singular line defects whose quantization conditions, exchange statistics, and dynamics are fundamentally determined by these underlying symmetries. We show how filling the vortex line singularities with atoms in a variety of different phases leads to core structures that possess magnetic interfaces with rich combinations of discrete and continuous symmetries. Such defects, with their non-commutative properties, could provide unconventional realizations of quantum information and interferometry. 
    more » « less
  2. A bstract Non-simply connected Calabi-Yau threefolds play a central role in the study of string compactifications. Such manifolds are usually described by quotienting a simply connected Calabi-Yau variety by a freely acting discrete symmetry. For the Calabi-Yau threefolds described as complete intersections in products of projective spaces, a classification of such symmetries descending from linear actions on the ambient spaces of the varieties has been given in [16]. However, which symmetries can be described in this manner depends upon the description that is being used to represent the manifold. In [24] new, favorable, descriptions were given of this data set of Calabi-Yau threefolds. In this paper, we perform a classification of cyclic symmetries that descend from linear actions on the ambient spaces of these new favorable descriptions. We present a list of 129 symmetries/non-simply connected Calabi-Yau threefolds. Of these, at least 33, and potentially many more, are topologically new varieties. 
    more » « less
  3. Models with modular flavor symmetries have been thought to be highly predictive. We point out that these predictions are subject to corrections from non–holomorphic terms in the Lagrangean. Specifically, in the models discussed in the literature, the Kähler potential is not fixed by the symmetries, for instance. The most general Kähler potential consistent with the symmetries of the model contains additional terms with additional parameters, which reduce the predictive power of these constructions. We also comment on potential ways of how one may conceivably retain the predictivity. 
    more » « less
  4. Lifted inference algorithms exploit model symmetry to reduce computational cost in probabilistic inference. However, most existing lifted inference algorithms operate only over discrete domains or continuous domains with restricted potential functions. We investigate two approximate lifted variational approaches that apply to domains with general hybrid potentials, and are expressive enough to capture multi-modality. We demonstrate that the proposed variational methods are highly scalable and can exploit approximate model symmetries even in the presence of a large amount of continuous evidence, outperforming existing message-passing-based approaches in a variety of settings. Additionally, we present a sufficient condition for the Bethe variational approximation to yield a non-trivial estimate over the marginal polytope. 
    more » « less
  5. This paper revisits building machine learning algorithms that involve interactions between entities, such as those between financial assets in an actively managed portfolio, or interactions between users in a social network. Our goal is to forecast the future evolution of ensembles of multivariate time series in such applications (e.g., the future return of a financial asset or the future popularity of a Twitter account). Designing ML algorithms for such systems requires addressing the challenges of high-dimensional interactions and non-linearity. Existing approaches usually adopt an ad-hoc approach to integrating high-dimensional techniques into non-linear models and re- cent studies have shown these approaches have questionable efficacy in time-evolving interacting systems. To this end, we propose a novel framework, which we dub as the additive influence model. Under our modeling assump- tion, we show that it is possible to decouple the learning of high-dimensional interactions from the learning of non-linear feature interactions. To learn the high-dimensional interac- tions, we leverage kernel-based techniques, with provable guarantees, to embed the entities in a low-dimensional latent space. To learn the non-linear feature-response interactions, we generalize prominent machine learning techniques, includ- ing designing a new statistically sound non-parametric method and an ensemble learning algorithm optimized for vector re- gressions. Extensive experiments on two common applica- tions demonstrate that our new algorithms deliver significantly stronger forecasting power compared to standard and recently proposed methods. 
    more » « less