相关论文: Sums of Consecutive Integers

We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…

This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…

A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…

Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

We classify decompositions of simple special finite-dimensional Jordan superalgebras over an algebraically closed field of characteristic zero into the sum of two proper simple subsuperalgebras.

A supersequence over a finite set is a sequence that contains as subsequence all permutations of the set. This paper defines an infinite array of methods to create supersequences of decreasing lengths. This yields the shortest known…

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when…

In a prime number decomposition of integers in a given set, the occurrence frequencies of prime numbers are shown to satisfy a general forms of Zipf's law.

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

The Collatz sequence for a given natural number $N$ is generated by repeatedly applying the map $N$ $\rightarrow$ $3N+1$ if $N$ is odd and $N$ $\rightarrow$ $N/2$ if $N$ is even. One elusive open problem in Mathematics is whether all such…

Let $s(n)$ denote the number of ones in the binary expansion of the nonnegative integer $n$. How does $s$ behave under addition of a constant $t$? In order to study the differences \[s(n+t)-s(n),\] for all $n\ge0$, we consider the…

Among three natural numbers there is always one which is larger than or equal to the Nim sum of the remaining two numbers. This amazing fact has many applications.

A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…

We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.

In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

We developpe a direct sum decomposition for n-dual spaces.