arXiv subjects

Shanta Laishram

Publications and source records attributed to Shanta Laishram.

At least 19 recordsLinked to original sources

arXiv2026

Generalized Fruit Diophantine equation over number fields

Let $K$ be a number field and $\mathcal{O}_K$ be the ring of integers of $K$. In this article, we study the solutions of the generalized fruit Diophantine equation $ax^d-y^2-z^2 +xyz-c=0$ over $K$, where $d \geq 3$ is an integer and $a,c\in \mathcal{O}_K\setminus \{0\}$. Subsequently, we provide explicit values of square-free integers $t$ such that the equation $ax^d-y^2-z^2 +xyz-c=0$ has no solution $(x_0, y_0, z_0) \in \mathcal{O}_{\mathbb{Q}(\sqrt{t})}^3$ with $2 | x_0$, and demonstrate that the set of all such square-free integers $t$ with $t \geq 2$ has density exactly $\frac{1}{6}$. As an application, we construct infinitely many elliptic curves $E$ defined over number fields $K$ having no integral point $(x_0,y_0) \in \mathcal{O}_K^2$ with $2|x_0$.

math.NT↗

arXiv2025

Behaviour of Newton Polygon over polynomial composition

In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with respect to a prime $ p $ can be explicitly described in terms of the Newton polygon of the polynomial $ g(x) $. Our results provide deeper insights into how the Newton polygon of a polynomial evolves under iteration and composition, with applications to the study of dynamical irreducibility, eventual stability, non-monogenity of tower of number fields, etc.

math.NT↗

arXiv2025

Primitive prime divisors in the forward orbit of a polynomial

For the polynomial $f(z) \in \mathbb{Q}[z]$, we consider the Zsigmondy set $\mathcal{Z}(f,0)$ associated to the numerators of the sequence $\{f^n(0)\}_{n \geq 0}$. In this paper, we provide an upper bound on the largest element of $\mathcal{Z}(f, 0)$. As an application, we show that the largest element of the set $\mathcal{Z}(f,0)$ is bounded above by $6$ when $f(z) = z^d + z^e +c \in \mathbb{Q}[z]$, with $d>e \geq 2$ and $|c|>2$. Furthermore, when $f(z) =z^d+c \in \mathbb{Q}[z]$ with $|f(0)| > 2^{\frac{d}{d-1}}$ and $d >2$, we also deduce a result of Krieger [Int. Math. Res. Not. IMRN, 23 (2013), pp. 5498-5525] as a consequence of our main result.

math.NT↗

arXiv2023

$p$-numerical semigroup of generalized Fibonacci triples

For a nonnegative integer $p$, we give explicit formulas for the $p$-Frobenius number and the $p$-genus of generalized Fibonacci numerical semigroups. Here, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_k$ are expressed more than $p$ ways. When $p=0$, $S_0$ with the $0$-Frobenius number and the $0$-genus is the original numerical semigroup with the Frobenius number and the genus. In this paper, we consider the $p$-numerical semigroup involving Jacobsthal polynomials, which include Fibonacci numbers as special cases. We can also treat with the Jacobsthal-Lucas polynomials, including Lucas numbers accordingly. One of the applications on the $p$-Hilbert series is mentioned.

math.NT↗

arXiv2023

Rational solutions to the Variants of Erdős- Selfridge superelliptic curves

For the superelliptic curves of the form $$ (x+1) \cdots(x+i-1)(x+i+1)\cdots (x+k)=y^\ell$$ with $x,y \in \mathbb{Q}$, $y\neq 0$, $k \geq 3$, $1\leq i\leq k$, $\ell \geq 2,$ a prime, Das, Laishram, Saradha, and Edis showed that the superelliptic curve has no rational points for $\ell\geq e^{3^k}$. In fact, the double exponential bound, obtained in these papers is far from reality. In this paper, we study the superelliptic curves for small values of $k$. In particular, we explicitly solve the above equation for $4 \leq k \leq 8.$

math.NT↗

arXiv2022

Stability of Certain Higher Degree Polynomials

One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of $f(z)=z^d+\frac{1}{c}$ for $d\geq 2$, $c\in{\mathbb{Z}\setminus\{0\}}$. We show that for infinite families of $d\geq 3$, whenever $f(z)$ is irreducible, all its iterates are irreducible, that is, $f(z)$ is stable. For $c\equiv 1\pmod{4}$, we show that all the iterates of $z^2+\frac{1}{c}$ are irreducible. Also we show that for $d=3$, if $f(z)$ is reducible, then the number of irreducible factors of each iterate of $f(z)$ is exactly $2$ for $|c|\leq{10^{12}}$.

math.NT↗

arXiv2020

On members of Lucas sequences which are either products of factorials or product of middle binomial coefficients and Catalan numbers

Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad D_{m_i}\in \{B_{m_i}, C_{m_i}\}$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12, 16\}$. Here $B_m$ is the middle binomial coefficient $\binom{2m}{m}$ and $C_m$ is the Catalan number $\frac{1}{m+1}\binom{2m}{m}$.

math.NT↗

arXiv2020

On members of Lucas sequences which are products of Catalan numbers

We show that if $\{U_n\}_{n\geq 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=C_{m_1}C_{m_2}\cdots C_{m_k}$ with $1\leq m_1\leq m_2\leq \cdots\leq m_k$, where $C_m$ is the $m$th Catalan number satisfies $n<6500$. In case the roots of the Lucas sequence are real, we have $n\in \{1,2, 3, 4, 6, 8, 12\}$. As a consequence, we show that if $\{X_n\}_{n\geq 1}$ is the sequence of the $X$ coordinates of a Pell equation $X^2-dY^2=\pm 1$ with a nonsquare integer $d>1$, then $X_n=C_m$ implies $n=1$.

math.NT↗

arXiv2019

Progress towards a nonintegrality conjecture

Given $r \in \mathbb{N}$, define the function $S_{r}: \mathbb{N} \rightarrow \mathbb{Q}$ by $S_{r}(n)=\displaystyle \sum_{k=0}^{n} \frac{k}{k+r} \binom{n}{k}$. In $2015$, the second author conjectured that there are infinitely many $r \in \mathbb{N}$ such that $S_{r}(n)$ is nonintegral for all $n \geq 1$, and proved that $S_{r}(n)$ is not an integer for $r \in \{2,3,4\}$ and for all $n \geq 1$. In $2016$, Florian Luca and the second author raised the stronger conjecture that for any $r \geq 1$, $S_{r}(n)$ is nonintegral for all $n \geq 1$. They proved that $S_{r}(n)$ is nonintegral for $r \in \{5,6\}$ and that $S_{r}(n)$ is not an integer for any $r \geq 2$ and $1 \leq n \leq r-1$. In particular, for all $r \geq 2$, $S_{r}(n)$ is nonintegral for at least $r-1$ values of $n$. In $2018$, the fourth author gave sufficient conditions for the nonintegrality of $S_{r}(n)$ for all $n \geq 1$, and derived an algorithm to sometimes determine such nonintegrality; along the way he proved that $S_{r}(n)$ is nonintegral for $r \in \{7,8,9,10\}$ and for all $n \geq 1$. By improving this algorithm we prove the conjecture for $r\le 22$. Our principal result is that $S_r(n)$ is usually nonintegral in that the upper asymptotic density of the set of integers $n$ with $S_r(n)$ integral decays faster than any fixed power of $r^{-1}$ as $r$ grows.

math.NT↗

arXiv2019

On members of Lucas sequences which are products of factorials

Here, we show that if $\{U_n\}_{n\ge 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=m_1!m_2!\cdots m_k!$ with $1<m_1\le m_2\le \cdots\le m_k$ satisfies $n<3\times 10^5$. We also give better bounds in case the roots of the Lucas sequence are real.

math.NT↗

arXiv2019

On the Galois group of Generalised Laguerre polynomials II

For real number $α,$ Generalised Laguerre Polynomials (GLP) is a family of polynomials defined by \begin{align*} L_n^{(α)}(x)=(-1)^n\displaystyle\sum_{j=0}^{n}\binom{n+α}{n-j}\frac{(-x)^j}{j!}. \end{align*}These orthogonal polynomials are extensively studied in Numerical Analysis and Mathematical Physics. In 1926, Schur initiated the study of algebraic properties of these polynomials. We consider the Galois group of Generalised Laguerre Polynomials $ L_n^{(\frac{1}{2}+u)}(x^2)$ when $u$ is a negative integer.

math.NT↗

arXiv2019

Irreducibility of extensions of Laguerre Polynomials

For integers $a_0,a_1,\ldots,a_n$ with $|a_0a_n|=1$ and either $α=u$ with $1\leq u \leq 50$ or $α=u+ \frac{1}{2}$ with $1 \leq u \leq 45$, we prove that $ψ_n^{(α)}(x;a_0,a_1,\cdots,a_n)$ is irreducible except for an explicit finite set of pairs $(u,n)$. Furthermore all the exceptions other than $n=2^{12},α=89/2$ are necessary. The above result with $0\leqα\leq 10$ is due to Filaseta, Finch and Leidy and with $α\in \{-1/2,1/2\}$ due to Schur.

math.NT↗

arXiv2019

Irreducibility and Galois Groups of Generalized Laguerre Polynomials $L_{n}^{(-1-n-r)}(x)$

We study the algebraic properties of Generalized Laguerre polynomials for negative integral values of a given parameter which is $L_{n}^{(-1-n-r)}(x)= \sum\limits_{j=0}^{n} \binom{n-j+r}{n-j} \frac{x^{j}}{j!}$ for integers $r\geq 0, n\geq 1$. For different values of parameter $r$, this family provides polynomials which are of great interest. Hajir conjectured that for integers $r\geq 0$ and $n\geq 1$, $L_{n}^{(-1-n-r)}(x)$ is an irreducible polynomial whose Galois group contains $A_n$, the alternating group on $n$ symbols. Extending earlier results of Schur, Hajir, Sell, Nair and Shorey, we confirm this conjecture for all $r\leq 60$. We also prove that $L_{n}^{(-1-n-r)}(x)$ is an irreducible polynomial whose Galois group contains $A_n$ whenever $n>e^{r\left(1+\frac{1.2762}{{\rm log } r}\right)}$.

math.NT↗

arXiv2016

Sums of the digits in bases 2 and 3

Let b $\ge$ 2 be an integer and let s b (n) denote the sum of the digits of the representation of an integer n in base b. For sufficiently large N , one has Card{n $\le$ N : |s 3 (n) -- s 2 (n)| $\le$ 0.1457205 log n} \textgreater{} N 0.970359. The proof only uses the separate (or marginal) distributions of the values of s 2 (n) and s 3 (n).

math.NT↗

arXiv2016

Irreducibility of generalized Hermite-Laguerre Polynomials III

For a positive integer $n$ and a real number $α$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(α)}_n(x)=\sum^n_{j=0}\frac{(n+α)(n-1+α)\cdots (j+1+α)(-x)^j}{j!(n-j)!}. \end{align*} These orthogonal polynomials are solutions to Laguerre's Differential Equation which arises in the treatment of the harmonic oscillator in quantum mechanics. Schur studied these Laguerre polynomials for its interesting algebraic properties. He obtained irreducibility results of $L^{(\pm \frac{1}{2})}_n(x)$ and $L^{(\pm \frac{1}{2})}_n(x^2)$ and derived that the Hermite polynomials $H_{2n}(x)$ and $\frac{H_{2n+1}(x)}{x}$ are irreducible for each $n$. In this article, we extend Schur's result by showing that the family of Laguerre polynomials $L^{(q)}_n(x)$ and $L^{(q)}_n(x^d)$ with $q\in \{\pm \frac{1}{3}, \pm \frac{2}{3}, \pm \frac{1}{4}, \pm \frac{3}{4}\}$, where $d$ is the denominator of $q$, are irreducible for every $n$ except when $q=\frac{1}{4}, n=2$ where we give the complete factorization. In fact, we derive it from a more general result.

math.NT↗

arXiv2016

Perfect powers in products of terms of elliptic divisibility sequences

Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots B_{m+(k-1)d}=y^\ell \end{align*} in positive integers $m,d,k,y$ with $\gcd(m,d)=1$ and $k\geq 2$, where $\ell\geq 2$ is a fixed integer and $B=(B_n)_{n=1}^\infty$ is an elliptic divisibility sequence, an important class of non-linear recurrences. We prove that the above equation admits only finitely many solutions. In fact, we present an algorithm to find all possible solutions, provided that the set of $\ell$-th powers in $B$ is given. (Note that this set is known to be finite.) We illustrate our method by an example.

math.NT↗

arXiv2013

Extensions of Schur's irreducibility results

We prove that the generalised Laguerre polynomials $L_{n}^{(α)}(x)$ with $0\le \al\le 50$ are irreducible except for finitely many pairs $(n, \al)$ and that these exceptions are necessary. In fact it follows from a more general statement.

math.NT↗

arXiv2013

Some irreducibility results for truncated binomial expansions

For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of Schubert calculus in Grassmannians. In this paper, the authors prove the irreducibility of $P_{n,k}(x)$ over the field of rational numbers when $2\leqslant 2k \leqslant n<(k+1)^3$.

math.NT↗