Related papers: Ordering of nested square roots of 2 according to …
We consider the problem of constructing a cyclic listing of all bitstrings of length $2n+1$ with Hamming weights in the interval $[n+1-\ell,n+\ell]$, where $1\leq \ell\leq n+1$, by flipping a single bit in each step. This is a far-ranging…
In this paper, we study one-Lee weight and two-Lee weight codes over $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$, where $u^{2}=0$. Some properties of one-Lee weight $\mathbb{Z}_{2}\mathbb{Z}_{2}[u]$-additive codes are given, and a complete…
We show that, under reasonable assumptions, two negative roots can be eliminated from the characteristic equation of a polynomial-like iterative equation. This result gives a new case where we may lower the order of such an equation.
We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to…
We study the probability distribution of the number of common zeros of a system of $m$ random $n$-variate polynomials over a finite commutative ring $R$. We compute the expected number of common zeros of a system of polynomials over $R$.…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…
In this work, we are dealing with some properties relating the zeros of a polynomial and its Mahler measure. We provide estimates on the number of real zeros of a polynomial, lower bounds on the distance between the zeros of a polynomial…
We classify the countable linear orders $X$ for which there is an order $A$ with at least two points such that the lexicographic product $AX$ is isomorphic to $X$. Given such an $X$, we determine every corresponding order $A$, and identify…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…
In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with…
The existence of the limit distribution of the zeros of Hermite-Pad\'e polynomials of type II for a pair of functions forming a Nikishin system is proved using the scalar equilibrium problem posed on the two-sheeted Riemann surface. The…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
In this paper we study a particular class of polynomials. We study the distribution of their zeros, including the zeros of their derivatives as well as the interaction between this two. We prove a weak variant of the sendov conjecture in…
The classical Stern sequence of positive integers was extended to a polynomial sequence $S_n(\lambda)$ by Klav\v{z}ar et. al. by defining $S_0(\lambda) = 0$, $S_1(\lambda) = 1$, and $$S_{2n}(\lambda) = \lambda S_n(\lambda),\quad…
A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
Mhaskar-Saff found a kind of universal behavior for the bulk structure of the zeros of orthogonal polynomials for large $n$. Motivated by two plots, we look at the finer structure for the case of random Verblunsky coefficients and for what…
We use computer algebra to determine the ranks of arrays of size 2 x 2 x 2 and 2 x 2 x 2 x 2 with entries in the set {0, 1} regarded as a field with two elements, as a Boolean algebra, and as non-negative integers. In the field case we also…