Realization of Hilbert Space Fragmentation and Fracton Dynamics in Two Dimensions

Melissa Will1,2, Roderich Moessner3, Frank Pollmann1,2

  • 1<a href="https://ror.org/02kkvpp62">Technical University of Munich</a>, TUM School of Natural Sciences, Physics Department, 85748 Garching, Germany.

Physical Review Letters
|November 22, 2024
PubMed

Related Concept Videos

First Law: Particles in Two-dimensional Equilibrium01:18

First Law: Particles in Two-dimensional Equilibrium

Recall that a particle in equilibrium is one for which the external forces are balanced. Static equilibrium involves objects at rest, and dynamic equilibrium involves objects in motion without acceleration; but it is important to remember that these conditions are relative. For instance, an object may be at rest when viewed from one frame of reference, but that same object would appear to be in motion when viewed by someone moving at a constant velocity.
Newton's first law tells us about...
5.0K
Three-Dimensional Analysis of Strain01:29

Three-Dimensional Analysis of Strain

Three-dimensional strain analysis is crucial for understanding how materials deform under stress, particularly in elastic, homogeneous materials. This method employs principal stress axes to simplify complex stress states into more understandable forms. Subjected to stress, a small cubic element within a material either expands or contracts along these axes, transforming into a rectangular parallelepiped. This transformation effectively illustrates the material's deformation. The principal...
203
Properties of DTFT I01:24

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
367
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
270
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
219
Two-Dimensional Force System01:20

Two-Dimensional Force System

A two-dimensional system in mechanical engineering involves the analysis of motion and forces in a plane. A two-dimensional force vector can be resolved into its components as:
873