Related papers: Combinatorial theorems relative to a random set
We survey the classical results on the prime number theorem
We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.
The Lie algebras over the algebra of dual numbers are introduced and investigated.
We study an extension of Montgomery's pair-correlation conjecture and its relevance in some problems on the distribution of prime numbers.
We prove a generalization of classical Montel's theorem for the mixed differences case, for polynomials and exponential polynomial functions, in commutative setting.
Collective versions of order convergences and corresponding types of collectively qualified sets of operators in vector lattices are investigated. It is proved that collectively order to norm bounded sets are bounded in the operator norm…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
The odds theorem and the corresponding solution algorithm (odds algorithm) are tools to solve a wide range of optimal stopping problems. Its generality and tractability have caught much attention. (Google for instance "Bruss odds" to obtain…
In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.
We prove a combination theorem for PD(n)-pairs.
In these lectures we discuss some elementary concepts in connection with the theory of symmetric spaces applied to ensembles of random matrices. We review how the relationship between random matrix theory and symmetric spaces can be used in…
We continue the research of Lata{\l}a on improving estimates of $p$-th moments of sums of independent random variables. We generalize some of his results in the case when $2 \leq p \leq 4$ and present a combinatorial approach for even…
The study of several naturally arising "nearest neighbours" random walks benefits from the study of the associated orthogonal polynomials and their orthogonality measure. I consider extensions of this approach to a larger class of random…
We study the concept of universal sets from the additive--combinatorial point of view. Among other results we obtain some applications of this type of uniformity to sets avoiding solutions to linear equations, and get an optimal upper bound…
The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…
In this paper a free analogous of completely random measure is introduced. Furthermore, a representation theorem is proved for free completely random measures that are free infinitely divisible.
I review the classical theory of likelihood based inference and consider how it is being extended and developed for use in complex models and sampling schemes.
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
The causal set theory d'Alembertian has rational coefficients for which alternating expressions are known. Here, a combinatorial interpretation of these numbers is given.
The aim of this article is to give a survey of combination theorems occurring in hyperbolic geometry, geometric group theory and complex dynamics, with a particular focus on Thurston's contribution and influence in the field.