Related papers: Labeled compression schemes for extremal classes
This paper studies abelian categories that can be decomposed into smaller abelian categories via iterated recollements - such a decomposition we call a stratification. Examples include the categories of (equivariant) perverse sheaves and…
We systematically analyze the large-$N$ limit of the superconformal index of $\mathcal{N}=1$ superconformal theories having a quiver description. The index of these theories is known in terms of unitary matrix integrals, which we calculate…
We classify and characterize all invertible anomalies and all allowed topological terms related to various Standard Models (SM), Grand Unified Theories (GUT), and Beyond Standard Model (BSM) physics. By all anomalies, we mean the inclusion…
Universal source coding at short blocklengths is considered for an exponential family of distributions. The \emph{Type Size} code has previously been shown to be optimal up to the third-order rate for universal compression of all memoryless…
We thereby prove that a large class of topologically massive theories of the Cremmer-Scherk-Kalb-Ramond-type in any $d$ dimensions corresponds to gauge non-invariant first-order theories that can be interpreted as self-dual models.
We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…
One of the prominent areas of research in graph theory is the degree-diameter problem, in which we seek to determine how many vertices a graph may have when constrained to a given degree and diameter. Different variants of this problem are…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…
Given a shifted order ideal $U$, we associate to it a family of simplicial complexes $(\Delta_t(U))_{t\geq 0}$ that we call squeezed complexes. In a special case, our construction gives squeezed balls that were defined and used by Kalai to…
We introduce a fast low-rank factorization-based framework for compressing large language models that enables rapid compression of billion-parameter models without retraining. Unlike existing factorization-based approaches that optimize…
The $k$-means clustering algorithm and its variant, the spherical $k$-means clustering, are among the most important and popular methods in unsupervised learning and pattern detection. In this paper, we explore how the spherical $k$-means…
We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded,…
Convergence of Extremum Seeking (ES) algorithms has been established in the limit of small gains. Using averaging theory and contraction analysis, we propose a framework for computing explicit bounds on the departure of the ES scheme from…
We consider a general class of parametrized displacement boundary value problems in incompressible nonlinear elasticity. We prove the existence of an unbounded solution branch of classical injective solutions emanating from the unforced…
We develop a formalism to extend, simultaneously, the usual definition of bulk and edge indices from topological insulators to the case of a finite sample with open boundary conditions, and provide a physical interpretation of these…
In the Constrained-degree percolation model on a graph $(\mathbb{V},\mathbb{E})$ there are a sequence, $(U_e)_{e\in\mathbb{E}}$, of i.i.d. random variables with distribution $U[0,1]$ and a positive integer $k$. Each bond $e$ tries to open…
Many well-studied problems in extremal combinatorics deal with the maximum possible size of a family of objects in which every pair of objects satisfies a given restriction. One problem of this type was recently raised by Alon, Gujgiczer,…
Multiclass classification problems such as image annotation can involve a large number of classes. In this context, confusion between classes can occur, and single label classification may be misleading. We provide in the present paper a…
We analyse a class of quantum field theory models illustrating some of the possibilities that have emerged in the general study of the short distance properties of superselection sectors, performed in a previous paper (together with R.…
We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…