Related papers: Dense Packings from Algebraic Number Fields and Co…

This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…

How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…

In this paper fundamental nonlinear geometries of Lebesgue sequence spaces are studied in their quantitative aspects. Applications of this work are a positive solution to the strong embeddability problem from $\ell_q$ into $\ell_p$…

The desirable properties when constructing collections of subspaces often include the algebraic constraint that the projections onto the subspaces yield a resolution of the identity like the projections onto lines spanned by vectors of an…

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

Every $\mathrm{C}^*$-algebra, regardless of its density character, can be embedded into the Calkin algebra in a forcing extension of the universe obtained without collapsing any cardinal.

Let $K$ be a number field with ring of integers $\mathcal O$. After introducing a suitable notion of density for subsets of $\mathcal O$, generalizing that of natural density for subsets of $\mathbb Z$, we show that the density of the set…

Decomposition spaces are a class of function spaces constructed out of well-behaved coverings and partitions of unity of a set. The structure of the covering of the set determines the properties of the decomposition space. Besov spaces,…

We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…

Finding the densest sphere packing in $d$-dimensional Euclidean space $\mathbb{R}^d$ is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding…

One of the primary challenges in quantum chemistry is the accurate modeling of strong electron correlation. While multireference methods effectively capture such correlation, their steep scaling with system size prohibits their application…

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…

We present in this paper some embeddings of various dyadic martingale Hardy-amalgam spaces $H^S_{p,q},\,\, H^s_{p,q},\,\,H^*_{p,q},\,\,\mathcal{Q}_{p,q}$ and $\mathcal{P}_{p,q}$ of the real line. In the same settings, we characterize the…

One of the goals in the development of large scale electronic structure methods is to perform calculations explicitly for a localised region of a system, while still taking into account the rest of the system outside of this region. An…

This paper introduces an approach for detecting differences in the first-order structures of spatial point patterns. The proposed approach leverages the kernel mean embedding in a novel way by introducing its approximate version tailored to…

The question of embedding fields into central simple algebras $B$ over a number field $K$ was the realm of class field theory. The subject of embedding orders contained in the ring of integers of maximal subfields $L$ of such an algebra…

We consider a version of the nearest-codeword problem on finite fields $\mathbb{F}_q$ using the Manhattan distance, an analog of the Hamming metric for non-binary alphabets. Similarly to other lattice related problems, this problem is…

This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…