English
Related papers

Related papers: Polynomials whose divisors are enumerated by $SL_2…

200 papers

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Number Theory · Mathematics 2023-08-03 Xiang-dong Hou

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

Representation Theory · Mathematics 2024-08-09 Vitaliy Bondarenko , Anatoliy Petravchuk , Maryna Styopochkina

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

Number Theory · Mathematics 2025-10-28 Anton Shakov

Let $f(x) \in \mathbb{Z}[x]$; for each integer $\alpha$ it is interesting to consider the number of iterates $n_{\alpha}$, if possible, needed to satisfy $f^{n_{\alpha}}(\alpha) = \alpha$. The sets $\{\alpha, f(\alpha), \ldots,…

Number Theory · Mathematics 2015-07-15 Andrew Best , Patrick Dynes , Steven J. Miller , Jasmine Powell , Benjamin L. Weiss

Let S=K[x_1,...,x_n] be a polynomial ring. Denote by $p_a$ the power sum symmetric polynomial x_1^a+...+x_n^a. We consider the following two questions: Describe the subsets $A \subset \mathbb{N}$ such that the set of polynomials $p_a$ with…

Commutative Algebra · Mathematics 2013-09-05 Neeraj Kumar

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…

Number Theory · Mathematics 2025-08-20 Ambrose D. Law , Matthew C. Lettington , Karl Michael Schmidt

Let $n \in \mathbb{Z}_{\geqslant 2}$. By $P(n)$ we denote the set of all prime divisors of the integers in the sequence $n, n^2-1, (n^2-1)^2-1, \dots$. We ask whether the set $P(n)$ determines $n$ uniquely under the assumption that $n \neq…

Number Theory · Mathematics 2025-11-12 Ivan Penkov , Michael Stoll

We notice that for $0<d\le 6$ the Poincar\'e polynomial of Simpson moduli space $M_{dm + 1}(\mathbb P_2)$ is divisible by the Poincar\'e polynomial of the projective space $\mathbb P_{3d-1}$. A somehow regular behaviour of the difference of…

Algebraic Geometry · Mathematics 2018-05-08 Oleksandr Iena

Let $G$ denote a compact monothetic group, and let $$\rho (x) = \alpha_k x^k + \ldots + \alpha_1 x + \alpha_0,$$ where $\alpha_0, \ldots , \alpha_k$ are elements of $G$ one of which is a generator of $G$. Let $(p_n)_{n\geq 1}$ denote the…

Number Theory · Mathematics 2020-01-29 Jean-Louis Verger-Gaugry , Jaroslav Hancl , Radhakrishnan Nair

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Mélou , Arnaud Jehanne

For a polynomial $f(x)\in \mathbb Z[x]$ we study an analogue of Jacobsthal function, defined by the formula \[ j_f(N)=\max_{m}\{\text{For some } x\in \mathbb N \text{ the inequality } (x+f(i),N)>1 \text{ holds for all }i\leq m\}. \] We…

Number Theory · Mathematics 2023-12-05 Alexander Kalmynin , Sergei Konyagin

For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a…

Number Theory · Mathematics 2021-09-14 Carlo Sanna

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

A polynomial has saturated Newton polytope (SNP) if every lattice point of the convex hull of its exponent vectors corresponds to a monomial. We compile instances of SNP in algebraic combinatorics (some with proofs, others conjecturally):…

Combinatorics · Mathematics 2019-12-03 Cara Monical , Neriman Tokcan , Alexander Yong

We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…

Complex Variables · Mathematics 2021-12-07 Michel Waldschmidt

The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…

Mathematical Physics · Physics 2017-05-02 L. Alarie-Vézina , L. Lapointe , P. Mathieu

Let $K$ be a field and $f _{n}(X) = (X + 1) ^{n} + (-1) ^{n}(X ^{n} + 1) \in K[X]$, for each $n \in \mathbb N$. This note shows that the polynomials $f _{m}(X)$ and $f _{m'}(X)$ are relatively prime, for some distinct indices $m$ and $m…

Rings and Algebras · Mathematics 2019-05-01 Ivan D. Chipchakov

Polynomial functions $f : \mathbb{N}_+ \longrightarrow \mathbb{N}_+$ are studied for which sums of arbitrary length $f (1) + f (2) + f (3) + >... + f (n)$, with $n \in \mathbb{N}_+$, can be expressed by polynomial functions $g :…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger