中文
相关论文

相关论文: The probability that a random monic p-adic polynom…

200 篇论文

Let f(x) be a polynomial with integer coefficients, let n be a positive integer, and let p be an odd prime. Then the mapping x-->f(x) sends Z/p^n into Z/p^n. We study the topological structure of this mapping.

数论 · 数学 2007-05-23 David L. desJardins , Michael E. Zieve

The article describes prime intervals into the prime factorization of the middle binomial coefficient. Prime factors and prime powers are distributed in layers. Each layer consists of non-repeated prime numbers which are chosen (not…

组合数学 · 数学 2020-03-04 Gennady Eremin

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

代数几何 · 数学 2024-06-04 Kaloyan Slavov

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

数论 · 数学 2007-09-12 Alexei Panchishkin

In this article, we give explicit formulas for the $p$-adic valuations of the Fibonomial coefficients ${p^a n \choose n}_F$ for all primes $p$ and positive integers $a$ and $n$. This is a continuation from our previous article extending…

数论 · 数学 2019-08-06 Phakhinkon Phunphayap , Prapanpong Pongsriiam

We classify, up to isomorphism, the $\mathbb{Z}_pG$-modules of rank $1$ (i.e., the quotients of $\mathbb{Z}_pG$) for $G$ cyclic of order $p$, where $\mathbb{Z}_p$ is the ring of $p$-adic integers. This allows us in particular to determine…

群论 · 数学 2025-04-15 Maria Guedri , Yassine Guerboussa

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

概率论 · 数学 2018-05-23 Sean O'Rourke , Philip Matchett Wood

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

We investigate the variation in the total number of points in a random $p\times p$ square in $\mathbb{Z}^2$ where the $p$-adic valuation of a given polynomial in two variables is precisely $1$. We establish that this quantity follows a…

数论 · 数学 2026-02-24 Krishnan Rajkumar , Shubham

Let $p_{1}<p_2<... <p_{\nu}<...$ be the sequence of prime numbers and let $m$ be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form…

数论 · 数学 2013-11-28 Hans Vernaeve , Jasson Vindas , Andreas Weiermann

For a given monic integral polynomial $f(x)$ of degree $n$, we define local roots $r_i$ of $f(x)$ for a completely decomposable prime $p$ by $r_i \in \mathbb{Z}$, $f(r_i) \equiv 0 \bmod p$ and $0 \le r_1 \le r_2 \le \dots \le r_n < p$. With…

数论 · 数学 2024-09-05 Yoshiyuki Kitaoka

We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are…

数论 · 数学 2015-07-24 Xavier Caruso

Let R be a ring and let B be a commutative ring. Let p be a homogeneous multiplicative polynomial law of degree n from R to B. We show that p is essentially a determinant, in the sense that p is obtained from a determinant by left and right…

环与代数 · 数学 2007-05-23 Francesco Vaccarino

We study the repartition of the roots of a random p-adic polynomial in an algebraic closure of Qp.We prove that the mean number of roots generating a fixed finite extension K of Qp depends mostly on the discriminant of K, an extension…

数论 · 数学 2021-10-11 Xavier Caruso

We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…

计算复杂性 · 计算机科学 2022-10-14 Alberto Dennunzio , Enrico Formenti , Luciano Margara

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

The generic monic polynomial of sixth degree features 6 a priori arbitrary coefficients. We show that if these 6 coefficients are appropriately defined in two different ways|in terms of 5 arbitrary parameters, then the 6 roots of the…

动力系统 · 数学 2021-04-08 Francesco Calogero , Farrin Payandeh

We study for each $n$ a one-parameter family of complex-valued measures on the symmetric group $S_n$, which interpolate the probability of a monic, degree $n$, square-free polynomial in $\mathbb{F}_q[x]$ having a given factorization type.…

表示论 · 数学 2017-08-07 Trevor Hyde , Jeffrey C. Lagarias

We show that the Galois group of a random monic polynomial %of degree $d>12$ with integer coefficients between $-N$ and $N$ is NOT $S_d$ with probability $\ll \frac{\log^{\Omega(d)}N}{N}.$ Conditionally on NOTbeing the full symmetric group,…

数论 · 数学 2015-11-23 Igor Rivin

We study the simultaneous zeros of a random family of $d$ polynomials in $d$ variables over the $p$-adic numbers. For a family of natural models, we obtain an explicit constant for the expected number of zeros that lie in the $d$-fold…

概率论 · 数学 2007-05-23 Steven N. Evans