Related papers: Optimal Multivalued Shattering

We construct, using the supersymplectic framework of Berezin, Kostant and others, two types of supersymmetric extensions of the Schr\"odinger algebra (itself a conformal extension of the Galilei algebra). An `$I$-type' extension exists in…

Coudert et al. (SODA'18) proved that under the Strong Exponential-Time Hypothesis, for any $\epsilon >0$, there is no ${\cal O}(2^{o(k)}n^{2-\epsilon})$-time algorithm for computing the diameter within the $n$-vertex cubic graphs of…

With the aim of generating new constraints on the OZI suppressed couplings of chiral perturbation theory a set of six equations of the Roy and Steiner type for the $S$- and $P$-waves of the $\pi K$ scattering amplitudes is derived. The…

We give a generalization of Kung's theorem on critical exponents of linear codes over a finite field, in terms of sums of extended weight polynomials of linear codes. For all i=k+1,...,n, we give an upper bound on the smallest integer m…

Let $(A,\mathfrak{m})$ be a local complete intersection ring and let $I$ be an ideal in $A$. Let $M, N$ be finitely generated $A$-modules. Then for $l = 0,1$, the values $depth \ Ext^{2i+l}_A(M, N/I^nN)$ become independent of $i, n$ for…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last few years. Tamo and Barg \cite{TB14} first gave a…

In this note, we consider semiclassical scattering on a manifold which is Euclidean near infinity or asymptotically hyperbolic. We show that, if the cut-off resolvent satisfies polynomial estimates in a strip of size $O(h |\log…

We study the problem of robust multivariate polynomial regression: let $p\colon\mathbb{R}^n\to\mathbb{R}$ be an unknown $n$-variate polynomial of degree at most $d$ in each variable. We are given as input a set of random samples…

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…

We generalize the well-known numerical criterion for projective spaces by Cho, Miyaoka and Shepherd-Barron to varieties with at worst quotient singularities. Let $X$ be a normal projective variety of dimension $n \geq 3$ with at most…

For any prime power $q$, Mori and Tanaka introduced a family of $q$-ary polar codes based on $q$~by~$q$ Reed-Solomon polarization kernels. For transmission over a $q$-ary erasure channel, they also derived a closed-form recursion for the…

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…

One-dimensional scattering problems are of wide physical interest and are encountered in many diverse applications. In this article I establish some very general bounds for reflection and transmission coefficients for one-dimensional…

Let $A$ be an $(m \times n)$ integral matrix, and let $P=\{ x : A x \leq b\}$ be an $n$-dimensional polytope. The width of $P$ is defined as $ w(P)=min\{ x\in \mathbb{Z}^n\setminus\{0\} :\: max_{x \in P} x^\top u - min_{x \in P} x^\top v…

Let $A$ be a right noetherian algebra over a field $k$. If the base field extension $A \otimes_k K$ remains right noetherian for all extension fields $K$ of $k$, then $A$ is called stably right noetherian over $k$. We develop an inductive…

Given any positive integer $n,$ let $A(n)$ denote the height of the $n^{\text{th}}$ cyclotomic polynomial, that is its maximum coefficient in absolute value. It is well known that $A(n)$ is unbounded. We conjecture that every natural number…

The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is…

Let $F\in\mathbb{C}[x,y,z]$ be a constant-degree polynomial,and let $A,B,C\subset\mathbb C$ be finite sets of size $n$. We show that $F$ vanishes on at most $O(n^{11/6})$ points of the Cartesian product $A\times B\times C$, unless $F$ has a…