Com plete p-elli ptic integrals and a com putation formula of $$\ pi _ p$$π p for $$ p=4$$ p=4

We study the q-bracket operator of Bloch and Okounkov, recently examined by Zagier and other authors, when applied to functions defined by two classes of sums over the parts of an integer partition. We derive convolution identities for these functions and link both classes of q-brackets through divisor sums. As a result, we generalize Euler’s classic convolution identity for the partition function and obtain an analogous identity for the totient function. As corollaries, we generalize Stanley’s Theorem on the number of ones in all partitions of n, and provide several new combinatorial results.     

On the combinatorics of plethysm

We construct three (large, reduced) incidence algebras whose semigroups of multiplicative functions, under convolution, are anti-isomorphic, respectively, to the semigroups of what we call partitional, permutational and exponential formal power series without constant term, in infinitely many variables x = (x₁, x₂,…), under plethysm. We compute the Möbius function in each case. These three incidence algebras are the linear duals of incidence bialgebras arising, respectively, from the classes of transversals of partitions (with an order that we define), partitions compatible with permutations (with the usual refinement order), and linear transversals of linear partitions (with the order induced by that on transversals). We define notions of morphisms between partitions, permutations and linear partitions, respectively, whose kernels are defined to be, in each case, transversals, compatible partitions and linear transversals. We introduce, in each case, a pair of sequences of polynomials in x of binomial type, counting morphisms and monomorphisms, and obtain expressions for their connection constants, by summation and Möbius inversion over the corresponding posets of kernels.     

Infimal convolution, c-subdifferentiability, and Fenchel duality in evenly convex optimization

In this paper we deal with strong Fenchel duality for infinite-dimensional optimization problems where both feasible set and objective function are evenly convex. To this aim, via perturbation approach, a conjugation scheme for evenly convex functions, based on generalized convex conjugation, is used. The key is to extend some well-known results from convex analysis, involving the sum of the epigraphs of two conjugate functions, the infimal convolution and the sum formula of ??-subdifferentials for lower semicontinuous convex functions, to this more general framework.     

Triple correlations of Fourier coefficients of cusp forms

We treat an unbalanced shifted convolution sum of Fourier coefficients of cusp forms. As a consequence, we obtain an upper bound for correlation of three Hecke eigenvalues of holomorphic cusp forms \(\sum _{H\le h\le 2H}W\left( \frac{h}{H}\right) \sum _{X\le n\le 2X}\lambda _{1}(n-h)\lambda _{2}(n)\lambda _{3}(n+h)\), which is nontrivial provided that \(H\ge X^{2/3+\varepsilon }\). The result can be viewed as a cuspidal analogue of a recent result of Blomer on triple correlations of divisor functions.     

On the convolution and subordination of convex functions

In this work we present some new results on convolution and subordination in geometric function theory. We prove that the class of convex functions of order α is closed under convolution with a prestarlike function of the same order. Using this, we prove that subordination under the convex function order α is preserved under convolution with a prestarlike function of the same order. Moreover, we find a subordinating factor sequence for the class of convex functions. The work deals with several ideas and techniques used in geometric function theory, contained in the book Convolutions in Geometric Function Theory by Ruscheweyh (1982).     

Weighted Rogers–Ramanujan partitions and Dyson crank

In this paper, we refine a weighted partition identity of Alladi. We write formulas for generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results as well as the different statistics with the crank of a partition. In particular, we prove that the number of partitions into even number of distinct parts whose odd-indexed parts’ sum is n is equal to the number of partitions of n with non-negative crank.     

Restricted <Emphasis Type="Italic">k</Emphasis>-color partitions

We generalize overpartitions to (k, j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems: generating function dissections, modular forms, bijections, and other combinatorial maps. In the process of proving certain congruences, we find results of independent interest on the number of partitions with exactly 2 sizes of part in several arithmetic progressions. We find connections to divisor sums, the Han/Nekrasov–Okounkov hook length formula and a possible approach to finitization, and other topics, suggesting that a rich mine of results is available. We pose several immediate questions and conjectures.     

Extremal functions as divisors for kernels of Toeplitz operators

In this paper, an extremal function of a Banach space of analytic functions in the unit disk (not all functions vanishing at 0) is a function solving the extremal problem for functions f of norm 1. We study extremal functions of kernels of Toeplitz operators on Hardy spaces H^p, 1<p<∞. Such kernels are special cases of so-called nearly invariant subspaces with respect to the backward shift, for which Hitt proved that when p=2, extremal functions act as isometric divisors. We show that the extremal function is still a contractive divisor when p<2 and an expansive divisor when p>2 (modulo p-dependent multiplicative constants). We give examples showing that the extremal function may fail to be a contractive divisor when p>2 and also fail to be an expansive divisor when p<2. We discuss to what extent these results characterize the Toeplitz operators via invariant subspaces for the backward shift.     

Congruences for arithmetic functions

The Ramanujan Journal - Motivated by congruences for partitions, we study congruences for three well known arithmetic functions: the divisor function d(n), the sum-of-divisors function $$\sigma...     

System Representations for the Paley–Wiener Space $$\mathcal {PW}_{\pi }^2$$

In this paper we study the approximation of stable linear time-invariant systems for the Paley–Wiener space \(\mathcal {PW}_{\pi }^2\), i.e., the set of bandlimited functions with finite \(L^2\)-norm, by convolution sums. It is possible to use either, the convolution sum where the time variable is in the argument of the bandlimited impulse response, or the convolution sum where the time variable is in the argument of the function, as an approximation process. In addition to the pointwise and uniform convergence behavior, the convergence behavior in the norm of the considered function space, i.e. the \(L^2\)-norm in our case, is important. While it is well-known that both convolution sums converge uniformly on the whole real axis, the \(L^2\)-norm of the second convolution sum can be divergent for certain functions and systems. We show that the there exist an infinite dimensional closed subspace of functions and an infinite dimensional closed subspace of systems, such that for any pair of function and system from these two sets, we have norm divergence.     

Sphere-separable partitions of multi-parameter elements

We show the optimality of sphere-separable partitions for problems where n vectors in d-dimensional space are to be partitioned into p categories to minimize a cost function which is dependent in the sum of the vectors in each category; the sum of the squares of their Euclidean norms; and the number of elements in each category. We further show that the number of these partitions is polynomial in n. These results broaden the class of partition problems for which an optimal solution is guaranteed within a prescribed set whose size is polynomially bounded in n. Applications of the results are demonstrated through examples.     

Integrals, partitions and MacMahon's Theorem

In two previous papers, the study of partitions with short sequences has been developed both for its intrinsic interest and for a variety of applications. The object of this paper is to extend that study in various ways. First, the relationship of partitions with no consecutive integers to a theorem of MacMahon and mock theta functions is explored independently. Secondly, we derive in a succinct manner a relevant definite integral related to the asymptotic enumeration of partitions with short sequences. Finally, we provide the generating function for partitions with no sequences of length K and part exceeding N.     

Generalizations of two identities of Guo and Yang

In this paper, we provide generalizations of two identities of Guo and Yang [2] for the q-binomial coe?cients. This approach allows us to derive new convolution identities for the complete and elementary symmetric functions. New identities involving q-binomial coe?cients are obtained as very special cases of these results. A new relationship between restricted partitions and restricted partitions into parts of two kinds is derived in this context.     

Enumeration of arrays of a given size

Enumeration of arrays whose row and column sums are specified have been studied by a number of people. It has been determined that the function that enumerates square arrays of dimension n, whose rows and columns sum to a fixed non-negative integer r, is a polynomial in r of degree (n ? 1)².In this paper we consider rectangular arrays whose rows sum to a fixed non-negative integer r and whose columns sum to a fixed non-negative integer s, determined by ns = mr. in particular, we show that the functions which enumerate 2 × n and 3 × n arrays with fixed row sums $\text{nr}\text{(2, n)}$ and $\text{nr}\text{(3, n)}$, where the symbol (a, b) denotes the greatest common divisor of a and b, and fixed column sums, are polynomials in r of degrees (n ? 1) and 2(n ? 1) respectively. We have found simple formulas to evaluate these polynomials for negative values, - r, and we show that for certain small negative integers our polynomials will always be zero. We also considered the generating functions of these polynomials and show that they are rational functions of degrees less than zero, whose denominators are of the forms (1 ? y)ⁿ and (1 ? y)²ⁿ?1 respectively and whose numerators are polynomials in y whose coefficients satisfy certain properties. In the last section we list the actual polynomials and generating functions in the 2 × n and 3 × n cases for small specific values of n.     

GW invariants relative to normal crossing divisors

In this paper we introduce a notion of symplectic normal crossing divisor V and define the GW invariant of a symplectic manifold X relative to such a divisor. Our definition includes normal crossing divisors from algebraic geometry. The invariants we define in this paper are key ingredients in symplectic sum type formulas for GW invariants, and extend those defined in our previous joint work with T.H. Parker [16], which covered the case V   was smooth. The main step is the construction of a compact moduli space of relatively stable maps into the pair (X,V)$(X,V)$ in the case V is a symplectic normal crossing divisor in X.     

Subclasses of bi-univalent functions defined by convolution

In this paper, we introduced two new subclasses of the function class Σ of bi-univalent functions analytic in the open unit disc defined by convolution. Furthermore, we find estimates on the coefficients ∣a₂∣ and ∣a₃∣ for functions in these new subclasses.     

A weighted sum over generalized Tesler matrices

We generalize previous definitions of Tesler matrices to allow negative matrix entries and negative hook sums. Our main result is an algebraic interpretation of a certain weighted sum over these matrices, which we call the Tesler function. Our interpretation uses a new class of symmetric function specializations which are defined by their values on Macdonald polynomials. As a result of this interpretation, we obtain a Tesler function expression for the Hall inner product \(\langle \Delta _f e_n, p_{1^{n}}\rangle \), where \(\Delta _f\) is the delta operator introduced by Bergeron, Garsia, Haiman, and Tesler. We also provide simple formulas for various special cases of Tesler functions which involve q, t-binomial coefficients, ordered set partitions, and parking functions. These formulas prove two cases of the recent Delta Conjecture posed by Haglund, Remmel, and the author.     

Punctured plane partitions and the q-deformed Knizhnik-Zamolodchikov and Hirota equations

We consider partial sum rules for the homogeneous limit of the solution of the q-deformed Knizhnik-Zamolodchikov equation with reflecting boundaries in the Dyck path representation of the Temperley-Lieb algebra. We show that these partial sums arise in a solution of the discrete Hirota equation, and prove that they are the generating functions of τ²-weighted punctured cyclically symmetric transpose complement plane partitions where τ=−(q+q−1). In the cases of no or minimal punctures, we prove that these generating functions coincide with τ²-enumerations of vertically symmetric alternating sign matrices and modifications thereof.     

On the average order of a class of arithmetical functions

We consider a class of arithmetical functions generated by Dirichlet series that satisfy a functional equation with multiple gamma factors. We prove one- and two-sided omega theorems for the error terms associated with summatory functions of the type Σ_λn≤xa(n)(x ? λ_n)^?, where ? ≥ 0. In particular, we improve results of Hardy for the circle and Dirichlet divisor problems and results of Szegö and Walfisz for the Piltz divisor problem in algebraic number fields.     

Multiplicative Properties of the Number of <Emphasis Type="Italic">k</Emphasis>-Regular Partitions

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with k-regular partitions. Extending the generating function for k-regular partitions multiplicatively to a function on k-regular partitions, we show that it takes its maximum at an explicitly described small set of partitions, and can thus easily be computed. The basis for this is an extension of a classical result of Lehmer, from which an inequality for the generating function for k-regular partitions is deduced which seems not to have been noticed before.