Related papers: New asymptotic bounds for self-dual codes and latt…
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are over fields with size that grows with the number of servers,…
We explore the connection between simple polytopes and self-dual binary codes via the theory of small covers. We first show that a small cover $M^n$ over a simple $n$-polytope $P^n$ produces a self-dual code in the sense of Kreck-Puppe if…
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
We establish two surprising types of Weyl's laws for some compact $\mathrm{RCD}(K, N)$/Ricci limit spaces. The first type could have power growth of any order (bigger than one). The other one has an order corrected by logarithm similar to…
Locally repairable codes have been investigated extensively in recent years due to practical applications in distributed and cloud storage systems. However, there are few asymptotical constructions of locally repairable codes in the…
We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric…
In our work we study non-variational, nonlinear singularly perturbed elliptic models enjoying a double degeneracy character with prescribed boundary value in a domain. In such a scenario, we establish the existence of solutions. We also…
Let $u$ be an eigenfunction of the Laplacian on a compact manifold with boundary, with Dirichlet or Neumann boundary conditions, and let $-\lambda^2$ be the corresponding eigenvalue. We consider the problem of estimating the maximum of $u$…
Self-dual codes over F5 exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that…
Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…
Covering arrays find important application in software and hardware interaction testing. For practical applications it is useful to determine or bound the minimum number of rows, CAN$(t,k,v)$, in a covering array for given values of the…
Deriving sharp and computable upper bounds of the Lipschitz constant of deep neural networks is crucial to formally guarantee the robustness of neural-network based models. We analyse three existing upper bounds written for the $l^2$ norm.…
Since Massey introduced linear complementary dual (LCD) codes in 1992 and Bhasin et al. later formalized linear complementary pairs (LCPs) of codes - structures with important cryptographic applications - these code families have attracted…
For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…
We prove polynomial upper bounds on the growth of solutions to 2d cubic NLS where the Laplacian is confined by the harmonic potential. Due to better bilinear effects our bounds improve on those available for the $2d$ cubic NLS in the…
The deletion distance between two binary words $u,v \in \{0,1\}^n$ is the smallest $k$ such that $u$ and $v$ share a common subsequence of length $n-k$. A set $C$ of binary words of length $n$ is called a $k$-deletion code if every pair of…
The paper is concerned with the Steklov eigenvalue problem on cuboids of arbitrary dimension. We prove a two-term asymptotic formula for the counting function of Steklov eigenvalues on cuboids in dimension d greater or equal to 3. Apart…
A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…
The most general supersymmetric model contains baryon number violating terms of the form $\lm_{ijk}\ \ov{D}_i\ \ov{D}_j\ \ov{U}_k$ in the superpotential. We reconsider the bounds on these couplings, assuming that lepton number conservation…
For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…