Related papers: On average coherence of cyclotomic lattices
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…
Well-rounded lattices have been a topic of recent studies with applications in wiretap channels and in cryptography. A lattice of full rank in Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. In…
We show that the problem of deciding whether a given Euclidean lattice L has an orthonormal basis is in NP and co-NP. Since this is equivalent to saying that L is isomorphic to the standard integer lattice, this problem is a special form of…
A marked lattice is a $d$-dimensional Euclidean lattice, where each lattice point is assigned a mark via a given random field on ${\mathbb Z}^d$. We prove that, if the field is strongly mixing with a faster-than-logarithmic rate, then for…
Band theory for partially coherent light is introduced by using the formalism of second-order classical coherence theory under paraxial approximation. It is demonstrated that the cross-spectral density function, describing correlations…
Cycling chaos is a heteroclinic connection between several chaotic attractors, at which switching between the chaotic sets occur at growing time intervals. Here we characterize the coherence properties of these switchings, considering…
The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…
The conventional coherence is defined with respect to a fixed orthonormal basis, i.e., to a von Neumann measurement. Recently, generalized quantum coherence with respect to general positive operator-valued measurements (POVMs) has been…
This work introduces a complexity measure which addresses some conflicting issues between existing ones by using a new principle - measuring the average amount of symmetry broken by an object. It attributes low (although different)…
A high-frequency asymptotic scheme is generated that captures the motion of waves within discrete hexagonal and honeycomb lattices by creating continuum homogenised equations. The accuracy of these effective medium equations in describing…
Coherence simplices are generic topological correlation-function defects supported by a hierarchy of coherence functions. We classify coherence simplices based on their topology and discuss their structure and dynamics, together with their…
Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
Low-rank matrix approximations are often used to help scale standard machine learning algorithms to large-scale problems. Recently, matrix coherence has been used to characterize the ability to extract global information from a subset of…
We use a method based on optical coherent transients to study the vibrational coherence lifetimes of atoms trapped in the potential wells of a near-resonant optical lattice in the oscillating regime. The dependence of the positions and…
A crucial step in the history of General Relativity was Einstein's adoption of the principle of general covariance which demands a coordinate independent formulation for our spacetime theories. General covariance helps us to disentangle a…