Related papers: The higher sharp I: on $M_1^\#$

We introduce polyhedral cones associated with $m$-hemimetrics on $n$ points, and, in particular, with $m$-hemimetrics coming from partitions of an $n$-set into $m+1$ blocks. We compute generators and facets of the cones for small values of…

In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…

Unordered, variable-sized inputs arise in many settings across multiple fields. The ability for set- and multiset-oriented neural networks to handle this type of input has been the focus of much work in recent years. We propose to represent…

We give a recursive algorithm for computing the character of the cohomology of the moduli space $\Mmb_{0,n}$ of stable $n$-pointed genus zero curves as a representation of the symmetric group $\Sg_n$ on $n$ letters. Using the algorithm we…

We introduce the problem of computing a parsing where each phrase is of length at most $m$ and which minimizes the zeroth order entropy of parsing. Based on the recent theoretical results we devise a heuristic for this problem. The solution…

Sbrana and Cartan gave local classifications for the set of Euclidean hypersurfaces $M^n\subseteq\mathbb{R}^{n+1}$ which admit another genuine isometric immersions in $\mathbb{R}^{n+1}$ for $n\geq 3$. The main goal of this paper is to…

For any maximal surface group representation into $\mathrm{SO}_0(2,n+1)$, we introduce a non-degenerate scalar product on the the first cohomology group of the surface with values in the associated flat bundle. In particular, it gives rise…

This is the first in a series of papers in which we study representations of the Brauer category and its allies. We define a general notion of triangular category that abstracts key properties of the triangular decomposition of a semisimple…

We show that approximations of strict order can calibrate the fine structure of genericity. Particularly, we find exponential behavior within the $\mathrm{NSOP}_{n}$ hierarchy from model theory. Let $0$-$\eth$-independence denote…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

In $\mathcal L$, the semilattice of faces of an $n$-cube, we count the number of automorphisms of $\mathcal L$ that fix a given subalgebra -- either pointwise or as a subalgebra. By using M\"obius inversion we get a formula for the number…

A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…

A linear deformation of a Meyer set $M$ in $\RR^d$ is the image of $M$ under a group homomorphism of the group $[M]$ generated by $M$ into $\RR^d$. We provide a necessary and sufficient condition for such a deformation to be a Meyer set. In…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Unsupervised representation learning for speech processing has matured greatly in the last few years. Work in computer vision and natural language processing has paved the way, but speech data offers unique challenges. As a result, methods…

Machine learning is a thriving part of computer science. There are many efficient approaches to machine learning that do not provide strong theoretical guarantees, and a beautiful general learning theory. Unfortunately, machine learning…

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

Given a finite set $N$ of feasible points of a multi-objective optimization (MOO) problem, the search region corresponds to the part of the objective space containing all the points that are not dominated by any point of $N$, i.e. the part…

These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…

Let X be a definable sub-set of some o-minimal structure. We study the spectrum of X, in relation with the definability of types.