Related papers: New asymptotic bounds for self-dual codes and latt…
We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
In this paper, using new correction to the Crouzeix-Raviart finite element eigenvalue approximations, we obtain lower eigenvalue bounds for the Steklov eigenvalue problem with variable coefficients on d-dimensional domains (d = 2,3). In…
The Delsarte linear program is used to bound the size of codes given their block length $n$ and minimal distance $d$ by taking a linear relaxation from codes to quasicodes. We study for which values of $(n,d)$ this linear program has a…
We present a modified version of the Bravyi-Terhal bound that applies to quantum codes defined by local parity-check constraints on a $D$-dimensional lattice quotient. Specifically, we consider a quotient $\mathbb{Z}^D/\Lambda$ of…
The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…
For a second order formally symmetric elliptic differential expression we show that the knowledge of the Dirichlet-to-Neumann map or Robin-to-Dirichlet map for suitably many energies on an arbitrarily small open subset of the boundary…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a…
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden.…
We give an $O(\log^2 n)$-query algorithm for finding a Tarski fixed point over the $4$-dimensional lattice $[n]^4$, matching the $\Omega(\log^2 n)$ lower bound of [EPRY20]. Additionally, our algorithm yields an ${O(\log^{\lceil…
We consider the discrete nonlinear Schr{\"o}dinger equations on a one dimensional lattice of mesh h, with a cubic focusing or defocusing nonlinearity. We prove a polynomial bound on the growth of the discrete Sobolev norms, uniformly with…
We investigate some regularity properties of a class of doubly nonlinear anisotropic evolution equations whose model case is \begin{align*} \partial_t \big(|u|^{\alpha -1}u \big) - \sum^N_{i=1} \partial_i \big( |\partial_i u|^{p_i - 2}…
In this paper we give an estimate on the asymptotic behavior of eigenvalues of discretized elliptic boundary values problems. We first prove a simple min-max principle for selfadjoint operators on a Hilbert space. Then we show two sided…
In this paper we provide another application of the Inhomogeneous Hopf-Ole\u{\i}nik Lemma (IHOL) proved in \cite{BM-IHOL-PartI} or \cite{Boyan-2}. As a matter of fact, we also provide a new and simpler proof of a slightly weaker version…
In 1990, Tiet\"av\"ainen showed that if the only information we know about a linear code is its dual distance $d$, then its covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$. While Tiet\"av\"ainen's bound was later…
In a {\em locally recoverable} or {\em repairable} code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed…
In recent years, several classes of codes are introduced to provide some fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) play an important role. However,…
A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. In this paper we derive new finite-length and…
We establish for dual quantization the counterpart of Kieffer's uniqueness result for compactly supported one dimensional probability distributions having a $\log$-concave density (also called strongly unimodal): for such distributions,…