相关论文: A higher order Weierstrass approximation theorem -…
Some mathematical theorems represent ideas that are discovered again and again in different forms. One such theorem is Hall's marriage theorem. This theorem is equivalent to several other theorems in combinatorics and optimization theory,…
A simple formal recasting of well known arguments concerning the ordering problems of General Relativity allows to obtain in such a context a Gr\"{o}enewald Van Hove like theorem.
In this paper, we give direct theorems on point wise and global approximation by new variants of Bernstein-Durrmeyer operator, introduced by A.-M. et al.[1].
In measure theory, Steinhaus theorem is a result that deals with a property of the difference between two sets of positive measure. We give a simple elementary proof of the result.
In this paper, new inequalities connected with the celebrated Steffensen's integral inequality are proved.
We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.
A New Trinomial Recombination Tree Algorithm and Its Applications
We prove some constructive results that on first and maybe even on second glance seem impossible.
We prove a new converse theorem for Borcherds' multiplicative theta lift which improves the previously known results. To this end we develop a newform theory for vector valued modular forms for the Weil representation, which might be of…
We survey most of the known results concerning the Eisenbud-Green-Harris Conjecture. Our presentation includes new proofs of several theorems, as well as a unified treatment of many results which are otherwise scattered in the literature.…
We give a new, elementary proof of the celebrated Herzog-Hibi-Zheng theorem on powers of quadratic monomial ideals.
The PCP Theorem is one of the most stunning results in computational complexity theory, a culmination of a series of results regarding proof checking it exposes some deep structure of computational problems. As a surprising side-effect, it…
We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…
Based on a less-known result, we prove a recent conjecture concerning the determinant of a certain Sylvester-Kac type matrix and consider an extension of it.
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
We provide the detailed proof of a strengthened version of the M. Artin Approximation Theorem.
We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…
A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into…
A formal theory of experimentation will be presented. Such a theory presents the necessary & sufficient conditions a world must satisfy in order to admit the use of the scientific method.