Related papers: On Binary Shadow Codes
Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
Unimodular networks are a generalization of finite graphs in a stochastic sense. We prove a lower bound to the spectral radius of the adjacency operator and of the Markov operator of an unimodular network in terms of its average degree.…
Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…
We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…
In this paper we prove a result on the structure of the elements of an additive {\it maximum rank distance (MRD) code} over the field of order two, namely that in some cases such codes must contain a semifield spread set. We use this result…
Binary optimal codes often contain optimal or near-optimal subcodes. In this paper we show that this is true for the family of self-dual codes. One approach is to compute the optimum distance profiles (ODPs) of linear codes, which was…
We derive upper bounds for the smallest zero and lower bounds for the largest zero of Laguerre, Jacobi and Gegenbauer polynomials. Our approach uses mixed three term recurrence relations satisfied by polynomials corresponding to different…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
Let R be a commutative local noetherian ring. We prove that the existence of a chain of semidualizing R-complexes of length (d+1) yields a degree-d polynomial lower bound for the Bass numbers of R. We also show how information about certain…
In this paper, we obtain two new lower bounds for the smallest singular value of nonsingular matrices which is better than the bound presented by zou \cite{zou2012lower}, Lin, Minghua and Xie, Mengyan \cite{lin2021some} under certain…
We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…
The existence of a pivot rule for the simplex method that guarantees a strongly polynomial run-time is a longstanding, fundamental open problem in the theory of linear programming. The leading pivot rule in theory is the shadow pivot rule,…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…
Upper bounds on the minimum Lee distance of codes that are linear over ${\mathbb Z}_q$, $q=p^t$, $p$ prime are discussed. The bounds are Singleton like, depending on the length, rank, and alphabet size of the code. Codes meeting such bounds…
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…