English
Related papers

Related papers: Ordering of nested square roots of 2 according to …

200 papers

Recently some mixed alphabet rings are involved in constructing few-Lee weight additive codes with optimal or minimal Gray images using suitable defining sets or down-sets. Inspired by these works, we choose the mixed alphabet ring…

Information Theory · Computer Science 2022-06-07 Pramod Kumar Kewat , Nilay Kumar Mondal

We study the asymptotic distribution of roots of Lommel polynomials as polynomials of the order with a variable and purely imaginary argument. The roots are complex and accumulate on certain curves in the complex plane. We prove existence…

Classical Analysis and ODEs · Mathematics 2021-02-02 Petr Blaschke , František Štampach

The aim of this paper is to present the construction of exceptional Laguerre polynomials in a systematic way, and to provide new asymptotic results on the location of the zeros. To describe the exceptional Laguerre polynomials we associate…

Classical Analysis and ODEs · Mathematics 2022-10-05 Niels Bonneux , Arno B. J. Kuijlaars

Our goal in this paper is to study the zero distribution of a sequence of polynomials whose coefficients satisfy a three-term recurrence. Equivalently, these polynomials are Taylor polynomials of a rational function with a polynomial…

General Mathematics · Mathematics 2023-05-10 Juhoon Chung

We study real univariate polynomials with non-zero coefficients and with all roots real, out of which exactly two positive. The sequence of coefficients of such a polynomial begins with $m$ positive coefficients followed by $n$ negative…

Classical Analysis and ODEs · Mathematics 2024-08-22 Vladimir Petrov Kostov

Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…

Information Theory · Computer Science 2018-05-25 Mokshi Goyal , Madhu Raka

We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…

Information Theory · Computer Science 2017-07-25 Arunkumar R. Patil , Nitin S. Darkunde

Closed geodesics associated with indefinite binary quadratic forms, or equivalently with real quadratic irrationals, have long been studied as geometric $\mathrm{SL}_2(\mathbb{Z})$-invariants. Building on the Birman-Williams approach to…

Geometric Topology · Mathematics 2025-12-08 Soon-Yi Kang , Toshiki Matsusaka , Kyungbae Park

Let $F$ be a finite field of $char F > 3$ and $sl_{2}(F)$ be the Lie algebra of traceless $2\times 2$ matrices over $F$. In this paper, we find a basis for the $\mathbb{Z}_{2}$-graded identities of $sl_{2}(F)$.

Rings and Algebras · Mathematics 2017-02-17 Luís Felipe Gonçalves Fonseca

We propose a simple uniform lower bound on the spacings between the successive zeros of the Laguerre polynomials $L_n^{(\alpha)}$ for all $\alpha>-1$. Our bound is sharp regarding the order of dependency on $n$ and $\alpha$ in various…

Classical Analysis and ODEs · Mathematics 2014-06-24 Stephane Chretien , Sebastien Darses

We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising…

Information Theory · Computer Science 2024-11-28 Maryam Bajalan , Alexandre Fotue-Tabue , Joël Kabore , Edgar Martínez-Moro

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…

Combinatorics · Mathematics 2016-11-08 Carolina Benedetti , Nantel Bergeron

In classical coding theory, Gray isometries are usually defined as mappings between finite Frobenius rings, which include the ring $Z_m$ of integers modulo $m$, and the finite fields. In this paper, we derive an isometric mapping from $Z_8$…

Information Theory · Computer Science 2017-06-30 Sierra Marie M. Lauresta , Virgilio P. Sison

We demonstrate a method for listing all ordinary partitions of n as binary words of length (n-1). The resulting family imbued with the hamming distance yields subgraphs of the Hamming Graphs. The existence of a 2-Gray Code for ordinary…

Combinatorics · Mathematics 2023-08-01 Hartosh Singh Bal

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…

This paper initiates a systematic study of connections between undirected colored graphs and associated two-variable stable polynomials obtained via Cauchy transform-type formulas. Examples of such stable polynomials have played crucial…

Complex Variables · Mathematics 2025-06-17 Kelly Bickel , Yang Hong

We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…

Probability · Mathematics 2025-07-30 Ritik Jain , Han-Bom Moon , Peter Wu

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

The problem of determining cyclotomic numbers in terms of the solutions of certain Diophantine systems has been treated by many authors since the age of Gauss. In this paper we obtain an explicit expression for cyclotomic numbers of order…

Number Theory · Mathematics 2018-08-27 Md. Helal Ahmed , Jagmohan Tanti , Azizul Hoque

In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…

Classical Analysis and ODEs · Mathematics 2017-03-07 Pierluigi Vellucci , Alberto Maria Bersani