Related papers: The Tur\'{a}n number and probabilistic combinatori…
An elegant and fruitful way to bring harmonic analysis into the theory of orthogonal polynomials and special functions, or to associate certain Banach algebras with orthogonal polynomials satisfying a specific but frequently satisfied…
TThe problem is to identify a probability associated with a set of natural numbers, given an infinite data sequence of elements from the set. If the given sequence is drawn i.i.d. and the probability mass function involved (the target)…
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
At the end, the house always wins! This simple truth holds for all public games of chance. Nevertheless, since lotteries have existed, people have tried everything to give luck a helping hand. This article compares objective scientific…
A method for computing probabilistic propositions is presented. It assumes the availability of a single external routine for computing the probability of one instantiated variable, given a conjunction of other instantiated variables. In…
Classical binomial identities are established by giving probabilistic interpretations to the summands. The examples include Vandermonde identity and some generalizations.
The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…
We present an alternative proof of Perron's theorem, which is probabilistic in nature. It rests on the representation of the Perron eigenvector as a functional of the trajectory of an auxiliary Markov chain.
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…
The Tur\'{a}n number $T(n,\alpha+1,r)$ is the minimum number of edges in an $n$-vertex $r$-graph whose independence number does not exceed $\alpha$. For each $r\geq 2$, there exists $t_*(r)$ such that $T(n,\alpha+1,r) = t_*(r) \: n^r \:…
The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…
We generalize the Stirling numbers of the first kind $s(a,k)$ to the case where $a$ may be an arbitrary real number. In particular, we study the case in which $a$ is an integer. There, we discover new combinatorial properties held by the…
We survey the classical results on the prime number theorem
According to Paul Erd\H{o}s [Some notes on Tur\'an's mathematical work, J. Approx. Theory 29 (1980), page 4] it was Paul Tur\'an who "created the area of extremal problems in graph theory". However, without a doubt, Paul Erd\H{o}s…
Twist tori are examples of exotic monotone lagrangian tori, presented in [1]. This tree of examples grew up over the first one --- the torus $\Theta \in \R^4$, constructured in [2] and [3]. On the other hand, in [4] and [5] we proposed a…
The results of several papers concerning the \v{C}ern\'y conjecture are deduced as consequences of a simple idea that I call the averaging trick. This idea is implicitly used in the literature, but no attempt was made to formalize the proof…
Total probability and Bayes formula are two basic tools for using prior information in the Bayesian statistics. In this paper we introduce an alternative tool for using prior information. This new toold enables us to improve some…
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…
We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…
By closely rereading the original Turing's 1936 article, we can gain insight about that it is based on the claim to have defined a number which is not computable, arguing that there can be no machine computing the diagonal on the…