相关论文: A Group-Theoretic Framework for the Construction o…

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

The geometric calculus based on Clifford algebra is a very useful tool for geometry and physics. It describes a geometric structure which is much richer than the ordinary geometry of spacetime. A Clifford manifold ($C$-space) consists not…

Let $K$ be a $\mathbb{Q}$-Clifford algebra associated to an $(n-1)$-ary positive definite quadratic form and let $\mathcal{O}$ be a maximal order in $K$. A Clifford-Bianchi group is a group of the form $\operatorname{SL}_2(\mathcal{O})$…

Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We observe that there exist Apollonian packings which have strong integrality properties, in which…

We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…

It is known that if the dimension is a perfect square the Clifford group can be represented by monomial matrices. Another way of expressing this result is to say that when the dimension is a perfect square the standard representation of the…

Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…

This paper applies techniques from algebraic and differential geometry to determine how to best pack points in real projective spaces. We present a computer-assisted proof of the optimality of a particular 6-packing in…

Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block…

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is…

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

We introduce the symplectic group $\mathrm{Sp}_2(G, \sigma)$ associated to a Lie subgroup $G$ of a (possibly noncommutative) associative algebra $A$ equipped with an anti-involution $\sigma$. Our construction recovers several classical Lie…

We review Bacry and Levy-Leblond's work on possible kinematics as applied to 2-dimensional spacetimes, as well as the nine types of 2-dimensional Cayley-Klein geometries, illustrating how the Cayley-Klein geometries give homogeneous…

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions…

It is shown that every bundle $\varSigma\to M$ of complex spinor modules over the Clifford bundle $\Cl(g)$ of a Riemannian space $(M,g)$ with local model $(V,h)$ is associated with an lpin ("Lipschitz") structure on $M$, this being a…

We propose a general framework to study constructions of Euclidean lattices from linear codes over finite fields. In particular, we prove general conditions for an ensemble constructed using linear codes to contain dense lattices (i.e.,…

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 introduce a general technique to construct tight fusion frames with prescribed symmetries. Applying this technique with a prescription for "all the symmetries", we construct a new family of equi-isoclinic tight fusion frames (EITFFs),…