Related papers: Cutting Corners

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

Generalized symmetries (also known as categorical symmetries) is a newly developing technique for studying quantum field theories. It has given us new insights into the structure of QFT and many new powerful tools that can be applied to the…

In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…

We study conformal field theories (CFTs) and their classifications from a modern perspective based on the abstract algebraic formalism of symmetries or conserved charges, known as symmetry topological field theories (SymTFTs). By studying…

In this paper, we provide novel algorithms with identifiability guarantees for simplex-structured matrix factorization (SSMF), a generalization of nonnegative matrix factorization. Current state-of-the-art algorithms that provide…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

We make a systematic study of the infinitesimal lifting conditions of a pseudo finite type map of noetherian formal schemes. We recover the usual general properties in this context, and, more importantly, we uncover some new phenomena. We…

We initiate the classification of unitary superconformal defects in unitary superconformal field theories (SCFT) of diverse spacetime dimensions $3\leq d \leq 6$. Our method explores general constraints from the defect superconformal…

There are many situations in geometry and group theory where it is natural, convenient or necessary to explore infinite groups via their actions on finite objects, i.e. via the finite quotients of the group. But how much understanding can…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We show that every effectively closed action of a finitely generated group $G$ on a closed subset of $\{0,1\}^{\mathbb{N}}$ can be obtained as a topological factor of the $G$-subaction of a $(G \times H_1 \times H_2)$-subshift of finite…

We initiate a systematic study of four dimensional $\mathcal{N}=2$ superconformal field theories (SCFTs) based on the analysis of their Coulomb branch geometries. Because these SCFTs are not uniquely characterized by their scale-invariant…

Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…

Using suitable convex functions, we construct a new family of flat Minkowski planes whose automorphism groups are at least $3$-dimensional. These planes admit groups of automorphisms isomorphic to the direct product of $\mathbb{R}$ and the…

This paper introduces an abstract framework for randomized subspace correction methods for convex optimization, which unifies and generalizes a broad class of existing algorithms, including domain decomposition, multigrid, and block…

We survey the existing parts of a classification of finite groups generated by orthogonal transformations in a finite-dimensional Euclidean space whose fixed point subspace has codimension one or two and extend it to a complete…

We focus on nonconvex and nonsmooth minimization problems with a composite objective, where the differentiable part of the objective is freed from the usual and restrictive global Lipschitz gradient continuity assumption. This longstanding…