Related papers: The D_4 root system is not universally optimal
It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher…
We classify the total spaces of bundles over the four sphere with fiber a three sphere up to orientation preserving and reversing homotopy equivalence, homeomorphism and diffeomorphism. These total spaces have been of interest to both…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
The dodecacode is a nonlinear additive quaternary code of length $12$. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance $5$. In particular, this latter code is completely regular but not…
By prior work, there is a distributed algorithm that finds a maximal fractional matching (maximal edge packing) in $O(\Delta)$ rounds, where $\Delta$ is the maximum degree of the graph. We show that this is optimal: there is no distributed…
We prove that there exists a holomorphic symplectic manifold deformation equivalent to the Hilbert scheme of two points on a K3 surface that admits a non-symplectic automorphism of order 23, that is the maximal possible prime order in this…
A convex geometry is a closure system satisfying the anti-exchange property. In this work we document all convex geometries on 4- and 5-element base sets with respect to their representation by circles on the plane. All 34 non-isomorphic…
Let $G$ be a usc decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the natural projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…
New methods for $D$-decomposition analysis are presented. They are based on topology of real algebraic varieties and computational real algebraic geometry. The estimate of number of root invariant regions for polynomial parametric families…
We prove that pointwise finite-dimensional S^1 persistence modules over an arbitrary field decompose uniquely, up to isomorphism, into the direct sum of a bar code and finitely-many Jordan cells. These persistence modules have also been…
The topic of totally separable sphere packings is surveyed with a focus on regular constructions, uniform tilings, and contact number problems. An enumeration of all regular totally separable sphere packings in $\mathbb{R}^2$,…
Global registration using 3D point clouds is a crucial technology for mobile platforms to achieve localization or manage loop-closing situations. In recent years, numerous researchers have proposed global registration methods to address a…
We find a sixteen supersymmetric mass-deformed Bagger-Lambert theory with $SO(4)\times SO(4)$ global R-symmetry. The R-charge plays the `non-central' term in the superalgebra. This theory has one symmetric vacuum and two in-equivalent…
We describe a method to show that certain elliptic surfaces do not admit purely inseparable multisections (equivalently, that genus one curves over function fields admit no points over the perfect closure of the base field) and use it to…
Any symmetric closed subset of a finite crystallographic root system must be a closed subroot system. This is not, in general, true for real affine root systems. In this paper, we determine when this is true and also give a very explicit…
We study sharp frame bounds of Gabor systems over rectangular lattices for different windows and integer oversampling rate. In some cases we obtain optimality results for the square lattice, while in other cases the lattices optimizing the…
In [1] it was shown how the flavor symmetry A4 (or S4) can arise if the three fermion generations are taken to live on the fixed points of a specific 2-dimensional orbifold. The flavor symmetry is a remnant of the 6-dimensional Poincare…
We consider algorithmic approaches to the D-optimality problem for cases where the input design matrix is large and highly structured, in particular implicitly specified as a full quadratic or linear response-surface model in several levels…
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…
Among the nondegenerate C^4 hypersurfaces M in R^n, we characterize the rational quadrics as the hypersurfaces that are the least well approximated by rational points. Given M other than a rational quadric, we prove a heuristically sharp…