中文
相关论文

相关论文: Regular sequences of power sums and complete symme…

200 篇论文

The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…

历史与综述 · 数学 2018-01-24 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

The power sum $1^n + 2^n + \cdots + x^n$ has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials in $x$ of degree $n+1$ with rational…

数论 · 数学 2017-10-16 Bernd C. Kellner , Jonathan Sondow

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

数论 · 数学 2021-11-23 Attila Pethő

Knowing a sequence of moments of a given, infinitely supported, distribution we obtain quickly: coefficients of the power series expansion of monic polynomials $\left\{ p_{n}\right\} _{n\geq 0}$ that are orthogonal with respect to this…

偏微分方程分析 · 数学 2014-12-30 Paweł J. Szabłowski

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

数论 · 数学 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $K$ be a field and $f _{n}(X) = (X + 1) ^{n} + (-1) ^{n}(X ^{n} + 1) \in K[X]$, for each $n \in \mathbb N$. This note shows that the polynomials $f _{m}(X)$ and $f _{m'}(X)$ are relatively prime, for some distinct indices $m$ and $m…

环与代数 · 数学 2019-05-01 Ivan D. Chipchakov

Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…

数论 · 数学 2022-06-22 Sergiy Koshkin

An integer-valued polynomial $P(x,y,z)$ is said to be universal (over $\mathbb Z$) if each nonnegative integer can be written as $P(x,y,z)$ with $x,y,z\in\mathbb Z$. In this paper, we mainly introduce a new technique to determine the…

数论 · 数学 2026-02-26 Nasser Abdo Saeed Bulkhali , Zhi-Wei Sun

The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1^n+2^n +\dots +p^n \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n,…

数论 · 数学 2018-01-08 Nicholas J. Newsome , Maria S. Nogin , Adnan H. Sabuwala

In this paper we give an improvement of the degree of the homogeneous linear recurrence with integer coefficients that exponential sums of symmetric Boolean functions satisfy. This improvement is tight. We also compute the asymptotic…

数论 · 数学 2011-01-26 Francis N. Castro , Luis A. Medina

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

数论 · 数学 2023-07-18 Yuji Tsuno

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

数论 · 数学 2023-04-11 José L. Cereceda

In this paper we get two new classes of regular sequences in the polynomial ring over the field of complex numbers.

交换代数 · 数学 2015-03-25 Ri-Xiang Chen

We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^\beta| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom…

组合数学 · 数学 2020-12-07 Christian Krattenthaler , Carsten Schneider

In this paper, we present several explicit formulas of the sums and hyper-sums of the powers of the first (n+1)-terms of a general arithmetic sequence in terms of Stirling numbers and generalized Bernoulli polynomials.

数论 · 数学 2017-12-21 Fouad Bounebirat , Diffalah Laissaoui , Mourad Rahmani

Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…

组合数学 · 数学 2007-05-23 F. Vaccarino

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

综合数学 · 数学 2024-01-10 Atilla Akkuş

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

组合数学 · 数学 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

数论 · 数学 2009-11-06 Roberto Tauraso

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

动力系统 · 数学 2014-09-29 Vitaly Bergelson , Donald Robertson