相关论文: An improvement of Zalcman's lemma in $C^n$

We give a new proof of a lemma by L. Shepp, that was used in connection to random coverings of a circle.

The aim of this paper is to show further results following those published in [5], and to relate the Riemann zeta function to the relativistic cosmology.

We review the O(a) improvement of lattice QCD with special emphasis on the motivation for performing the improvement programme non-perturbatively and the general concepts of on-shell improvement. The present status of the calculations of…

The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…

The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…

To take advantage of Large Language Model in theorem formalization and proof, we propose a reinforcement learning framework to iteratively optimize the pretrained LLM by rolling out next tactics and comparing them with the expected ones.…

In the present note, we generalize the first part of the Borel-Cantelli lemma. By this generalization, we obtain some strong limit results.

The purpose of this note is to provide a detailed proof of Nazarov's inequality stated in Lemma A.1 in Chernozhukov, Chetverikov, and Kato (2017, Annals of Probability).

We give a new proof of Chen-Lin result with Li-Zhang method.

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

The aim of this work is to improve Wilker inequalities near the origin and {\pi}/2.

We provide a full self-contained proof of a famous Lemma of Ilmanen. This proof is based on a regularisation procedure similar to Lasry-Lions regularisation.

We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

This is a survey article on selected topics in approximation theory. The topics either use techniques from the theory of several complex variables or arise in the study of the subject. The survey is aimed at readers having an acquaintance…

We prove a version of van der Corput's Lemma for polynomials over the p-adic numbers.

In this paper we give a new proof of Riemann's well known mapping theorem. The suggested method permits to prove an analog of that theorem for the three dimensional case.

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of…

In this work, we prove a Carleman estimate for a parabolic problem which has a dissipative degenerate term. The prove relies on choose a suitable weight function that change of sign inside the control domain.