Related papers: MacWilliams Identities for Terminated Convolutiona…
Andrews and Bressoud, Alladi and Gordon, and others, have proven, in a number of papers, that the coefficients in various arithmetic progressions in the series expansions of certain infinite $q$-products vanish. In the present paper it is…
We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…
This paper investigates general properties of codes with the rank metric. We first investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering properties of rank metric codes, derive bounds on their…
Ward identities for extended objects are discussed. In the limit of dc transport it is rigorously proved that charge-density and spin-density fluctuations do not couple to electromagnetic field.
It is well known that Space-Time Block Codes (STBCs) from orthogonal designs (ODs) are single-symbol decodable/symbol-by-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes…
We establish a connection between analytic number theory and computational learning theory by showing that the M\"obius function belongs to a class of functions that is statistically hard to learn from random samples. Let $\mu_R$ denote the…
We provide a coordinate-free version of the local classification, due to A. G. Walker [Quart. J. Math. Oxford (2) 1, 69 (1950)], of null parallel distributions on pseudo-Riemannian manifolds. The underlying manifold is realized, locally, as…
We provide a linear time algorithm to determine the flip distance between two plane spanning paths on a point set in convex position. At the same time, we show that the happy edge property does not hold in this setting. This has to be seen…
We establish the central limit theorem for linear processes with dependent innovations including martingales and mixingale type of assumptions as defined in McLeish [Ann. Probab. 5 (1977) 616--621] and motivated by Gordin [Soviet Math.…
In this article, we discuss a probabilistic interpretation of McShane's identity as describing a finite measure on the space of embedded paths though a point.
More than 50 years ago, Golomb and Welch conjectured that there is no perfect Lee codes $C$ of packing radius $r$ in $\mathbb{Z}^{n}$ for $r\geq2$ and $n\geq 3$. Recently, Leung and the second author proved that if $C$ is linear, then the…
Variational autoencoders model high-dimensional data by positing low-dimensional latent variables that are mapped through a flexible distribution parametrized by a neural network. Unfortunately, variational autoencoders often suffer from…
We find exact identities for sums of the form \begin{equation*}\label{eq:convsumabs} \sum_{\stackrel{n_1+n_2 = n}{n_1 \in \mathbb{Z} \setminus \{ 0, n \} }} Q(n_1,n_2) \sigma_{-r_1}(n_1) \sigma_{-r_2}(n_2), \end{equation*} where…
Let $K \subset \mathbb{R}^n$ be a centered convex body of volume one. We prove that there exist absolute constants $c,C > 0$ and an orthonormal set of vectors $\Theta \subset S^{n-1}$ with size $\left|\Theta\right| \ge 9n/10$ such that, if…
Bercovici and Pata showed that the correspondence between classically, freely, and Boolean infinitely divisible distributions holds on the level of limit theorems. We extend this correspondence also to distributions infinitely divisible…
We propose an efficient algorithm for learning mappings between two metric spaces, $\X$ and $\Y$. Our procedure is strongly Bayes-consistent whenever $\X$ and $\Y$ are topologically separable and $\Y$ is "bounded in expectation" (our term;…
The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…
Subfield codes of linear codes over finite fields have recently received much attention. Some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, the $q$-ary…
We investigate the high-dimensional properties of robust regression estimators in the presence of heavy-tailed contamination of both the covariates and response functions. In particular, we provide a sharp asymptotic characterisation of…
Firstly, this paper establishes useful forms of the remainder term of Hardy-type inequalities on general domains where the weights are functions of the distance to the boundary. For weakly mean convex domains we use the resulting identities…