中文
相关论文

相关论文: An extension of a second irreducibility theorem of…

200 篇论文

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

数论 · 数学 2025-10-16 Joachim König

Let $f$ and $g$ be Weierstrass polynomials with coefficients in the ring of formal power series over an algebraically closed field of characteristic zero. Assume that $f$ is irreducible and quasi-ordinary. We show that if degree of $g$ is…

代数几何 · 数学 2018-04-17 Janusz Gwoździewicz , Beata Hejmej

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

数论 · 数学 2025-01-07 Alexei Entin , Sean Landsberg

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

数论 · 数学 2021-10-11 Paolo Minelli

A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…

数论 · 数学 2022-02-17 Rigoberto Florez , J. C. Saunders

We give a classification of all irreducible completely pointed $U_q(\mathfrak{sl}_{n+1})$ modules over a characteristic zero field in which $q$ is not a root of unity. This generalizes the classification result of Benkart, Britten and…

表示论 · 数学 2020-06-09 V. Futorny , J. Hartwig , E. Wilson

C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…

历史与综述 · 数学 2011-03-17 Sunil K. Chebolu , Jan Minac

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

数论 · 数学 2007-05-23 Anca Iuliana Bonciocat , Alexandru Zaharescu

We prove that a random bivariate polynomial with plus minus 1 coefficients is irreducible with high probability.

数论 · 数学 2016-04-21 Lior Bary-Soroker , Gady Kozma

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

计算复杂性 · 计算机科学 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

For any positive integers $n \ge 3$ and $r \ge 1$, we prove that the number of monic irreducible polynomials of degree $n$ over $\mathbb{F}_{2^r}$ in which the coefficients of $T^{n-1}$, $T^{n-2}$ and $T^{n-3}$ are prescribed has period…

数论 · 数学 2019-11-26 Ofir Gorodetsky

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

逻辑 · 数学 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

We study the algebraic properties of Generalized Laguerre Polynomials for negative integral values of the parameter. For integers $r,n\geq 0$, we conjecture that $L_n^{(-1-n-r)}(x) = \sum_{j=0}^n \binom{n-j+r}{n-j}x^j/j!$ is a…

数论 · 数学 2007-05-23 Farshid Hajir

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

Let $F: C^n \rightarrow C^m$ be a polynomial map with $degF=d \geq 2$. We prove that $F$ is invertible if $m = n$ and $\sum^{d-1}_{i=1} JF(\alpha_i)$ is invertible for all $i$, which is trivially the case for invertible quadratic maps. More…

交换代数 · 数学 2013-10-24 Hongbo Guo , Michiel de Bondt , Xiankun Du , Xiaosong Sun

For an element $a$ of an integral domain D under an equivalence relation \tau, the \tau-factorization of a is defined as \lambda a_1 a_2... a_k, where \lambda is a unit in D and a_i \tau a_j for all i, j. An irreducible element has no…

数论 · 数学 2012-10-11 James Lanterman

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

数论 · 数学 2016-02-02 Abel Castillo , Rainer Dietmann

Let A be a finite dimensional central division algebra over a local non-archimedean field F. Fix any parabolic subgroup P of GL(n,A) and a Levi factor M of P. Let \pi be an irreducible unitary representation of M and \phi (not necessarily…

表示论 · 数学 2013-06-18 Marko Tadic

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

组合数学 · 数学 2025-03-28 Ming Yean Lim
‹ 上一页 1 8 9 10 下一页 ›