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

In this note I provide two extensions of a particular case of the classical Poncelet theorem.

The goal of this paper is to improve existing bounds for Fourier coefficients of higher genus Siegel modular forms of small weight.

We provide a generalization of the Phragm\'en-Lindel\"of principal of Rademacher with the aim of correcting, or at least provide a pathway to correcting, several errors appearing in the literature.

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a…

In this paper we give a short, new proof of a natural generalization of Gerzon's bound. This bound improves the Delsarte, Goethals and Seidel's upper bound in a special case. Our proof is a simple application of the linear algebra bound…

We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.

One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.

Using a method of factorization and by introducing a generalized discrete Dirichlet's Laplacian matrix $(-\Delta_{\Lambda})$, we establish an extended improved discrete Hardy's inequality and Rellich inequality in one dimension. We prove…

We formulate and prove a new sufficient conditions for Central Limit Theorem(CLT) in the space of continuous functions in the terms typical for the approximation theory. We prove that the conditions for continuous CLT obtained by N.C.Jain…

The emergence of in-context learning (ICL) enables large pre-trained language models (PLMs) to make predictions for unseen inputs without updating parameters. Despite its potential, ICL's effectiveness heavily relies on the quality,…

The main object of this paper is to construct new Durrmeyer type operators which have better features than the classical one. Some results concerning the rate of convergence and asymptotic formulas of the new operator are given. Finally,…

The aim of this paper is to construct a new expansion of $(1+1/x)^x$ related to Carleman's inequality. Our results extend some results of Yang [Approximations for constant e and their applications J. Math. Anal. Appl. 262 (2001) 651-659].

The aim of this paper is to study the $(\alpha, \gamma)$-prolongation of central extensions. We obtain the obstruction theory for $(\alpha, \gamma)$-prolongations and classify $(\alpha, \gamma)$-prolongations thanks to low-dimensional…

In this paper we prove the Zariski-Lipman conjecture for log canonical spaces.

Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…

We mainly consider the general Caffarelli-Kohn-Nirenberg inequality in the Euclidean and Riemannian setting. In both cases, our proof relies mostly on a new parameter s conveniently introduced, see (2.7).

A new proof of Oka's lemma is given for smoothly bounded, pseudoconvex domains $D\subset\mathbb{C}^n$. The method of proof is then also applied to other convexity-like hypotheses on the boundary of $D$.

We present a convolutional neural network for the classification of correlation responses obtained by correlation filters. The proposed approach can improve the accuracy of classification, as well as achieve invariance to the image classes…