53,272 research outputs found
Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k
Euler sums (also called Zagier sums) occur within the context of knot theory
and quantum field theory. There are various conjectures related to these sums
whose incompletion is a sign that both the mathematics and physics communities
do not yet completely understand the field. Here, we assemble results for
Euler/Zagier sums (also known as multidimensional zeta/harmonic sums) of
arbitrary depth, including sign alternations. Many of our results were obtained
empirically and are apparently new. By carefully compiling and examining a huge
data base of high precision numerical evaluations, we can claim with some
confidence that certain classes of results are exhaustive. While many proofs
are lacking, we have sketched derivations of all results that have so far been
proved.Comment: 19 pages, LaTe
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square
matrix in which, for a nonnegative integer r, all complete row and column sums
are r, and all partial row and column sums extending from each end of the row
or column are nonnegative. Such matrices correspond to configurations of spin
r/2 statistical mechanical vertex models with domain-wall boundary conditions.
The case r=1 gives standard alternating sign matrices, while the case in which
all matrix entries are nonnegative gives semimagic squares. We show that the
higher spin alternating sign matrices of size n are the integer points of the
r-th dilate of an integral convex polytope of dimension (n-1)^2 whose vertices
are the standard alternating sign matrices of size n. It then follows that, for
fixed n, these matrices are enumerated by an Ehrhart polynomial in r.Comment: 41 pages; v2: minor change
Faulhaber's Theorem on Power Sums
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 is a polynomial in
. 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 -fold sums of powers without
resorting to the notion of -reflexive functions. We also provide formulas
for the -fold alternating sums of powers in terms of Euler polynomials.Comment: 12 pages, revised version, to appear in Discrete Mathematic
- …