We observe that the classical Faulhaber's theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression $a+b, a+2b, ..., a+nb$ is a polynomial in $na+n(n+1)b/2$. While this assertion can be deduced from the original Fauhalber's theorem, we give an alternative formula in terms of the Bernoulli polynomials. Moreover, by utilizing the central factorial numbers as in the approach of Knuth, we derive formulas for $r$-fold sums of powers without resorting to the notion of $r$-reflexive functions. We also provide formulas for the $r$-fold alternating sums of powers in terms of Euler polynomials.
Recently, Guo and Zeng discovered q-analogues of Faulhaber's formulas for the sums of powers. They left it as an open problem to extend the combinatorial interpretation of Faulhaber's formulas as given by Gessel and Viennot to the q case. In this note we will provide such an interpretation.
Let $$ S_{m,n}(q):=\sum_{k=1}^{n}\frac{1-q^{2k}}{1-q^2} (\frac{1-q^k}{1-q})^{m-1}q^{\frac{m+1}{2}(n-k)}. $$ Generalizing the formulas of Warnaar and Schlosser, we prove that there exist polynomials $P_{m,k}(q)\in\mathbb{Z}[q]$ such that $$ S_{2m+1,n}(q) =\sum_{k=0}^{m}(-1)^kP_{m,k}(q) \frac{(1-q^n)^{m+1-k}(1-q^{n+1})^{m+1-k}q^{kn}} {(1-q^2)(1-q)^{2m-3k}\prod_{i=0}^{k}(1-q^{m+1-i})}, $$ and solve a problem raised by Schlosser. We also show that there is a similar formula for the following $q$-analogue of alternating sums of powers: $$ T_{m,n}(q):=\sum_{k=1}^{n}(-1)^{n-k} (\frac{1-q^k}{1-q})^{m}…
Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salie's coefficients for the alternating sums of powers. In this paper, we show that these are polynomials with symmetric, nonnegative integral coefficients by refining Gessel-Viennot's combinatorial interpretations.
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and $n$.
First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p^2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p-1)! modulo p^3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers modulo p^3, thus improving Glaisher and Sun's own results fr…
Extending Eulerian polynomials and Faulhaber's formula 1, we study several combi-natorial aspects of harmonic sums and polylogarithms at non-positive multi-indices as well as their structure. Our techniques are based on the combinatorics of non-commutative generating series in the shuffle Hopf algebras giving a global process to renormalize the divergent polyzetas at non-positive multi-indices.
Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series
The George Washington University（乔治华盛顿大学）；Lehman College of the City University of New York（纽约市立大学莱曼学院）；Icahn School of Medicine at Mount Sinai（西奈山伊坎医学院）；Medgar Evers College of the City University of New York（纽约市立大学梅加尔埃弗斯学院）
This note provides a Lefschetz theorem for Minkowski sums of polytopes, and conclude lower bound theorems for Minkowski sums of polytopes. It is written as an appendix to arXiv:1405.7368, so notation and references follow that paper.
A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper (i.e. collision-free) generalized arithmetic progressions, in both torsion-free and torsion settings. We also obtain a similar characterization of iterated sumsets in arbitrary abelian groups in terms of progressions, thus strengthening and extending recent results of Szemerédi and Vu.
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
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 a sequence by $a_k$, we obtain a general formula that determines the congruence class, modulo $p$, of the indefinite sum $\sum_{k=0}^{rp -1} a_k$, for {\it any} prime $p$, and any positive integer $r$, as a linear combination of sequences that satisfy linear recurrence (alias difference) equations with constant coefficients. This enables us (or rather, our c…
We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums. We also derive new identities for Bell polynomials.
We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along the way we prove a monochromatic products of sums theorem that extends Hindman's theorem and a colorful variant of this result that holds in any 'balanced' coloring.
We establish a correspondence between inverse sumset theorems (which can be viewed as classifications of approximate (abelian) groups) and inverse theorems for the Gowers norms (which can be viewed as classifications of approximate polynomials). In particular, we show that the inverse sumset theorems of Freiman type are equivalent to the known inverse results for the Gowers U^3 norms, and moreover that the conjectured polynomial strengthening of the former is also equivalent to the polynomial strengthening of the latter. We establish this equivalence in two model settings, namely that of the f…
We present a compact formula computing rational trigonometric sums. E. Verlinde's expression for the dimension of conformal blocks in WZW theory is an example of such a sum. As an application, we show that a formula of Bismut and Labourie for the Riemann-Roch numbers of moduli spaces of flat connections on a Riemann surface coincides with Verlinde's expression.
A remarkable theorem due to Khovanskii asserts that for any finite subset $A$ of an abelian group, the cardinality of the $h$-fold sumset $hA$ grows like a polynomial for all sufficiently large $h$. Currently, neither the polynomial nor what sufficiently large means are understood. In this paper we obtain an effective version of Khovanskii's theorem for any $A \subset \mathbb{Z}^d$ whose convex hull is a simplex; previously, such results were only available for $d=1$. Our approach gives information about not just the cardinality of $hA$, but also its structure, and we prove two effective theor…
We show that if $P$ is a lattice polytope in the nonnegative orthant of $\R^k$ and $χ$ is a coloring of the lattice points in the orthant such that the color $χ(a+b)$ depends only on the colors $χ(a)$ and $χ(b)$, then the number of colors of the lattice points in the dilation $nP$ of $P$ is for large $n$ given by a polynomial (or, for rational $P$, by a quasipolynomial). This unifies a classical result of Ehrhart and Macdonald on lattice points in polytopes and a result of Khovanski\uı on sumsets in semigroups. We also prove a strengthening of multivariate generalizations of Khovanski\uı's the…
We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's construction, this bound is of the right shape: the exponent 1/7 cannot be replaced by any constant larger than 1/2. We also establish a related result, which says that sumsets A+A+A contain long arithmetic progressions if A is a subset of {1,...,N}, or high-dimensional subspaces if A is a subset of a vector space over a finite field, even if A has density of …
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| >> n^2. In other words, we prove a weak form of the Erdos-Szemeredi sum-product conjecture, conditional on an extension of Fermat's Last Theorem. Unconditionally, we prove this theorem for when S is a set of n monic polynomials. We also prove an analogue of a theorem of Bourgain and Chang for the ring C[x].
Sums of the form $\sum_{N_m=q}^{n}{\cdots \sum_{N_1=q}^{N_2}{a_{(m);N_m}\cdots a_{(1);N_1}}}$ where the $a_{(k);N_k}$'s are same or distinct sequences appear quite often in mathematics. We will refer to them as recurrent sums. In this paper, we introduce a variety of formulas to help manipulate and work with this type of sums. We begin by developing variation formulas that allow the variation of a recurrent sum of order $m$ to be expressed in terms of lower order recurrent sums. We then proceed to derive theorems (which we will call inversion formulas) which show how to interchange the order o…
The aim of the dissertation is threefold: the first two parts are devoted to explore the Fourth Moment Theorem and universality properties for homogeneous sums, while the last part approaches the classical theory of orthogonal polynomials via the invariant theory of binary forms. Specifically, Part I deals with the Lindberg method of influence functions in free probability spaces. By providing a general multidimensional invariance principle for homogeneous sums in freely independent variables, a class of universal laws for semicircular and free Poisson approximations will be derived that satis…
In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of equality. We similarly give a (tight) upper bound theorem for mixed faces of Minkowski sums. This has a wide range of applications and generalizes the classical the Upper Bound Theorems of McMullen and Stanley. Our main tool is relative Stanley--Reisner theory, a powerful generalization of the algebraic theory of simplicial complexes inaugurated by Hochster, Reis…
Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Viète illustrated that the relation linking the roots and coefficients of a polynomial had this form. In more recent years, such sums have become increasingly used with a diversity of applications. In this paper, we develop formulae to help with manipulating such sums (which we will refer to as multiple sums). We develop variation formulae that express the variation of multiple sums in terms of lower order multiple sums. Additionally, we derive a set of par…
In this paper we study multi-parameter projection theorems for fractal sets. With the help of these estimates, we recover results about the size of $A \cdot A+...+A \cdot A$, where $A$ is a subset of the real line of a given Hausdorff dimension, $A+A=\{a+a': a,a' \in A \}$ and $A \cdot A=\{a \cdot a': a,a' \in A\}$. We also use projection results and inductive arguments to show that if a Hausdorff dimension of a subset of ${\Bbb R}^d$ is sufficiently large, then the ${k+1 \choose 2}$-dimensional Lebesgue measure of the set of $k$-simplexes determined by this set is positive. The sharpness of t…
