Neeraj Sangwan | Searcharxiv

arXiv2022

Discriminant and integral basis of pure nonic fields

Let $K = \Q(θ)$ be an algebraic number field with $θ$ satisfying an irreducible polynomial $x^{9} - a$ over the field $\Q$ of rationals and $\Z_K$ denote the ring of algebraic integers of $K$. In this article, we provide the exact power of each prime which divides the index of the subgroup $\Z[θ]$ in $\Z_K$. Further, we give a $p$-integral basis of $K$ for each prime $p$. These $p$-integral bases lead to a construction of an integral basis of $K$ which is illustrated with examples.

math.NT↗

arXiv2020

On integral basis of pure number fields

Let $K=\mathbb{Q}(\sqrt[n]{a})$ be an extension of degree $n$ of the field $\Q$ of rational numbers, where the integer $a$ is such that for each prime $p$ dividing $n$ either $p\nmid a$ or the highest power of $p$ dividing $a$ is coprime to $p$; this condition is clearly satisfied when $a, n$ are coprime or $a$ is squarefree. The present paper gives explicit construction of an integral basis of $K$ along with applications. This construction of an integral basis of $K$ extends a result proved in [J. Number Theory, {173} (2017), 129-146] regarding periodicity of integral bases of $\mathbb{Q}(\sqrt[n]{a})$ when $a$ is squarefree.

math.NT↗

arXiv2020

On the discriminant of pure number fields

Let $K=\mathbb{Q}(\sqrt[n]{a})$ be an extension of degree $n$ of the field $\Q$ of rational numbers, where the integer $a$ is such that for each prime $p$ dividing $n$ either $p\nmid a$ or the highest power of $p$ dividing $a$ is coprime to $p$; this condition is clearly satisfied when $a, n$ are coprime or $a$ is squarefree. The paper contains an explicit formula for the discriminant of $K$ involving only the prime powers dividing $a,n$.

math.NT↗

arXiv2016

An irreducibility criterion for integer polynomials

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$, $0 \leq k \leq n-1$; or $(ii)$ $|a_n| > |a_{n-1}| + \cdots + |a_{0}|$ with $a_0 \neq 0$. In this paper, it is proved that if $|a_n|$ or $|f(m)|$ is a prime number for some integer $m$ with $|m|\geq 2 $ then the polynomial $f(x)$ is irreducible over $\mathbb{Z}$.

math.AC↗