Related papers: Sieving and the Erd{\H o}s-Kac theorem
The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…
We prove H\"ormander's type hypoellipticity theorem for stochastic partial differential equations when the coefficients are only measurable with respect to the time variable. The need for such kind of results comes from filtering theory of…
In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…
We give a direct proof of the Ohsawa-Takegoshi by solving directly the d-bar equation.
We prove several extensions of the Erdos-Fuchs theorem.
We prove a homotopy theorem for sheaves. Its application shortens and simplifies the proof of many Oka principles such as Gromov's Oka principle for elliptic submersions.
Riesz space (non-pointwise) generalizations for iterative processes are given for the concepts of recurrence, first recurrence and conditional ergodicity. Riesz space conditional versions of the Poincar\'{e} Recurrence Theorem and the Kac…
Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1940, Erd\H{o}s and Kac established that $\omega(n)$ obeys the Gaussian distribution over natural numbers, and in 2004, the third author generalized…
Assuming that a threshold Ornstein-Uhlenbeck process is observed at discrete time instants, we propose generalized moment estimators to estimate the parameters. Our theoretical basis is the celebrated ergodic theorem. To use this theorem we…
In this paper we prove Szeg\H{o}'s Theorem for the case when a finite number of Verblunsky coefficients lie outside the closed unit disk. Although a form of this result was already proved by A.L. Sakhnovich, we use a very different method,…
We present a short and self-contained proof of the choosability version of Brooks' theorem.
We provide a simple and short proof of the Karush-Kuhn-Tucker theorem with finite number of equality and inequality constraints. The proof relies on an elementary linear algebra lemma and the local inverse theorem.
A famous conjecture of Erd\H{o}s and S\'os states that every graph with average degree more than $k - 1$ contains all trees with $k$ edges as subgraphs. We prove that the Erd\H{o}s-S\'os conjecture holds approximately, if the size of the…
Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.
In our effort to find an arithmetically pure proof of the Bertrand postulate, we investigate and solve (using only elementary arithmetical methods) another less usual inequality in positive integers inspired by the classical proof of the…
Mathematical theorems are human knowledge able to be accumulated in the form of symbolic representation, and proving theorems has been considered intelligent behavior. Based on the BHK interpretation and the Curry-Howard isomorphism, proof…
In this paper, we study the linear independence between the distribution of the number of prime factors of integers and that of the largest prime factors of integers. Respectively, under a restriction on the largest prime factors of…
We prove time-dependent versions of Kingman's subadditive ergodic theorem, which can be used to study stochastic processes as well as propagation of solutions to PDE in time-dependent environments.
We obtain ergodic theorems for multiple iterated sums and integrals of the form $\Sigma^{(\nu)}(t)=\sum_{0\leq k_1<...<k_\nu\leq t}\xi(k_1)\otimes\cdots\otimes\xi(k_\nu)$, $t\in[0,T]$ and $\Sigma^{(\nu)}(t)=\int_{0\leq s_1\leq...\leq…
In this note we prove a theorem concerning the sewing of even dimensional neighbourly polytopes. The theorem provides a fast algorithm for sewing in practice. We also give a description of the universal faces of a sewn $d$-polytope in terms…