Related papers: Labeled compression schemes for extremal classes
A higher extremal K\"ahler metric is defined (motivated by analogy with the definition of an extremal K\"ahler metric) as one whose top Chern form equals a smooth function multiplied by its volume form such that the gradient of the function…
Straight-line programs are a central tool in several areas of computer science, including data compression, algebraic complexity theory, and the algorithmic solution of algebraic equations. In the algebraic setting, where straight-line…
We discuss the problem of determining the complete weight hierarchy of linear error correcting codes associated to Grassmann varieties and, more generally, to Schubert varieties in Grassmannians. The problem is partially solved in the case…
A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…
Classical finite association schemes lead to a finite-dimensional algebras which are generated by finitely many stochastic matrices. Moreover, there exist associated finite hypergroups. The notion of classical discrete association schemes…
The V-systems are special finite sets of covectors which appeared in the theory of the generalized Witten-Dijkgraaf-Verlinde-Verlinde (WDVV) equations. Several families of V-systems are known but their classification is an open problem. We…
The main scalar-mean extremality and rigidity results in the existing literature concern manifolds whose curvature operators are nonnegative, or warped product spaces with a log-concave warping function whose leaves carry metrics of…
The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in all sufficiently high dimensions is due to Kabatiansky and Levenshtein in 1978. We revisit their…
We investigate the longstanding problem of determining the maximum size of a $(d+1)$-uniform set system with VC-dimension at most $d$. Since the seminal 1984 work of Frankl and Pach, which established the elegant upper bound $\binom{n}{d}$,…
In this paper we characterize those accessible $\mathcal V$-categories that have limits of a specified class. We do this by introducing the notion of companion $\mathfrak C$ for a class of weights $\Psi$, as a collection of special types of…
Simplicial arrangements are a special class of hyperplane arrangements, having the property that every chamber is a simplicial cone. It is known that the simpliciality property is preserved under taking restrictions. In this article we…
Extreme multilabel classification (XMLC) problems occur in settings such as related product recommendation, large-scale document tagging, or ad prediction, and are characterized by a label space that can span millions of possible labels.…
Let $f : X \to S$ be a family of smooth projective algebraic varieties over a smooth connected quasi-projective base $S$, and let $\mathbb{V} = R^{2k} f_{*} \mathbb{Z}(k)$ be the integral variation of Hodge structure coming from degree $2k$…
For any positive integers $n\ge d+1\ge 3$, what is the maximum size of a $(d+1)$-uniform set system in $[n]$ with VC-dimension at most $d$? In 1984, Frankl and Pach initiated the study of this fundamental problem and provided an upper bound…
X-codes form a special class of linear maps which were originally introduced for data compression in VLSI testing and are also known to give special parity-check matrices for linear codes suitable for error-erasure channels. In the context…
Normalized Compression Distance (NCD) is a popular tool that uses compression algorithms to cluster and classify data in a wide range of applications. Existing discussions of NCD's theoretical merit rely on certain theoretical properties of…
Fix a codimension $r$ and a socle-vector $s$. Is there an (entry by entry) maximal $h$-vector $h$ among the $h$-vectors of all the (standard graded artinian) algebras having data $(r,s)$? Extending a definition of Iarrobino, if such an $h$…
We derive a geometric formulation of the 2d central charge $c_r$ from infinite families of 4d $\mathcal{N}=1$ superconformal field theories topologically twisted on constant curvature Riemann surfaces. They correspond to toric quiver gauge…
In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\ldots,a_n} over \Sigma^m, where \Sigma is a finite alphabet, and integers k and B. The task is to partition A into k clusters such that the median…
This paper develops new extremal principles of variational analysis that are motivated by applications to constrained problems of stochastic programming and semi-infinite programming without smoothness and/or convexity assumptions. These…