中文
相关论文

相关论文: Greatest common divisors for polynomials in almost…

200 篇论文

We present an extension of our GPGCD method, an iterative method for calculating approximate greatest common divisor (GCD) of univariate polynomials, to polynomials with the complex coefficients. For a given pair of polynomials and a…

交换代数 · 数学 2010-07-13 Akira Terui

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

数论 · 数学 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial…

数论 · 数学 2021-03-30 Li Lai

We prove that the complement of a very general pair of hypersurfaces of total degree $2n$ in $\mathbb{P}^n$ is algebraically hyperbolic modulo a proper closed subvariety. This provides evidence towards conjectures of Lang-Vojta and…

代数几何 · 数学 2024-10-02 Kenneth Ascher , Amos Turchet , Wern Yeong

We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite field that are block companion and whose order is the maximum possible in the corresponding general linear group. A special case is proved using some…

组合数学 · 数学 2011-12-21 Sudhir R. Ghorpade , Samrith Ram

We examine the value distributions of coefficients in certain $q$-series related to half Appell sums in higher-level and the first moment of the Garvan's $k$-rank of partitions. We prove that these coefficients equal certain restricted…

数论 · 数学 2025-09-09 Meng-Juan Tian , Nian Hong Zhou

This paper deals with the quantitative Schmidt's subspace theorem and the general from of the second main theorem, which are two correspondence objects in Diophantine approximation theory and Nevanlinna theory. In this paper, we give a new…

数论 · 数学 2022-11-15 Si Duc Quang

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

We study upper bounds for the counting function of common zeros of two meromorphic functions in various contexts. The proofs and results are inspired by recent work involving greatest common divisors in Diophantine approximation, to which…

复变函数 · 数学 2019-03-12 Aaron Levin , Julie Tzu-Yueh Wang

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

数论 · 数学 2019-03-26 Rigoberto Flórez , Robinson A. Higuita , Antara Mukherjee

We obtain bounds on the average size of Bohr sets with coefficients parametrised by polynomials over finite fields and obtain a series of general results and also some sharper results for specific sets which are important for applications…

数论 · 数学 2023-11-01 Riley Baird , Bryce Kerr , Igor Shparlinski

Combining a modular approach to the $abc$ conjecture developed by the second author with the classical method of linear forms in logarithms, we obtain improved unconditional bounds for two classical problems. First, for Szpiro's conjecture…

数论 · 数学 2025-09-09 José Cuevas Barrientos , Hector Pasten

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…

数论 · 数学 2021-02-09 Olli Järviniemi

We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of…

数论 · 数学 2010-11-02 George E. Andrews , Simon CF Rose

Silverman proved the analogue of Zsigmondy's Theorem for elliptic divisibility sequences. For elliptic curves in global minimal form, it seems likely this result is true in a uniform manner. We present such a result for certain infinite…

数论 · 数学 2007-05-23 Graham Everest , Gerard Mclaren , Tom Ward

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

经典分析与常微分方程 · 数学 2014-06-17 D. Babusci , G. Dattoli , K. Górska , K. A. Penson

Given a positive integer $n$, the small divisors of $n$ are defined as the positive divisors that do not exceed $\sqrt{n}.$ Ianucci previously classified all $n$ for which the small divisors of $n$ form an arithmetic progression. In this…

数论 · 数学 2021-08-31 A. Anas Chentouf

In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…

数论 · 数学 2020-09-02 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…

符号计算 · 计算机科学 2017-05-02 Johannes Middeke , Carsten Schneider

The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…

代数几何 · 数学 2007-05-23 Alexei G. Gorinov