Related papers: Generalized column distances
We study the complexity of approximations to the normalized information distance. We introduce a hierarchy of computable approximations by considering the number of oscillations. This is a function version of the difference hierarchy for…
Given a manifold $\mathbb{M}$ admitting a maximally supersymmetric consistent truncation, we show how to formulate new consistent truncations by restricting to a set of Kaluza-Klein modes on $\mathbb{M}$ invariant under some subgroup of the…
We consider a class of percolation models where the local occupation variables have long-range correlations decaying as a power law $\sim r^{-a}$ at large distances $r$, for some $0< a< d$ where $d$ is the underlying spatial dimension. For…
These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…
Unless there is evidence for fractal scaling with a single exponent over distances .1 <= r <= 100 h^-1 Mpc then the widely accepted notion of scale invariance of the correlation integral for .1 <= r <= 10 h^-1 Mpc must be questioned. The…
We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the…
We present a fundamental theory of curves in the affine plane and the affine space, equipped with the general-affine groups ${\rm GA}(2)={\rm GL}(2,{\bf R})\ltimes {\bf R}^2$ and ${\rm GA}(3)={\rm GL}(3,{\bf R})\ltimes {\bf R}^3$,…
Using the concept of constant evasion to different sorts of suitable binary relations, we establish many cardinal invariants derived from the established cardinal invariants $\mathfrak{e}^\mathrm{const}_{n}$ and…
An alternating distance is a link invariant that measures how far away a link is from alternating. We study several alternating distances and demonstrate that there exist families of links for which the difference between certain…
Under polynomial time reduction, the maximum likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is…
In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors…
Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…
One considers a system on $\mathbb{C}^2$ close to an invariant curve which can be viewed as a generalization of the semi-standard map to a trigonometric polynomial with many Fourier modes. The radius of convergence of an analytic…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
For a more general notion of Cartan connection we define characteristic classes, we investigate their relation to usual characteristic classes.
We introduce the notion of Universally Decodable Matrices of Genus g (UDMG), which for g=0 reduces to the notion of Universally Decodable Matrices (UDM) introduced in [8]. A UDMG is a set of L matrices over a finite field, each with K rows,…
In some scientific fields, a scaling is able to modify the topology of an observed object. Our goal in the present work is to introduce a new formalism adapted to the mathematical representation of this kind of phenomenon. To this end, we…
The concept of generalised (in the sense of Colombeau) connection on a principal fibre bundle is introduced. This definition is then used to extend results concerning the geometry of principal fibre bundles to those that only have a…
A generalization of a distribution increases the flexibility particularly in studying of a phenomenon and its properties. Many generalizations of continuous univariate distributions are available in literature. In this study, an…
Generalized Product (GPC) Codes, an unification of Product Codes and Integrated Interleaved (II) Codes, are presented. Applications for approaches requiring local and global parities are described. The more general problem of extending…