Related papers: A Group-Theoretic Framework for the Construction o…
Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
For $\Gamma$ a relatively hyperbolic group, we construct a model for the universal space among $\Gamma$-spaces with isotropy on the family VC of virtually cyclic subgroups of $\Gamma$. We provide a recipe for identifying the maximal…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they are as far apart as possible? The results of extensive computations for modest values of N, n, m are…
This article is devoted to the investigation of wrap groups of connected fiber bundles over the fields of real $\bf R$, complex $\bf C$ numbers, the quaternion skew field $\bf H$ and the octonion algebra $\bf O$. These groups are…
Apollonian circle packings arise by repeatedly filling the interstices between mutually tangent circles with further tangent circles. In Euclidean space it is possible for every circle in such a packing to have integer radius of curvature,…
The automorphism group of the Barnes-Wall lattice L_m in dimension 2^m (m not 3) is a subgroup of index 2 in a certain ``Clifford group'' C_m (an extraspecial group of order 2^(1+2m) extended by an orthogonal group). This group and its…
Codes arising from algebraic structures over number fields lead naturally to determinant optimization problems governed by arithmetic invariants. In this paper, we investigate $2\times 2$ space-time block codes defined over rings of…
Fiber bundles over infinite fields with non-trivial ultra-norms are considered. For them geometric wrap groups are defined and investigated. Besides fields also Cayley-Dickson algebras over fields of characteristic not equal to two are…
It is shown that classical Clifford algebras are group algebras of cyclic subgroups of arrowy rermutations. It is established that Euclidean 3-space, Pauli and Dirac algebras and groups of global guage transformations are corollary from the…
A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…
Using quaternions and octonions, we construct some maps from the Grassmannian of 2-dimensional planes of $\mathbb{R}^n$, $\mathrm{Gr}_2(\mathbb{R}^n)$, to the projective space $\mathbb{R}\mathrm{P}^k$, for certain values of $n$ and $k$. All…
In this paper we use a diffeo-geometric framework based on manifolds that are locally modeled on "convenient" vector spaces to study the geometry of some infinite dimensional spaces. Given a finite dimensional symplectic manifold…
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…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…