Related papers: Constructive Spherical Codes by Hopf Foliations
We show how the variational characterisation of spherical designs can be used to take a union of spherical designs to obtain a spherical design of higher order (degree, precision, exactness) with a small number of points. The examples that…
We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a "top-down" fashion by "recursive coordinate bisection" where on each tree level we split the…
New soft- and hard decision decoding algorithms are presented for general Reed-Muller codes $\left\{\genfrac{}{}{0pt}{}{m}{r}\right\} $ of length $2^{m}$ and distance $2^{m-r}$. We use Plotkin $(u,u+v)$ construction and decompose code…
Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying…
Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…
High-precision cosmology requires the analysis of large-scale surveys in 3D spherical coordinates, i.e. spherical Fourier-Bessel decomposition. Current methods are insufficient for future data-sets from wide-field cosmology surveys. The aim…
The goal of this paper is to give a new method of constructing finite-dimensional semisimple triangular Hopf algebras, including minimal ones which are non-trivial (i.e. not group algebras). The paper shows that such Hopf algebras are quite…
We propose that protein loops can be interpreted as topological domain-wall solitons. They interpolate between ground states that are the secondary structures like alpha-helices and beta-strands. Entire proteins can then be folded simply by…
A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants in the parity-check matrix of a block code into several components and piecing copies of these components in a diagonal structure. By connecting…
The volume of a k-dimensional foliation $\mathcal{F}$ in a Riemannian manifold $M^{n}$ is defined as the mass of image of the Gauss map, which is a map from M to the Grassmann bundle of k-planes in the tangent bundle. Generalizing a…
We describe an effective method for computing the topological degree of continuous functions $R:S^2 \to S^2$, where $S^2$ is the Riemann sphere. Our approach generalizes the degree formula for rational functions of complex polynomials,…
Rotations in 3 dimensional space are equally described by the SU(2) and SO(3) groups. These isomorphic groups generate the same 3D kinematics using different algebraic structures of the unit quaternion. The Hopf Fibration is a projection…
In this paper, we propose several constructions of Locally Recoverable Codes from elliptic surfaces. In particular, we are able to obtain codes with availability $t>2$, codes with hierarchical locality and, finally, codes which combine…
It is known that the topological Hopf term in two-dimensional (2D) spin systems can be derived by coupling to massless Dirac fermions. We establish a universal rule governing the generation of Hopf terms in 2D quantum spin systems coupled…
We present an $\epsilon$-bounded compression method for unit-norm embeddings that achieves 1.5$\times$ compression, 25% better than the best prior lossless method. The method exploits that spherical coordinates of high-dimensional unit…
We consider a field theory with target space being the two dimensional sphere S^2 and defined on the space-time S^3 x R. The Lagrangean is the square of the pull-back of the area form on S^2. It is invariant under the conformal group…
In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an…
Graph spanners are fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each round $O(\log n)$ bits can be transmitted over every edge (the…
Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…
We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic…