Related papers: Optimality and uniqueness of the $D_4$ root system
We show that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $20$, and that if equality is attained, then the…
A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…
We present a systematic method to classify the four-level system using $SU(4)$ symmetry as the basis group. It is shown that this symmetry allows three dipole transitions which eventually leads to six possible configurations of the…
The DPG method with optimal test functions for solving linear quadratic optimal control problems with control constraints is studied. We prove existence of a unique optimal solution of the nonlinear discrete problem and characterize it…
With the aim of resolving theoretical issues associated with the fourth root prescription for dynamical staggered fermions in Lattice QCD simulations, we consider the problem of finding a viable lattice Dirac operator D such that (det…
Optimal dense coding using a partially-entangled pure state of Schmidt rank $\bar D$ and a noiseless quantum channel of dimension $D$ is studied both in the deterministic case where at most $L_d$ messages can be transmitted with perfect…
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 prove independence of normality to different bases We show that the set of real numbers that are normal to some base is Sigma^0_4 complete in the Borel hierarchy of subsets of real numbers. This was an open problem, initiated by…
To numerically solve a generic elliptic equation on two-dimensional domains with rectangular Cartesian grids, we propose a cut-cell geometric multigrid method that features (1) general algorithmic steps that apply to two-dimensional…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…
A root ideal arrangement $A_I$ is the set of reflecting hyperplanes corresponding to the roots in an order ideal $I$ of the root poset on the positive roots of a finite crystallographic root system. A characterisation of supersolvable root…
We define a novel search method and performance metric as a technique for optimizing the bit-to-symbol map of the $D_4$ and $E_8$ root lattices in reference to bit error rate. We hold other sources of lattice gain constant by fixing the…
We show that among antipodal $2d$-point configurations on the sphere $S^{d-1}$ in $\mathbb R^d$, the set of vertices of a regular cross-polytope inscribed in $S^{d-1}$ uniquely solves the best-covering problem (this is new for $d\geq 5$)…
Vertices of the 4-dimensional semi-regular polytope, \textit{snub 24-cell} and its symmetry group $W(D_{4}):C_{3} $ of order 576 are represented in terms of quaternions with unit norm. It follows from the icosian representation of…
We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
In the first paper (part I) of this series of two, we introduce four novel definitions of the ODT problems: three for size-constrained trees and one for depth-constrained trees. These definitions are stated unambiguously through executable…
In this paper we give an algorithm to round the floating point output of a semidefinite programming solver to a solution over the rationals or a quadratic extension of the rationals. We apply this to get sharp bounds for packing problems,…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…