We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
In pervasive computing environments, personal information is expressed in digital forms to a great extent. Daily activities and personal preferences may be easily associated with p...
Abstract. Using the finite difference calculus and differentiation, we obtain several new identities for Bernoulli and Euler polynomials; some extend Miki's and Matiyasevich...
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...