Related papers: The Tur\'{a}n number and probabilistic combinatori…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities.…
Theorem proving is one of the oldest applications which require heuristics to prune the search space. Invertible proof procedures has been the major tool. In this paper, we present a novel and powerful heuristic called $nongshim$ which can…
We present a short proof that the normalized Tur\'{a}n determinant in the ultraspherical case is convex or concave depending on whether parameter $\lambda$ is positive or negative.
Bayesian probability theory is used to analyze the oft-made assumption that humans are typical observers in the universe. Some theoretical calculations make the {\it selection fallacy} that we are randomly chosen from a class of objects by…
The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…
This article attempts to place the emergence of probabilistic numerics as a mathematical-statistical research field within its historical context and to explore how its gradual development can be related both to applications and to a modern…
For two graphs $G$ and $H$, the Tur\'{a}n number $ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Tur\'{a}n numbers $ex(K_{m,n},kK_2)$ for all $k\geq 1$ [7]. In this…
The fundamental theorem of Tur\'{a}n from Extremal Graph Theory determines the exact bound on the number of edges $t_r(n)$ in an $n$-vertex graph that does not contain a clique of size $r+1$. We establish an interesting link between…
We present a probabilistic proof of Euler's pentagonal number theorem based on a shuffling model.
In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.
The classical statistics of turbulence are shown to be not specific to turbulence and can be derived from a solution for recurring unsteady state viscous flow. Care must be exercised in using them to make deductions about turbulence…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
I am presenting a first-ever scientific collection of short sayings on probability and statistics expressed by most various men of science, many classics included, from antiquity to Kepler to our time. Quite understandably, the reader will…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…
We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.
We explain how to use the probabilistic method to prove the existence of real polynomial singularities with rich topology, i.e. with total Betti number of the maximal possible order. We show how similar ideas can be used to produce real…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…