This statistic, i.e. the sum of positions of records, has been the object of recent interest in the literature. Using the saddle point method, we obtain from the generating function of the sum of positions of records in random permutations and Cauchy’s integral formula, asymptotic results in central and non-central regions. In the non-central region, we derive asymptotic expansions generalizing some results by Kortchemski. In the central region, we obtain a limiting distribution related to Dickman’s function. This paper fits within the framework of Analytic Combinatorics.

We exhibit proofs of Furstenberg’s Multiple Recurrence Theorem and of a special case of Furstenberg and Katznelson’s multidimensional version of this theorem, using an analog of the density-increment argument of Roth and Gowers. The second of these results requires also an analog of some recent finitary work by Shkredov.

Many proofs of these multiple recurrence theorems are already known. However, the approach of this paper sheds some further light on the well-known heuristic correspondence between the ergodic-theoretic and combinatorial aspects of multiple recurrence and Szemeredi’s Theorem. Focusing on the density- increment strategy highlights several close points of connection between these settings.

We study the Euler–Frobenius numbers, a generalization of the Eulerian numbers, and the probability distribution obtained by normalizing them. This distribution can be obtained by rounding a sum of independent uniform random variables; this is more or less implicit in various results and we try to explain this and various connections to other areas of mathematics, such as spline theory.
The mean, variance and (some) higher cumulants of the distribution are calculated. Asymptotic results are given. We include a couple of applications to rounding errors and election methods.

An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit applications of a particular estimate of this sort to several counting problems in number theory: counting integral points and units of bounded height over number fields, counting points of bounded height over positive definite quaternion algebras, and counting points of bounded height with a fixed support over global function fields. Our arguments use a collection of height comparison inequalities for heights over a number field and over a quaternion algebra. We also show how these inequalities can be used to obtain existence results for points of bounded height over a quaternion algebra, which constitute non-commutative analogues of variations of the classical Siegel’s lemma and Cassels’ theorem on small zeros of quadratic forms.

We prove that when a pre-independence space satisfies some natural properties, then its cyclic flats form a bounded lattice under set inclusion. Additionally, we show that a bounded lattice is isomorphic to the lattice of cyclic flats of a pre-independence space. We also prove that the notion of cyclic width gives rise to dual-closed and minorclosed classes of B-matroids. Finally, we find a difference between finite matroids and B-matroids by using the notion of well-quasi-ordering.

In this paper, we generalize an earlier statistic on square-and-domino tilings by considering only those squares covering a multiple of k, where k is a fixed positive integer. We consider the distribution of this statistic jointly with the one that records the number of dominos in a tiling. We derive both finite and infinite sum expressions for the corresponding joint distribution polynomials, the first of which reduces when k = 1 to a prior result. The cases q = 0 and q = −1 are noted for general k. Finally, the case k = 2 is considered specifically, where further results may be given, including a combinatorial proof when q = −1.

A sequence of coefficients appearing in a recurrence for the Narayana polynomials is generalized. The coefficients are given a probabilistic interpretation in terms of beta distributed random variables. The recurrence established by M. Lasalle is then obtained from a classical convolution identity. Some arithmetical properties of the generalized coefficients are also established.

We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we obtain exact values for the expectation and variance for the number of large patterns in a random permutation. Finally, we are able to generalize the idea of bonds to obtain results on fixed-length patterns of any size, and present a construction that maximizes the number of patterns of a fixed size.

We present in this work results on some distributions of permutation statistics of random elements of the wreath product \( G_{r,n} = C_r \wr S_n \). We consider the distribution of the descent number, the flag major index, the excedance, and the number of fixed points, over the whole group \( G_{r,n} \), or over the subclasses of derangements and involutions. We compute the mean, variance and moment generating function, and establish the asymptotic distributions of these statistics.

Let \( A \) be a subset of \( \mathbb{F}_p^n \), the \( n \)-dimensional linear space over the prime field \( \mathbb{F}_p \), of size at least \( \delta N \) (\( N = p^n \)), and let \( S_v = P^{-1}(v) \) be the level set of a homogeneous polynomial map \( P : \mathbb{F}_p^n \to \mathbb{F}_p^R \) of degree \( d \), for \( v \in \mathbb{F}_p^R \). We show that, under appropriate conditions, the set \( A \) contains at least \( c N|S| \) arithmetic progressions of length \( l \leq d \) with common difference in \( S_v \), where \( c \) is a positive constant depending on \( \delta \), \( l \), and \( P \). We also show that the conditions are generic for a class of sparse algebraic sets of density \( \approx N^{-\gamma} \).