Related papers: On the MacWilliams Theorem over Codes and Lattices
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can…
Burst errors are very common in practice. There have been many designs in order to control and correct such errors. Recently, a new class of byte error control codes called spotty byte error control codes has been specifically designed to…
We study supersymmetry breaking from a lattice model of N=2 supersymmetric quantum mechanics using the direct computational method proposed in arXiv:1803.07960. The vanishing Witten index is realized as a numerical result in high precision.…
Mimicking the idea of the generalized Hamming weight of linear codes, we introduce a new lattice invariant, the generalized theta series. Applications range from identifying stable lattices to the lattice isomorphism problem. Moreover, we…
Originally, quantum probability theory was developed to analyze statistical phenomena in quantum systems, where classical probability theory does not apply, because the lattice of measurable sets is not necessarily distributive. On the…
Under hypotheses required for the Taylor-Wiles method, we prove for forms of $U(3)$ which are compact at infinity that the lattice structure on upper alcove algebraic vectors or on principal series types given by the $\lambda$-isotypic part…
For a random variable with a unimodal distribution and finite second moment Gau\ss \, (1823) proved a sharp bound on the probability of the random variable to be outside a symmetric interval around its mode. An alternative proof for it is…
A generalization of Newton's identity on symmetric functions is given. Using the generalized Newton identity we give a unified method to show the existence of Hall-Littlewood, Jack and Macdonald polynomials. We also give a simple proof of…
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…
In spite of its simplicity, the central limit theorem captures one of the most outstanding phenomena in mathematical physics, that of universality. While this classical result is well understood it is still not very clear what happens to…
An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph's non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph's first Betti number $\beta$.…
In a large-momentum nucleon state, the matrix element of a gauge-invariant Euclidean Wilson line operator accessible from lattice QCD can be related to the standard light-cone parton distribution function through the large-momentum…
Previously, we proved an identity for theta functions of degree eight, and several applications of it were also discussed. This identity is a natural extension of the addition formula for the Weierstrass sigma-function. In this paper we…
On the assumption of the Riemann hypothesis and a spacing hypothesis for the nontrivial zeros $\frac12+i\gamma$ of the Riemann zeta function, we show that the sequence \[ \Gamma_{[a, b]} =\Bigg\{ \gamma : \gamma>0 \quad \mbox{and} \quad…
Let $K=Q(\sqrt{-\ell})$ be an imaginary quadratic field with ring of integers $\O_K$, where $\ell$ is a square free integer such that $\ell\equiv 3 \mod 4$ and $C=[n, k]$ be a linear code defined over $\O_K/2\O_K$. The level $\ell$ theta…
We present an algorithmic approach to the verification of identities on multiple theta functions in the form of products of theta functions $[(-1)^{\delta}a_1^{\alpha_1}a_2^{\alpha_2}\cdots a_r^{\alpha_r}q^{s}; q^{t}]_\infty$, where…
Weyl's formulation of quantum mechanics opened the possibility of studying the dynamics of quantum systems both in infinite-dimensional and finite-dimensional systems. Based on Weyl's approach, generalized by Schwinger, a self-consistent…
In this short note we study uniform approximations to the normal distributions by Jacobi theta functions. We shall show that scaled theta functions approach to a normal distribution exponentially fast.
In this article, we illustrate an algorithm for the computation of the weight distribution of CRC codes. The recursive structure of CRC codes will give us an iterative way to compute the weight distribution of their dual codes starting from…
In this note, we describe a general procedure to prove functional equations involving quasi-periodic functions. We give novel proofs for fundamental identities of Weierstrass sigma and Jacobi theta functions. Our method is based on the…