Related papers: Optimal Multivalued Shattering

The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…

Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short), with a "matched metric" $\delta_{r}$ called asymmetric…

The M-estimators of multivariate scatter are known to have breakdown points no greater than 1/(p+1), where p is the dimension of the data. In high dimension, the breakdown points are usually considered to be disappointingly low. This paper…

The $p$-ary linear code $\mathcal C_{k}(n,q)$ is defined as the row space of the incidence matrix $A$ of $k$-spaces and points of $\text{PG}(n,q)$. It is known that if $q$ is square, a codeword of weight $q^k\sqrt{q}+\mathcal O \left(…

We study sum-of-squares (SOS) certificates for nonnegative polynomials $p$ on $\mathbb{R}^d$ and their implications for polynomial optimization over unbounded domains. Building on Lasserre's perturbation approach, we consider SOS…

Let $S$ be an orthogonal array $OA(d,k)$ and let $c$ be an $r$--coloring of its ground set $X$. We give a combinatorial identity which relates the number of vectors in $S$ with given color patterns under $c$ with the cardinalities of the…

We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…

Given a finite module $M$ over a Noetherian local ring $(R, \m)$, we introduce the concept of $j$-stretched ideals on $M$. Thanks to a crucial specialization lemma, we show that this notion greatly generalizes (to arbitrary ideals, and with…

We consider perfect 1-error correcting codes over a finite field with $q$ elements (briefly $q$-ary 1-perfect codes). In this paper, a generalized concatenation construction for $q$-ary 1-perfect codes is presented that allows us to…

Let A be a C*-algebra with real rank zero which has the stable weak cancellation property. Let I be an ideal of A such that I is stable and satisfies the corona factorization property. We prove that 0->I->A->A/I->0 is a full extension if…

This article is concerned with an extension of univariate Chebyshev polynomials of the first kind to the multivariate setting, where one chases best approximants to specific monomials by polynomials of lower degree relative to the uniform…

Let $P:\{0,1\}^k \to \{0,1\}$ be a nontrivial $k$-ary predicate. Consider a random instance of the constraint satisfaction problem $\mathrm{CSP}(P)$ on $n$ variables with $\Delta n$ constraints, each being $P$ applied to $k$ randomly chosen…

Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…

Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…

Suppose $c_1,\ldots,c_{n+k}$ are real numbers, $\{a_1,\ldots,a_{n+k}\}\!\subset\!\mathbb{R}^n$ is a set of points not all lying in the same affine hyperplane, $y\!\in\!\mathbb{R}^n$, $a_j\cdot y$ denotes the standard real inner product of…

We focus on computing certified upper bounds for the positive maximal singular value (PMSV) of a given matrix. The PMSV problem boils down to maximizing a quadratic polynomial on the intersection of the unit sphere and the nonnegative…

Let $K$ be a local field whose residue field has characteristic $p$ and let $L/K$ be a finite separable totally ramified extension of degree $n=up^{\nu}$. Let $\sigma_1,\dots,\sigma_n$ denote the $K$-embeddings of $L$ into a separable…

We show that any $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a depth-$4$ syntactically multilinear ($\Sigma\Pi\Sigma\Pi$) circuit of size at most…