Related papers: Evaluation codes from linear systems of conics
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…
We study the combinatorial geometry of "lattice" Jenkins--Strebel differentials with simple zeroes and simple poles on $\mathbb{C}P^1$ and of the corresponding counting functions. Developing the results of M. Kontsevich we evaluate the…
Low-density parity check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of…
Elementary methods are used to examine some nontrivial mathematical issues underpinning the Lorentz transformation. Its eigen-system is characterized through the exponential of a $G$-skew symmetric matrix, underlining its unconnectedness at…
We study orthogonal polynomials and Hankel determinants generated by a symmetric semi-classical Jacobi weight. By using the ladder operator technique, we derive the second-order nonlinear difference equations satisfied by the recurrence…
Given two binary codes of length n, using Plotkin construction we obtain a code of length 2n. The construction works for linear and nonlinear codes. For the linear case, it is straightforward to see that the dimension of the final code is…
We consider lattice equations on ${\mathds{Z}}^2$ which are autonomous, affine linear and possess the symmetries of the square. Some basic properties of equations of this type are derived, as well as a sufficient linearization condition and…
We present a deterministic polynomial time algorithm for computing the zeta function of an arbitrary variety of fixed dimension over a finite field of small characteristic. One consequence of this result is an efficient method for computing…
We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…
Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…
The multi-indexed Jacobi polynomials are the main part of the eigenfunctions of exactly solvable quantum mechanical systems obtained by certain deformations of the P\"oschl-Teller potential (Odake-Sasaki). By fine-tuning the parameter(s) of…
An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based algorithms, e.g. message passing algorithms and decoding…
Coded computing is a distributed paradigm that uses coding theory to introduce \textit{redundancy} and overcome bottlenecks in large-scale systems. In the same vein, randomized numerical linear algebra employs probabilistic methods to…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
We classify all the \emph{$\Delta$-}coherent pairs of measures of the second kind on the real line. We obtain $5$ cases, corresponding to all the families of discrete semiclassical orthogonal polynomials of class $s\leq1.$
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…