Related papers: The distribution of totients
In the framework of generalized Oppenheim expansions we prove strong law of large numbers for lightly trimmed sums. In the first part of this work we identify a particular class of expansions for which we provide a convergence result…
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…
A tempered version of the discrete Linnik distribution is introduced in order to obtain integer-valued distribution families connected to stable laws. The proposal constitutes a generalization of the well-known Poisson-Tweedie law, which is…
We study here the well-known propagation rules for Boolean constraints. First we propose a simple notion of completeness for sets of such rules and establish a completeness result. Then we show an equivalence in an appropriate sense between…
We summarize some recent work on large-Nc sum rules.
This paper proves several weak limit theorems for the joint version of extreme order statistics and partial sums of independently and identically distributed random variables. The results are also extended to almost sure limit version.
Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…
In the present paper a new mean value theorem for polynomials of special form is obtained. The case of sums on vertices of a regular polygon is studied. A criterion for a certain equation to be satisfied is obtained.
Recently, there has been a lot of effort to represent words in continuous vector spaces. Those representations have been shown to capture both semantic and syntactic information about words. However, distributed representations of phrases…
This is yet another version of the course notes in chao-dyn/9407003. Here we change the universal Turing machine that is used to measure program-size complexity so that the constants in our information-theoretic incompleteness theorems are…
This thesis starts from a review on current research on the local hypoellipticity of the $\bar\partial$-Neumann problem. It presents the classical method of regularity from estimates of the energy: subelliptic as well as superlogarithmic.…
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 aim of the present work is to show that recent results of the authors on the approximation of distributions of sums of independent summands by the infinitely divisible laws on convex polyhedra can be shown via an alternative class of…
A number of topics in analysis are discussed, with emphasis on basic principles. There is some overlap with "Elements of linear and real analysis" (arXiv:math/0108030), with numerous changes in content and presentation since then.
This paper reviews advances in Stein-type shrinkage estimation for spherically symmetric distributions. Some emphasis is placed on developing intuition as to why shrinkage should work in location problems whether the underlying population…
In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.
We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…
The aim of this note is: (a) to propose a generalization of tetrahedron equations from \cite{S} and of their solutions. Due to appearance of a larger number of parameters the $R$-matrices from \cite{S} will be replaced by…
In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…
This note shows that the three theorems presented in J. Math. Anal. Appl. 556 (2026), 130199, whose proofs, in their present formulation, are purely formal, follow from elementary calculus.