Related papers: A note on a theorem of M. Christ
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
We have dealt with the Euler's alternating series of the Riemann zeta function to define a regularized ratio appeared in the functional equation even in the critical strip and showed some evidence to indicate the hypothesis. We briefly…
We generalize McDiarmid's inequality for functions with bounded differences on a high probability set, using an extension argument. Those functions concentrate around their conditional expectations. We further extend the results to…
The first result of our article is another proof of Mertens' third theorem in the number field setting, which generalises a method of Hardy. The second result concerns the sign of the error term in Mertens' third theorem. Diamond and Pintz…
We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…
The Riesz-Sobolev inequality relates the convolution of nonnegative functions on Euclidean space to the convolution of their symmetric nonincreasing rearrangements. We show that for dimension one, for indicator functions of sets, if the…
In this paper, a new proof of the Positive Mass Theorem is established through a newly discovered monotonicity formula, holding along the level sets of the Green's function of an asymptotically flat $3$-manifold. In the same context and for…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
In this short note we prove a theorem of the Stone-Weierstrass sort for subsets of the cone of non-decreasing continuous functions on compact partially ordered sets.
The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…
We adapt a construction taken from `L. Motto Ros and B. Semmes, A new proof of a theorem of Jayne and Rogers, Real Anal. Exchange 35(1) (2009/2010), 195-204' in order to correct a mistake contained in the first part of the same paper. As a…
The strong unique continuation property for Einstein metrics can be concluded from the well-known fact that Einstein metrics are analytic in geodesic normal coordinates. Here we give a proof of the same result that given two Einstein…
A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…
We consider a class of attractive-repulsive energies, given by the sum of two nonlocal interactions with power-law kernels, defined over sets with fixed measure. It has recently been proved by R. Frank and E. Lieb that the ball is the…
In the first part of the paper, we define an approximated Brunn-Minkowski inequality which generalizes the classical one for length spaces. Our new definition based only on distance properties allows us also to deal with discrete spaces.…
In this paper, we prove a discrete version of the generalized Riesz inequality on $\mathbb{Z}^d$. As a consequence, we will derive the extended Hardy-Littlewood and P\'olya-Szeg\"o inequalities. We will also establish cases of equality in…
The Riesz-Sobolev inequality provides an upper bound, in integral form, for the convolution of indicator functions of subsets of Euclidean space. We formulate and prove a sharper form of the inequality. This can be equivalently phrased as a…
The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…
In this article we consider mathematical fundamentals of one method for proving inequalities by computer, based on the Remez algorithm. Using the well-known results of undecidability of the existence of zeros of real elementary functions,…
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…