Elementary Proofs of Identities for Schur Functions and Plane Partitions

We use elementary methods to prove formulas that represent sums of restricted classes of Schur functions as ratios of determinants. This includes recent formulas for sums over bounded partitions with even parts and sums over bounded partitions whose conjugates have only even parts. All of these formulas imply plane partition generating functions.     

Closed form expressions for some series over certain trigonometric integrals

The series (3) and (4), where T(x) denotes trigonometric integrals (2), are represented as series in terms of Riemann zeta and related functions using the sums of the series (5) and (6), whose terms involve one trigonometric function. These series can be brought in closed form in some cases, where closed form means that the series are represented by finite sums of certain integrals. By specifying the function φ(y) appearing in trigonometric integrals (2) we obtain new series for some special types of functions as well as known results.     

Recursions associated to trapezoid,symmetric and rotation symmetric functions over Galois fields

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of some rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of ${\mathbb{F}}_2$, an elementary method is used to obtain explicit recurrences for exponential sums of some of these functions. The concept of trapezoid Boolean function is also introduced and it is showed that the linear recurrences that exponential sums of trapezoid Boolean functions satisfy are the same as the ones satisfied by exponential sums of the corresponding rotations symmetric Boolean functions. Finally, it is proved that exponential sums of trapezoid and symmetric polynomials also satisfy linear recurrences with integer coefficients over any Galois field ${\mathbb{F}}_q$. Moreover, the Discrete Fourier Transform matrix and some Complex Hadamard matrices appear as examples in some of our explicit formulas of these recurrences.     

On Small Values of Semi-Additive Functions

The purpose of this paper is to investigate small values of semi-additive functions and its application to find an upper bound of concentration functions for the sums of independent identically distributed random variables.     

Weighted trigonometric sums over a half-period

We derive formulas for evaluating weighted sums of trigonometric functions over evenly-spaced angles in the first quadrant. These results generalize those of a previous paper, where we considered trigonometric sums weighted by real, primitive, non-principal Dirichlet characters.     

Values of zeta functions at negative integers, Dedekind sums and toric geometry

We study relations among special values of zeta functions, invariants of toric varieties, and generalized Dedekind sums. In particular, we use invariants arising in the Todd class of a toric variety to give a new explicit formula for the values of the zeta function of a real quadratic field at nonpositive integers. We also express these invariants in terms of the generalized Dedekind sums studied previously by several authors. The paper includes conceptual proofs of these relations and explicit computations of the various zeta values and Dedekind sums involved.

     

On some definite integrals and infinite sums containing products of special functions

A method is proposed for evaluation of some definite integrals and infinite sums containing products of Bessel, Struve and other special functions.     

Global solutions of mathematical programs with intrinsically concave functions

An implicit enumeration technique for solving a certain type of nonconvex program is described. The method can be used for solving signomial programs with constraint functions defined by sums of quasiconcave functions and other types of programs with constraint functions called intrinsically concave functions. A signomial-type example is solved by this method. The algorithm is described together with a convergence proof. No computational results are available at present.     

General power sums of integers that are,and are not,represented in the two-element Frobenius problem

A general method is presented for evaluating the sums of mth powers of the integers that can, and that cannot, be represented in the two-element Frobenius problem. Generating functions are introduced and used for that purpose. Explicit formulas for the desired sums are obtained and specific examples are discussed.     

A generating function for sums of multiple zeta values and its applications

A generating function for specified sums of multiple zeta values is defined and a differential equation that characterizes this function is given. As applications, some relations for multiple zeta values over the field of rational numbers are discussed.

     

Summation of Some Trigonometric and Schlömilch Series

In this paper we consider trigonometric series in terms of the Riemann zeta function and related functions of reciprocal powers. The obtained closed form formulas we apply to the evaluation of the Riemann zeta function and related functions of reciprocal powers. One can establish recursive relations for them and relations between any two of those functions. These closed formulas enable us also to find sums of some Schlömilch series. We give an example which shows how the convergence of a trigonometric series can be accelerated by applying Krylov's method and our formula (7).     

Sums of fractions and finiteness of monodromy

We solve an elementary number theory problem on sums of fractional parts. We apply our result to deduce the finiteness of the image of certain monodromy representations.     

On certain character sums over p ‐adic rings and their L ‐functions

In this paper we present a new method for evaluating exponential sums associated to a restricted power series in one variable modulo p^l , a power of a prime. We show that for sufficiently large l, these sums can be expressed in terms of Gauss sums. Moreover, we study the associated L ‐functions; we show that they are rational, then we determine their degrees and the weights as Weil numbers of their reciprocal roots and poles. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Elliptic Apostol sums and their reciprocity laws

We introduce an elliptic analogue of the Apostol sums, which we call elliptic Apostol sums. These sums are defined by means of certain elliptic functions with a complex parameter having positive imaginary part. When , these elliptic Apostol sums represent the well-known Apostol generalized Dedekind sums. Also these elliptic Apostol sums are modular forms in the variable . We obtain a reciprocity law for these sums, which gives rise to new relations between certain modular forms (of one variable).

     

超高阶球谐级数式的计算方法

由完全正常化缔合勒让德函数构成的球谐级数式,在接近两极时,超高阶次(如超过2500阶次)缔合勒让德函数值的递推计算,达到极大的数量级(超过10的数千次方),产生下溢,这导致一般递推方法失效.本文就缔合勒让德函数的4种常用递推算法,分别进行改进以增加数值稳定性并延缓下溢.最后对由改进算法获得的勒让德函数,结合Horner求和技术,给出计算超高阶球谐级数部分和式的方法.     

Sums of products of Cauchy numbers

In this paper, we consider a kind of sums involving Cauchy numbers, which have not been studied in the literature. By means of the method of coefficients, we give some properties of the sums. We further derive some recurrence relations and establish a series of identities involving the sums, Stirling numbers, generalized Bernoulli numbers, generalized Euler numbers, Lah numbers, and harmonic numbers. In particular, we generalize some relations between two kinds of Cauchy numbers and some identities for Cauchy numbers and Stirling numbers.     

A mixture-type limit theorem for nonlinear functions of Gaussian sequences

We show that, for a certain class of nonlinear functions of Gaussian sequences, the limiting distribution of normalized sums of the nonlinear function values of a sequence is the convolution of a Gaussian distribution with another non-Gaussian distribution.     

Series expansions for computing Bessel functions of variable order on bounded intervals

Based on a continuity property of the Hadamard product of power series we derive results concerning the rate of convergence of the partial sums of certain polynomial series expansions for Bessel functions. Since these partial sums are easily computable by recursion and since cancellation problems are considerably reduced compared to the corresponding Taylor sections, the expansions may be attractive for numerical purposes. A similar method yields results on series expansions for confluent hypergeometric functions. This revised version was published online in June 2006 with corrections to the Cover Date.     

Binary terms in polynomial representations of Boolean functions

Polynomial representations of Boolean functions by binary terms are considered. The construction of terms involves variables and residual functions. Special cases of such representations are the decomposition of a function with respect to variables, Zhegalkin polynomials, and representations of functions as sums of conjunctions of residual functions.     

A modified Newton's method for minimizing factorable functions

Many functions of several variables used in nonlinear programming are factorable, i.e., complicated compositions of transformed sums and products of functions of a single variable. The Hessian matrices of twice-differentiable factorable functions can easily be expressed as sums of outer products (dyads) of vectors. A modified Newton's method for minimizing unconstrained factorable functions which exploits this special form of the Hessian is developed. Computational experience with the method is presented.This material is based upon work supported by the National Science Foundation under Grant No. MCS-79-04106.The author would like to thank Professor G. P. McCormick, George Washington University, for several enlightening discussions on factorable programming and for his valuable comments which improved an earlier version of this paper.