中文
相关论文

相关论文: Waring's Theorem for Binary Powers

200 篇论文

In this note we discuss an analog of the classical Waring problem for C[x_0, x_1,...,x_n]. Namely, we show that a general homogeneous polynomial p \in C[x_0,x_1,...,x_n] of degree divisible by k\ge 2 can be represented as a sum of at most…

代数几何 · 数学 2015-06-03 Ralf Fröberg , Giorgio Ottaviani , Boris Shapiro

Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is…

组合数学 · 数学 2026-05-15 Shuo Li , Yuan Song

In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…

数论 · 数学 2024-01-04 Yuhui Liu

For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…

数论 · 数学 2018-04-12 Romeo Meštrović

We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 25 is the sum of at most three natural numbers whose…

形式语言与自动机理论 · 计算机科学 2018-04-24 Jason Bell , Thomas Finn Lidbetter , Jeffrey Shallit

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

数论 · 数学 2022-12-01 Bartosz Sobolewski , Maciej Ulas

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

数论 · 数学 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

数论 · 数学 2023-06-23 Jörg Brüdern , Olivier Robert

In this paper, we derive a formula for the sums of powers of the first $n$ positive integers, $S_k(n)$, that involves the hyperharmonic numbers and the Stirling numbers of the second kind. Then, using an explicit representation for the…

数论 · 数学 2021-06-15 José L. Cereceda

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

数论 · 数学 2007-05-23 D. R. Heath-Brown , J. -C. Puchta

In combinatorics of words, a concatenation of $k$ consecutive equal blocks is called a power of order $k$. In this paper we take a different point of view and define an anti-power of order $k$ as a concatenation of $k$ consecutive pairwise…

离散数学 · 计算机科学 2018-05-28 Gabriele Fici , Antonio Restivo , Manuel Silva , Luca Q. Zamboni

It is well known that every positive integer N can be written as the sum of non-consecutive powers of the golden ratio. We prove that the non-positive powers, together with the parity of the first positive power, can determine the positive…

数论 · 数学 2023-08-15 Edward Zhu

We determine the Waring ranks of all sextic binary forms with complex coefficients using a Geometric Invariant Theory approach. Using the five basic invariants for sextic binary forms, our results give a rapid method to determine the Waring…

代数几何 · 数学 2022-08-10 Alexandru Dimca , Gabriel Sticlaru

Let $A$ be a finite set of integers. We show that if $k$ is a prime power or a product of two distinct primes then $$|A+k\cdot A|\geq(k+1)|A|-\lceil k(k+2)/4\rceil$$ provided $|A|\geq (k-1)^{2}k!$, where $A+k\cdot A=\{a+kb:\ a,b\in A\}$. We…

组合数学 · 数学 2014-02-21 Shan-Shan Du , Hui-Qin Cao , Zhi-Wei Sun

Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2…

数论 · 数学 2013-10-01 Pantelis A. Damianou , Peter Schumer

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

数论 · 数学 2017-07-31 Angel Kumchev , Huafeng Liu

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

数论 · 数学 2010-05-06 Giedrius Alkauskas

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

数论 · 数学 2010-03-04 Joshua N. Cooper , Dennis Eichhorn , Kevin O'Bryant

For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for…

数论 · 数学 2014-09-10 Diego Marques

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

交换代数 · 数学 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe