Related papers: Maximal Orthoplectic Fusion Frames from Mutually U…
One way to construct a maximal set of mutually unbiased bases (MUBs) in a prime-power dimensional Hilbert space is by means of finite phase-space methods. MUBs obtained in this way are covariant with respect to some subgroup of the group of…
The present work surveys problems in $n$-dimensional space with $n$ large. Early development in the study of packing and covering in high dimensions was motivated by the geometry of numbers. Subsequent results, such as the discovery of the…
We survey the main formulations and solution methods for two-dimensional orthogonal cutting and packing problems, where both items and bins are rectangles. We focus on exact methods and relaxations for the four main problems from the…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
Mutually Unbiased Bases (MUBs) are closely connected with quantum physics, and the structure has a rich mathematical background. We provide equivalent criteria for extending a set of MUBs for $C^n$ by studying real points of a certain…
Mutually unbiased bases in Hilbert spaces of finite dimensions are closely related to the quantal notion of complementarity. An alternative proof of existence of a maximal collection of N+1 mutually unbiased bases in Hilbert spaces of prime…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…
Mutually unbiased bases encapsulate the concept of complementarity - the impossibility of simultaneous knowledge of certain observables - in the formalism of quantum theory. Although this concept is at the heart of quantum mechanics, the…
We discuss the design of interlayer edges in a multiplex network, under a limited budget, with the goal of improving its overall performance. We analyze the following three problems separately; first, we maximize the smallest nonzero…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In this paper, we explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set.…
There has been great interest in finding sets of $m$ mutually unbiased bases which are compatible with a given space $\mathbb{C}^d$, specially in physics due to their interesting applications in quantum information theory. Several general…
Fusion frames are a convenient tool in applications where we deal with a large amount of data or when a combination of local data is needed. Oblique dual fusion frames are suitable in situations where the analysis for the data and its…
Polyhedral meshes (PM) - meshes having planar faces - have enjoyed a rise in popularity in recent years due to their importance in architectural and industrial design. However, they are also notoriously difficult to generate and manipulate.…
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…
Recent progress in Zauner's conjecture has leveraged deep conjectures in algebraic number theory to promote numerical line packings to exact and verifiable solutions to the line packing problem. We introduce a numerical-to-exact technique…
We show that maximal families of mutually unbiased bases are characterized in all dimensions by partitioned unitary error bases, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned unitary error…
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao…
Foundation models pre-trained on massive datasets, including large language models (LLMs), vision-language models (VLMs), and large multimodal models, have demonstrated remarkable success in diverse downstream tasks. However, recent studies…