Related papers: MacWilliams' Extension Theorem for rank-metric cod…
The MacWilliams identity for linear time-invariant convolutional codes that has recently been found by Gluesing-Luerssen and Schneider is proved concisely, and generalized to arbitrary group codes on graphs. A similar development yields a…
In the setting of a metric space equipped with a doubling measure and supporting a Poincar\'e inequality, and based on results by Bj\"orn and Shanmugalingam (2007), we show that functions of bounded variation can be extended from any…
We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…
We show that the Ramsey number is linear for every uniform hypergraph with bounded-degree. This is a hypergraph extension of the famous theorem for ordinary graphs which Chv\'atal et al. showed in 1983. Our proof is simple, contains the…
We discuss the possibility of extending different versions of the Campbell-Magaard theorem, which have already been established in the context of semi-Riemannian geometry, to the context of Weyl's geometry. We show that some of the known…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
Scattered polynomials of a given index over finite fields are intriguing rare objects with many connections within mathematics. Of particular interest are the exceptional ones, as defined in 2018 by the first author and Zhou, for which…
The classical 1991 result by Brightwell and Winkler states that the number of linear extensions of a poset is #P-complete. We extend this result to posets with certain restrictions. First, we prove that the number of linear extension for…
We prove existence of extension dimension for paracompact spaces. Here is the main result of the paper: \proclaim{Theorem} Suppose X is a paracompact space. There is a CW complex K such that {a.} K is an absolute extensor of X up to…
We prove a new selection theorem for multivalued mappings of C-space. Using this theorem we prove extension dimensional version of Hurewicz theorem for a closed mapping $f\colon X\to Y$ of $k$-space $X$ onto paracompact $C$-space $Y$: if…
The notion of a symmetric extension extends the usual notion of forcing by identifying a particular class of names which forms an intermediate model of ZF between the ground model and the generic extension, and often the axiom of choice…
Let $X$ be a weakly pseudoconvex manifold and $L\longrightarrow X$ be a holomorphic line bundle with a singular positive Hermitian metric $h$. In this article, we provide a points separation theorem and an embedding for the adjoint linear…
We prove in this note a result on extension of meromorphic mappings, which can be considered as a direct generalisation of the Hartogs extension theorem for holomorphic functions. Namely: THEOREM. Every meromorphic mapping $f:H_n^q(r)\to…
The number-theoretic codes are a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a…
We establish a pseudoisotopy result for embedding spaces in the line of that of Weiss and Williams for diffeomorphism groups. In other words, for $P\subset M$ a codimension at least three embedding, we describe the difference in a range of…
As a generalization of Hausdorff's extension theorem of metrics, we prove an interpolation theorem of a family of metrics defined on closed subsets of metrizable spaces. As an application, we investigate typicality of subsets of moduli…
We extend the notion of locality from the Hamming metric to the rank and subspace metrics. Our main contribution is to construct a class of array codes with locality constraints in the rank metric. Our motivation for constructing such codes…
In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
In this paper, we provide a thorough study on the expansion of single trace Einstein-Yang-Mills amplitudes into linear combination of color-ordered Yang-Mills amplitudes, from various different perspectives. Using the gauge invariance…