中文
相关论文

相关论文: Another generalization of Mason's ABC-theorem

200 篇论文

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

经典分析与常微分方程 · 数学 2018-09-21 Tamás Erdélyi

Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares…

Let $n$ be any nonnegative integer and \[ D_n^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}\binom{2k}{k}^{h}{x}^{k} \text{ and } S_{n}^{(h)}(x)=\sum_{k=0}^{n}\binom{n+k}{2k}^{h}C_{k}^{h}{x}^{k} \] be the generalized Delannoy polynomials and…

数论 · 数学 2025-03-18 Lin-Yue Li , Rong-Hua Wang

The main result of the present paper is about the solutions of the functional equation \Eq{*}{ F\Big(\frac{x+y}2\Big)+f_1(x)+f_2(y)=G(g_1(x)+g_2(y)),\qquad x,y\in I, } derived originally, in a natural way, from the invariance problem of…

经典分析与常微分方程 · 数学 2022-04-01 Tibor Kiss

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

概率论 · 数学 2016-05-17 Iddo Ben-Ari , Steven J. Miller

The global existence of bounded solutions to reaction-diffusion systems with fractional diffusion in the whole space $\mathbb R^N$ is investigated. The systems are assumed to preserve the non-negativity of initial data and to dissipate…

偏微分方程分析 · 数学 2025-02-25 Phuoc-Tai Nguyen , Bao Quoc Tang

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

经典分析与常微分方程 · 数学 2025-07-04 T. M. Dunster

The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…

离散数学 · 计算机科学 2007-08-24 Jui-Yi Kao , Jeffrey Shallit , Zhi Xu

Euler--Maclaurin and Poisson analogues of the summations $\sum_{a < n \leq b} \chi(n) f(n)$, $\sum_{a < n \leq b} d(n) f(n)$, $\sum_{a < n \leq b} d(n) \chi (n) f(n)$ have been obtained in a unified manner, where $(\chi (n))$ is a periodic…

数论 · 数学 2007-05-23 Vivek V Rane

We show that under the assumption of a 24-term version of Fermat's Last Theorem, there exists an absolute constant c > 0 such that if S is a set of n > n_0 positive integers satisfying |S.S| < n^(1+c), then the sumset S.S satisfies |S+S| >>…

组合数学 · 数学 2009-04-14 Ernie Croot , Derrick Hart

If $F$ is a polynomial with complex coefficients, leading term $a_N$, and roots $\alpha_1$, ..., $\alpha_N$, then Gon\c{c}alves' inequality states that $\|F\|_2^2$ is bounded below by $\abs{a_N}^2 (\prod_{n=1}^N \max\{1, \abs{\alpha_n}^2\}…

经典分析与常微分方程 · 数学 2007-05-23 Peter Borwein , Michael J. Mossinghoff , Jeffrey D. Vaaler

The celebrated Erd\H{o}s--Kac theorem says, roughly speaking, that the values of additive functions satisfying certain mild hypotheses are normally distributed. In the intervening years, similar normal distribution laws have been shown to…

数论 · 数学 2018-11-13 Greg Martin , Lee Troupe

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

数论 · 数学 2020-06-02 Olli Järviniemi

We give conditions under which the number of solutions of a system of polynomial equations over a finite field F_q of characteristic p is divisible by p. Our setup involves the substitution t_i |-> f_i(t_i) for auxiliary polynomials…

数论 · 数学 2019-08-13 Ioulia N. Baoulina , Anurag Bishnoi , Pete L. Clark

Let $K$ be a totally real number field of odd degree. Let $l \geq 5$ be a prime with $l \nmid [K:\mathbb{Q}]$ and $\gcd(\frac{l-1}{2}, [K:\mathbb{Q}])=1$. We prove that if $2$ is inert in $K$, $l$ is non-Wieferich, i.e., $2^{l-1} \not\equiv…

数论 · 数学 2026-05-21 Satyabrat Sahoo

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

组合数学 · 数学 2016-09-06 Daniel E. Loeb

We classify the polynomials $f(x,y) \in \mathbb R[x,y]$ such that given any finite set $A \subset \mathbb R$ if $|A+A|$ is small, then $|f(A,A)|$ is large. In particular, the following bound holds : $|A+A||f(A,A)| \gtrsim |A|^{5/2}.$ The…

经典分析与常微分方程 · 数学 2009-12-30 Chun-Yen Shen

Let $\gcd(k,j)$ be the greatest common divisor of the integers $k$ and $j$. For any arithmetical function $f$, we establish several asymptotic formulas for weighted averages of gcd-sum functions with weight concerning logarithms, that is…

数论 · 数学 2018-04-06 Isao Kiuchi , Sumaia Saad Eddin

A universality conjecture of Farmer and Rhoades [Trans. Amer. Math. Soc., 357(9):3789--3811, 2005] and Farmer [Adv. Math., 411:Paper No. 108781, 14, 2022] asserts that, under some natural conditions, the roots of an entire function should…

概率论 · 数学 2026-05-22 Andrew Campbell , Sean O'Rourke , David Renfrew

It is well known that for all $n\geq1$ the number $n+ 1$ is a divisor of the central binomial coefficient ${2n\choose n}$. Since the $n$th central binomial coefficient equals the number of lattice paths from $(0,0)$ to $(n,n)$ by unit steps…

组合数学 · 数学 2021-04-13 Matthew Just , Maxwell Schneider