Related papers: Homological Error Correcting Codes and Systolic Ge…
In this paper we provide a way of taking $L^p$, $p > \frac{m}{2}$ bounds on a $m-$ dimensional Riemannian metric and transforming that into H\"{o}lder bounds for the corresponding distance function. One can think of this new estimate as a…
Persistent homology is a way of determining the topological properties of a data set. It is well known that each persistence module admits the structure of a representation of a finite totally ordered set. In previous work, the authors…
Homogenization of a spectral problem in a bounded domain with a high contrast in both stiffness and density is considered. For a special critical scaling, two-scale asymptotic expansions for eigenvalues and eigenfunctions are constructed.…
We discuss the structure of topological defects in the context of extra dimensions where the symmetry breaking terms are localized. These defects develop structure in the extra dimension which differs from the case where symmetry breaking…
The equivariant Gromov--Hausdorff convergence of metric spaces is studied. Where all isometry groups under consideration are compact Lie, it is shown that an upper bound on the dimension of the group guarantees that the convergence is by…
Proper understanding of the geometry on the boundary of a spacetime is a critical step on the way to extending holography to spaces with non-AdS asymptotics. In general the boundary cannot be described in terms of the Riemannian geometry…
In the present paper, we show that if the dimension of an arbitrary algebraic geometry code over a finite field of even characters is slightly less than half of its length, then it is equivalent to an Euclidean self-orthogonal code.…
After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…
We consider the coding problem in the Stiefel manifold with chordal distance. After considering various low-dimensional instances of this problem, we use Rankin's bounds on spherical codes to prove upper bounds on the minimum distance of a…
The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…
The systolic area $\alpha_{sys}$ of a nonsimply connected compact Riemannian surface $(M,g)$ is defined as its area divided by the square of the systole, where the systole is equal to the length of a shortest noncontractible closed curve.…
The free distance of a convolutional code is a reliable indicator of its performance. However its computation is not an easy task. In this paper, we present some algorithms to compute the free distance with good efficiency that work for…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
We consider the phenomenon of forced symmetry breaking in a symmetric Hamiltonian system on a symplectic manifold. In particular we study the persistence of an initial relative equilibrium subjected to this forced symmetry breaking. We see…
The aim of this paper is to formulate a local systolic inequality for odd-symplectic forms (also known as Hamiltonian structures) and to establish it in some basic cases. Let $\Omega$ be an odd-symplectic form on an oriented closed manifold…
We prove a universal inequality between the diastole, defined using a minimax process on the one-cycle space, and the area of closed Riemannian surfaces. Roughly speaking, we show that any closed Riemannian surface can be swept out by a…
Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional relationship between the dimension (say, $p$) and the sample size (say,…
For closed hyperbolic $3$-manifolds $M$ with volume less than a constant $V$, we prove an inequality regarding the geometric $L^2$-norm and the topological Thurston norm, which is qualitatively sharp and verifies a conjecture of Brock and…
Analogs of Reed-Solomon codes are introduced within the framework of bottleneck poset metrics. These codes are proven to be maximum distance separable. Furthermore, the results are extended to the setting of Algebraic Geometry codes.
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…