On the number of Abelian groups of a given order and on certain related multiplicative functions

Let a(n) denote the number of nonisomorphic Abelian groups with n elements. Several problems concerning a(n) and a class of related multiplicative functions are discussed. These include precise characterizations of local densities, distribution of values (where the Tauberian theorem of Hardy-Ramanujan is used), sharp formulas for the sums Σ_n≤xF(a(n)) for a wide class of functions F, and a comparison of values taken on the average by a(n) and some other common arithmetic functions.     

Central and local limit theorems applied to asymptotic enumeration

Let a double sequence a_n(k) ? 0 be given. We prove a simple theorem on generating functions which can be used to establish the asymptotic normality of a_n(k) as a function of k. Next we turn our attention to local limit theorems in order to obtain asymptotic formulas for a_n(k). Applications include constant coefficient recursions, Stirling numbers, and Eulerian numbers.     

Equidistribution of signs for modular eigenforms of half integral weight

Let f be a cusp form of weight k + 1/2 and at most quadratic nebentype character whose Fourier coefficients a(n) are all real. We study an equidistribution conjecture of Bruinier and Kohnen for the signs of a(n). We prove this conjecture for certain subfamilies of coefficients that are accessible via the Shimura lift by using the Sato–Tate equidistribution theorem for integral weight modular forms. Firstly, an unconditional proof is given for the family {a(tp ²)} _p , where t is a squarefree number and p runs through the primes. In this case, the result is in terms of natural density. To prove it for the family {a(tn ²)} _n where t is a squarefree number and n runs through all natural numbers, we assume the existence of a suitable error term for the convergence of the Sato–Tate distribution, which is weaker than one conjectured by Akiyama and Tanigawa. In this case, the results are in terms of Dedekind–Dirichlet density.     

On the largest prime factor of the partition function of n

Let p(n) be the function that counts the number of partitions of n. For a positive integer m, let P(m) be the largest prime factor of m. Here, we show that P(p(n)) tends to infinity when n tends to infinity through some set of asymptotic density 1. In fact, we show that the inequality P(p(n))>loglogloglogloglogn holds for almost all positive integers n. Features of the proof are the first term in Rademacher??s formula for p(n), Gowers?? effective version of Szemerédi??s theorem, and a classical lower bound for a nonzero homogeneous linear form in logarithms of algebraic numbers due to Matveev.     

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 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-reflective functions. We also provide formulas for the r-fold alternating sums of powers in terms of Euler polynomials.     

A Hardy field extension of Szemerédi's theorem

In 1975 Szemerédi proved that a set of integers of positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman showed in 1996 that the common difference of the arithmetic progression can be a square, a cube, or more generally of the form p(n) where p(n) is any integer polynomial with zero constant term. We produce a variety of new results of this type related to sequences that are not polynomial. We show that the common difference of the progression in Szemerédi's theorem can be of the form [nδ] where δ is any positive real number and [x] denotes the integer part of x. More generally, the common difference can be of the form [a(n)] where a(x) is any function that is a member of a Hardy field and satisfies a(x)/xk→∞ and a(x)/xk+1→0 for some non-negative integer k. The proof combines a new structural result for Hardy sequences, techniques from ergodic theory, and some recent equidistribution results of sequences on nilmanifolds.     

Linear differential equations and multiple zeta values. II. A generalization of the WKB method

For linear differential equations x(n)+a₁x(n−1)+?+anx=0 (and corresponding linear differential systems) with large complex parameter λ and meromorphic coefficients aj=aj(t;λ) we prove existence of analogues of Stokes matrices for the asymptotic WKB solutions. These matrices may depend on the parameter, but under some natural assumptions such dependence does not take place. We also discuss a generalization of the Hukuhara-Levelt-Turritin theorem about formal reduction of a linear differential system near an irregular singular point t=0 to a normal form with ramified change of time to the case of systems with large parameter. These results are applied to some hypergeometric equations related with generating functions for multiple zeta values.     

On averaging Frankl's conjecture for large union-closed-sets

Let F be a union-closed family of subsets of an m-element set A. Let n=|F|?2 and for a∈A let s(a) denote the number of sets in F that contain a. Frankl's conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element a∈A with n−2s(a)?0. Strengthening a result of Gao and Yu [W. Gao, H. Yu, Note on the union-closed sets conjecture, Ars Combin. 49 (1998) 280-288] we verify the conjecture for the particular case when m?3 and n?m²−²m/2. Moreover, for these “large” families F we prove an even stronger version via averaging. Namely, the sum of the n−2s(a), for all a∈A, is shown to be non-positive. Notice that this stronger version does not hold for all union-closed families; however we conjecture that it holds for a much wider class of families than considered here. Although the proof of the result is based on elementary lattice theory, the paper is self-contained and the reader is not assumed to be familiar with lattices.     

A new coloring theorem of Kneser graphs

In 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kneser graphs KG(n,k) is equal to the chromatic number of these graphs. This was proved by Simonyi and Tardos (2006) [13] and independently by Meunier (2005) [10], if χ(KG(n,k)) is even. In this paper, we propose an alternative version of Kneser's coloring theorem to confirm the Johnson-Holroyd-Stahl conjecture.     

Extension dimension and quasi-finite CW-complexes

We extend the definition of quasi-finite complexes from countable complexes to arbitrary ones and provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications. Several results related to the class of quasi-finite complexes are established, such as completion of metrizable spaces, existence of universal spaces and a version of the factorization theorem. Furthermore, we define UV(L)-spaces in the realm of metrizable spaces and show that some properties of UV(n)-spaces and UV(n)-maps remain valid for UV(L)-spaces and UV(L)-maps, respectively.     

Selection principle for pointwise bounded sequences of functions

For a number ? > 0 and a real function f on an interval [a, b], denote by N(?, f, [a, b]) the least upper bound of the set of indices n for which there is a family of disjoint intervals [a _i , b _i ], i = 1, …, n, on [a, b] such that |f(a _i ) ? f(b _i )| > ? for any i = 1, …, n (sup Ø = 0). The following theorem is proved: if {f _j } is a pointwise bounded sequence of real functions on the interval [a, b] such that n(?) ≡ lim sup _j→∞ N(?, f _j , [a, b]) < ∞ for any ? > 0, then the sequence {f _j } contains a subsequence which converges, everywhere on [a, b], to some function f such that N(?, f, [a, b]) ≤ n(?) for any ? > 0. It is proved that the main condition in this theorem related to the upper limit is necessary for any uniformly convergent sequence {f _j } and is “almost” necessary for any everywhere convergent sequence of measurable functions, and many pointwise selection principles generalizing Helly’s classical theorem are consequences of our theorem. Examples are presented which illustrate the sharpness of the theorem.     

A max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n × n nonnegative matrices in max algebra. In this paper we propose the notions of the max algebra version of the generalized spectral radius μ(Ψ) of Ψ, and the max algebra version of the joint spectral radius η(Ψ) of Ψ. The max algebra version of the generalized spectral radius theorem μ(Ψ) = η(Ψ) is established. We propose the relationship between the generalized spectral radius ρ(Ψ) of Ψ (in the sense of Daubechies and Lagarias) and its max algebra version μ(Ψ). Moreover, a generalization of Elsner and van den Driessche’s lemma is presented as well.     

Integro-local theorems for sums of independent random vectors in the series scheme

Let S(n) = ξ(1)+?+ξ(n) be a sum of independent random vectors ξ(i) = ξ _(n)(i) with general distribution depending on a parameter n. We find sufficient conditions for the uniform version of the integro-local Stone theorem to hold for the asymptotics of the probability P(S(n) ∈ Δ[x), where Δ[x) is a cube with edge Δ and vertex at a point x.     

On one extremal problem for complex polynomials with constraints on critical values

For all fixed complex numbers a and b and a natural n ≥ 2, we study the problem of finding the supremum of the product |P′(0)P′(1)| over the set of all polynomials P of degree n satisfying the following conditions: P(0) = a and P(1) = b, while |P(z)| ≤ 1 for all z for which P′(z) = 0. As an application of the main result of the article, we give a number of exact estimates for polynomials with account taken of their critical values. We in particular establish a new version of a Markov-type inequality for an arbitrary compact set.     

Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions

Let a multivariate sequence a_n(k) ? 0 be given. Multivariate central and local limit theorems are proved for a_n(k) as n → ∞ that are based on examining the generating function. Applications are made to permutations with rises and falls, ordered partitions of sets, Tutte polynomials of recursive families, and dissections of polygons.     

A short proof of Meyniel's theorem

Meyniel's theorem states that a strict diconnected digraph has a directed Hamilton cycle if d(u) + d(v) ? 2n ? 1 for every pair u, v of nonadjacent vertices. We give short proof of this theorem.     

A central limit theorem for a weighted power variation of a Gaussian process*

Let ρ be a real-valued function on [0, T], and let LSI(ρ) be a class of Gaussian processes over time interval [0, T], which need not have stationary increments but their incremental variance σ(s, t) is close to the values ρ(|t ? s|) as t → s uniformly in s ∈ (0, T]. For a Gaussian processesGfrom LSI(ρ), we consider a power variation V _n corresponding to a regular partition π _n of [0, T] and weighted by values of ρ(·). Under suitable hypotheses on G, we prove that a central limit theorem holds for V _n as the mesh of π _n approaches zero. The proof is based on a general central limit theorem for random variables that admit a Wiener chaos representation. The present result extends the central limit theorem for a power variation of a class of Gaussian processes with stationary increments and for bifractional and subfractional Gaussian processes.     

A method of constructing Krall's polynomials

We propose a method of constructing orthogonal polynomials P_n(x) (Krall's polynomials) that are eigenfunctions of higher-order differential operators. Using this method we show that recurrence coefficients of Krall's polynomials P_n(x) are rational functions of n. Let P_n^(a,b;M)(x) be polynomials obtained from the Jacobi polynomials P_n^(a,b)(x) by the following procedure. We add an arbitrary concentrated mass M at the endpoint of the orthogonality interval with respect to the weight function of the ordinary Jacobi polynomials. We find necessary conditions for the parameters a,b in order for the polynomials P_n^(a,b;M)(x) to obey a higher-order differential equation. The main result of the paper is the following. Let a be a positive integer and b⩾−1/2 an arbitrary real parameter. Then the polynomials P_n^(a,b;M)(x) are Krall's polynomials satisfying a differential equation of order 2a+4.     

Regular asymptotics of a generalized solution of the stationary Navier-Stokes system

A complete asymptotic expansion for n → ∞ is obtained in a local limit theorem for the distribution of the sojourn time of a random walk with zero drift in the set (b,∞) during n steps. Here b = b(n) → ∞, b(n) = o(n), and Cramér-type conditions are imposed on the distribution of jumps of the walk.     

A Grobman-Hartman theorem for general nonuniform exponential dichotomies

For a nonautonomous dynamics with discrete time given by a sequence of linear operators Am, we establish a version of the Grobman-Hartman theorem in Banach spaces for a very general nonuniformly hyperbolic dynamics. More precisely, we consider a sequence of linear operators whose products exhibit stable and unstable behaviors with respect to arbitrary growth rates ecρ(n), determined by a sequence ρ(n). For all sufficiently small Lipschitz perturbations Am+fm we construct topological conjugacies between the dynamics defined by this sequence and the dynamics defined by the operators Am. We also show that all conjugacies are Hölder continuous. We note that the usual exponential behavior is included as a very special case when ρ(n)=n, but many other asymptotic behaviors are included such as the polynomial asymptotic behavior when ρ(n)=logn.