نتایج جستجو برای: gleason kahane zelazko theorem

تعداد نتایج: 148080  

Journal: :Journal of The Institute of Mathematics of Jussieu 2022

Abstract We prove stronger variants of a multiplier theorem Kislyakov. The key ingredients are based on ideas Kislyakov and the Kahane–Salem–Zygmund inequality. As by-product, we show various theorems for spaces trigonometric polynomials n -dimensional torus $\mathbb {T}^n$ or Boolean cubes $\{-1,1\}^N$ . Our more abstract approach local Banach space theory has advantage that it allows to consi...

2013
Tamás Erdélyi TAMÁS ERDÉLYI

In this paper we study ultraflat sequences (Pn) of unimodular polynomials Pn ∈ Kn in general, not necessarily those produced by Kahane in his paper [Ka]. We examine how far is a sequence (Pn) of unimodular polynomials Pn ∈ Kn from being conjugate reciprocal. Our main results include the following. Theorem. Given a sequence (εn) of positive numbers tending to 0, assume that (Pn) is a (εn)-ultraf...

Journal: :Applied and numerical harmonic analysis 2023

The goal is to extend Gleason’s notion of a frame function, which essential in his fundamental theorem quantum measurement, more general function acting on 1-tight, so-called, Parseval frames. We refer these functions as Gleason for reason our generalization that positive operator-valued measures (POVMs) are essentially equivalent frames and POVMs arise naturally measurement theory. prove under...

2008
Omer Friedland

We prove a Kahane-Khinchin type result with a few random vectors, which are distributed independently with respect to an arbitrary log-concave probability measure on Rn. This is an application of small ball estimate and Chernoff’s method, that has been recently used in the context of Asymptotic Geometric Analysis in [1], [2].

Journal: :Journal of Combinatorial Theory, Series A 1994

Journal: :Proceedings of the American Mathematical Society 2008

Journal: :Des. Codes Cryptography 2011
Koichi Betsumiya Masaaki Harada Hiroshi Kimura

As described in [7], self-dual codes are an important class of linear codes for both theoretical and practical reasons. It is a fundamental problem to classify self-dual codes of modest length and determine the largest minimum weight among self-dual codes of that length (see [7]). By the Gleason–Pierce theorem, there are nontrivial divisible self-dual codes over Fq for q = 2, 3 and 4 only, wher...

Background and Objective: Today’s, the Gleason grading system is well known as the world’s most commonly used histological system for prostate cancer. It provides significant information about the prognosis. This prospective paper assessed the correlation of transrectal ultrasound (TRUS) guided biopsy and radical prostatectomy specimens in terms of Gleason scores. In this matter, the effect of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید