On minimal decay at infinity of Hardy-weights

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monodromy at Infinity and the Weights of Cohomology

We show that the size of the Jordan blocks with eigenvalue one of the monodromy at infinity is estimated in terms of the weights of the cohomology of the total space and a general fiber. Let f : X → S be a morphism of complex algebraic varieties with relative dimension n. Assume S is a smooth curve. Let U be a dense open subvariety of S such that the H(Xs,Q) for s ∈ U form a local system (which...

متن کامل

Decay at Infinity of Caloric Functions within Characteristic Hyperplanes

It is shown that a function u satisfying, |∆u+∂tu| ≤ M (|u|+ |∇u|), |u(x, t)| ≤ MeM|x| 2 in R × [0, T ] and |u(x, 0)| ≤ Cke −k|x| in R and for all k ≥ 1, must vanish identically in R × [0, T ].

متن کامل

Decay to zero of matrix coefficients at Adjoint infinity

The main theorems below are Theorem 9 and Theorem 11. As far as I know, Theorem 9 represents a slight improvement over what currently appears in the literature, and gives a fairly easy proof of Theorem 11 which is due to R. Howe and C. Moore [4]. In the semisimple case, the Howe-Moore result follows from [6] or [7]. The proofs appearing here are relatively elementary and some readers will recog...

متن کامل

On obtaining minimal variability OWA operator weights

One important issue in the theory of Ordered Weighted Averaging (OWA) operators is the determination of the associated weights. One of the first approaches, suggested by O’Hagan, determines a special class of OWA operators having maximal entropy of the OWA weights for a given level of orness; algorithmically it is based on the solution of a constrained optimization problem. Another consideratio...

متن کامل

On Neural Networks with Minimal Weights

Linear threshold elements are the basic building blocks of artificial neural networks. A linear threshold element computes a function that is a sign of a weighted sum of the input variables. The weights are arbitrary integers; actually, they can be very big integers-exponential in the number of the input variables. However, in practice, it is difficult to implement big weights. In the present l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Contemporary Mathematics

سال: 2019

ISSN: 0219-1997,1793-6683

DOI: 10.1142/s0219199719500469