相关论文: A One-Step Cascade Symmetric Model: Rank-$1$ Packe…

Although classification for free-fermion topological superconductors (TSC) is established, systematically understanding the classification of 3D interacting TSCs remains difficult, especially those protected by crystalline symmetries like…

We construct, from a ground model of $ZFC$, a transitive symmetric model $M$ satisfying $ZF + DC + PP + AC_{wo} + \neg AC$. The construction starts with a Cohen symmetric seed model $N$ over $Add(\omega,\omega_1)$ and performs an Ord-length…

The exploration of solid-solid phase transition suffers from the uncertainty of how atoms in two crystal structures match. We devised a theoretical framework to describe and classify crystal-structure matches (CSM). Such description fully…

Alignment, the tendency of adjacent weight matrices in deep networks to develop compatible subspace orientations, underlies gradient flow, Neural Collapse, and representation similarity across architectures. Despite extensive empirical…

Sparse model selection is ubiquitous from linear regression to graphical models where regularization paths, as a family of estimators upon the regularization parameter varying, are computed when the regularization parameter is unknown or…

We study streaming algorithms for proportionally fair clustering, a notion originally suggested by Chierichetti et. al. (2017), in the sliding window model. We show that although there exist efficient streaming algorithms in the…

We introduce and discuss a definition of approximation of a topological algebraic system $A$ by finite algebraic systems of some class $\K$. For the case of a discrete algebraic system this definition is equivalent to the well-known…

Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…

A significant part of modern topological data analysis is concerned with the design and study of algebraic invariants of poset representations -- often referred to as multi-parameter persistence modules. One such invariant is the minimal…

We have discovered a new family of three-dimensional crystal sphere packings that are strictly jammed (i.e., mechanically stable) and yet possess an anomalously low density. This family constitutes an uncountably infinite number of crystal…

This thesis establishes a generalised setting with which to unify the study of finite local complexity (FLC) patterns. The abstract notion of a "pattern" is introduced, which may be seen as an analogue of the space group of isometries…

We investigate a novel class of topological superconducting phases protected by exact fermion-parity symmetry and average crystalline symmetries. These phases belong to the broader class of average crystalline symmetry-protected topological…

In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…

In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This is a natural relaxation of the perfect matching problem, in…

This article continues the investigation of the tracial geometry of classifiable $\mathrm{C}^*$-algebras that have real rank zero and stable rank one. Using the language of optimal transport, we describe several situations in which the…

The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…

In this work, we introduce a new type of topological order which is protected by subsystem symmetries which act on lower dimensional subsets of lattice many-body system, e.g. along lines or planes in a three dimensional system. The symmetry…

We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees form a copy of the dense linear order…

We propose a new embedding method which is particularly well-suited for settings where the sample size greatly exceeds the ambient dimension. Our technique consists of partitioning the space into simplices and then embedding the data points…

Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbourhoods, while the stronger colored-neighbourhood metric…