中文
相关论文

相关论文: On Certain Probabilistic Properties of Polynomials…

200 篇论文

Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers splits over Z_p into linear factors.

数论 · 数学 2007-05-23 Joe Buhler , Daniel Goldstein , David Moews , Joel Rosenberg

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

交换代数 · 数学 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

数论 · 数学 2021-12-22 Roy Shmueli

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

数论 · 数学 2022-04-08 Roy Shmueli

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree…

数论 · 数学 2022-10-04 Artūras Dubickas , Min Sha

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

交换代数 · 数学 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

数论 · 数学 2015-01-13 Artūras Dubickas , Min Sha

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

环与代数 · 数学 2024-03-19 Alina G. Goutor , Sergey V. Tikhonov

Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…

交换代数 · 数学 2026-03-05 Kimiko Hasegawa , Rin Sugiyama

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

综合数学 · 数学 2019-12-30 Duggirala Meher Krishna , Duggirala Ravi

In this paper I consider all possible properties from commutative algebra for polynomial composites and monoid domains. The aim is full characterization of these structures. I start with the examination of group, ring, modules properties,…

交换代数 · 数学 2020-06-29 Lukasz Matysiak

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

环与代数 · 数学 2025-09-05 Alina G. Goutor , Sergey V. Tikhonov

In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…

概率论 · 数学 2022-04-29 Grigory Terlov

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

数论 · 数学 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

We attempt to quantify the exact proportion of monic $p$-adic polynomials of degree $n$ which are irreducible. We find an exact answer to this when $n$ is prime and $p \neq n$, and also when $n = 4$ and $p \neq 2$. Our answers are rational…

数论 · 数学 2025-03-19 Isaac Rajagopal

A polynomial of degree $\ge 2$ with coefficients in the ring of $p$-adic numbers $\mathbb{Z}_p$ is studied as a dynamical system on $\mathbb{Z}_p$. It is proved that the dynamical behavior of such a system is totally described by its…

动力系统 · 数学 2010-11-01 Fan Ai-Hua , Lingmin Liao

This note presents some equalities in law for $Z_N:=\det(\Id-G)$, where $G$ is an element of a subgroup of the set of unitary matrices of size $N$, endowed with its unique probability Haar measure. Indeed, under some general conditions,…

概率论 · 数学 2007-06-22 Paul Bourgade , Ashkan Nikeghbali , Alain Rouault

In this paper, we present an isomorphism between the ring of general polynomials over a division ring of degree $p$ over its center $F$ and the group ring of the free monoid with $p^2$ variables. Using this isomorphism, we define the…

环与代数 · 数学 2011-12-07 Adam Chapman

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

数学物理 · 物理学 2017-06-13 Francesco Calogero , Francois Leyvraz
‹ 上一页 1 2 3 10 下一页 ›