In this paper we discuss gauging one-form symmetries in two-dimensional theories. The existence of a global one-form symmetry in two dimensions typically signals a violation of cluster decomposition — an issue resolved by the observation that such theories decompose into disjoint unions, a result that has been applied to, for example, Gromov–Witten theory and gauged linear sigma model phases. In this paper we describe how gauging one-form symmetries in two-dimensional theories can be used to select particular elements of that disjoint union, effectively undoing decomposition. We examine such gaugings explicitly in examples involving orbifolds, nonsupersymmetric pure Yang–Mills theories, and supersymmetric gauge theories in two dimensions. Along the way, we learn explicit concrete details of the topological configurations that path integrals sum over when gauging a one-form symmetry, and we also uncover “hidden” one-form symmetries.
more »
« less
Empirical Fourier decomposition: An accurate signal decomposition method for nonlinear and non-stationary time series analysis
- Award ID(s):
- 1762917
- PAR ID:
- 10296682
- Date Published:
- Journal Name:
- Mechanical Systems and Signal Processing
- Volume:
- 163
- Issue:
- C
- ISSN:
- 0888-3270
- Page Range / eLocation ID:
- 108155
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract We briefly compare the structure of two classes of popular models used to describe poro-mechanics and chemo-mechanics, wherein a fluid phase is transported within a solid phase. The multiplicative deformation decomposition has been successfully used to model permanent inelastic shape change in plasticity, solid–solid phase transformation, and thermal expansion, which has motivated its application to poro-mechanics and chemo-mechanics. However, the energetic decomposition provides a more transparent structure and advantages, such as to couple to phase-field fracture, for models of poro-mechanics and chemo-mechanics.more » « less
-
Dryland ecosystems cover nearly 45% of the Earth’s land area and account for large proportions of global annual productivity and carbon pools. However, predicting rates of plant litter decomposition in these vast ecosystems has proven challenging due to their distinctly dry and often hot climate regimes, and potentially unique physical drivers of decomposition. In this study, we elucidated the role of photopriming, i.e. potential for enhancement of microbial decay due to exposure of standing leaf litter to solar radiation prior to litterfall. We exposed litter substrates to three different UV radiation treatments simulating three-months of UV radiation exposure in southern New Mexico: no light, UVA+UVB+visible, and UVA+Visible. There were three litter types: mesquite leaflets (Prosopis glandulosa, litter with nitrogen (N) concentration), filter paper (pure cellulose), and basswood (Tilia spp, high lignin concentration). We deployed the photoprimed litter in the field within a large scale precipitation manipulation experiment: ~50% precipitation reduction, ~150% precipitation addition, and ambient control.more » « less
-
The CP tensor decomposition is used in applications such as machine learning and signal processing to discover latent low-rank structure in multidimensional data. Computing a CP decomposition via an alternating least squares (ALS) method reduces the problem to several linear least squares problems. The standard way to solve these linear least squares subproblems is to use the normal equations, which inherit special tensor structure that can be exploited for computational efficiency. However, the normal equations are sensitive to numerical ill-conditioning, which can compromise the results of the decomposition. In this paper, we develop versions of the CP-ALS algorithm using the QR decomposition and the singular value decomposition, which are more numerically stable than the normal equations, to solve the linear least squares problems. Our algorithms utilize the tensor structure of the CP-ALS subproblems efficiently, have the same complexity as the standard CP-ALS algorithm when the input is dense and the rank is small, and are shown via examples to produce more stable results when ill-conditioning is present. Our MATLAB implementation achieves the same running time as the standard algorithm for small ranks, and we show that the new methods can obtain lower approximation error.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1016/j.ymssp.2021.108155
