The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Note on the multidimensional Gebelein inequality”

Note on the variance of the sum of Gaussian functionals

Marek Beśka (2010)

Applicationes Mathematicae

Similarity:

Let ( X i , i = 1 , 2 , . . . ) be a Gaussian sequence with X i N ( 0 , 1 ) for each i and suppose its correlation matrix R = ( ρ i j ) i , j 1 is the matrix of some linear operator R:l₂→ l₂. Then for f i L ² ( μ ) , i=1,2,..., where μ is the standard normal distribution, we estimate the variation of the sum of the Gaussian functionals f i ( X i ) , i=1,2,... .

Gaussian approximation of Gaussian scale mixtures

Gérard Letac, Hélène Massam (2020)

Kybernetika

Similarity:

For a given positive random variable V > 0 and a given Z N ( 0 , 1 ) independent of V , we compute the scalar t 0 such that the distance in the L 2 ( ) sense between Z V 1 / 2 and Z t 0 is minimal. We also consider the same problem in several dimensions when V is a random positive definite matrix.

Recurrences for the coefficients of series expansions with respect to classical orthogonal polynomials

Stanislaw Lewanowicz (2002)

Applicationes Mathematicae

Similarity:

Let P k be any sequence of classical orthogonal polynomials. Further, let f be a function satisfying a linear differential equation with polynomial coefficients. We give an algorithm to construct, in a compact form, a recurrence relation satisfied by the coefficients a k in f = k a k P k . A systematic use of the basic properties (including some nonstandard ones) of the polynomials P k results in obtaining a low order of the recurrence.

A Note on the Men'shov-Rademacher Inequality

Witold Bednorz (2006)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

We improve the constants in the Men’shov-Rademacher inequality by showing that for n ≥ 64, E ( s u p 1 k n | i = 1 k X i | ² 0 . 11 ( 6 . 20 + l o g n ) ² for all orthogonal random variables X₁,..., Xₙ such that k = 1 n E | X k | ² = 1 .

A Green's function for θ-incomplete polynomials

Joe Callaghan (2007)

Annales Polonici Mathematici

Similarity:

Let K be any subset of N . We define a pluricomplex Green’s function V K , θ for θ-incomplete polynomials. We establish properties of V K , θ analogous to those of the weighted pluricomplex Green’s function. When K is a regular compact subset of N , we show that every continuous function that can be approximated uniformly on K by θ-incomplete polynomials, must vanish on K s u p p ( d d c V K , θ ) N . We prove a version of Siciak’s theorem and a comparison theorem for θ-incomplete polynomials. We compute s u p p ( d d c V K , θ ) N when K is a compact...

Random ε-nets and embeddings in N

Y. Gordon, A. E. Litvak, A. Pajor, N. Tomczak-Jaegermann (2007)

Studia Mathematica

Similarity:

We show that, given an n-dimensional normed space X, a sequence of N = ( 8 / ε ) 2 n independent random vectors ( X i ) i = 1 N , uniformly distributed in the unit ball of X*, with high probability forms an ε-net for this unit ball. Thus the random linear map Γ : N defined by Γ x = ( x , X i ) i = 1 N embeds X in N with at most 1 + ε norm distortion. In the case X = ℓ₂ⁿ we obtain a random 1+ε-embedding into N with asymptotically best possible relation between N, n, and ε.

About the generating function of a left bounded integer-valued random variable

Charles Delorme, Jean-Marc Rinkel (2008)

Bulletin de la Société Mathématique de France

Similarity:

We give a relation between the sign of the mean of an integer-valued, left bounded, random variable X and the number of zeros of 1 - Φ ( z ) inside the unit disk, where Φ is the generating function of X , under some mild conditions

Gebelein's inequality and its consequences

M. Beśka, Z. Ciesielski (2006)

Banach Center Publications

Similarity:

Let ( X i , i = 1 , 2 , . . . ) be the normalized gaussian system such that X i N ( 0 , 1 ) , i = 1,2,... and let the correlation matrix ρ i j = E ( X i X j ) satisfy the following hypothesis: C = s u p i 1 j = 1 | ρ i , j | < . We present Gebelein’s inequality and some of its consequences: Borel-Cantelli type lemma, iterated log law, Levy’s norm for the gaussian sequence etc. The main result is that (f(X₁) + ⋯ + f(Xₙ))/n → 0 a.s. for f ∈ L¹(ν) with (f,1)ν = 0.

Some results on derangement polynomials

Mehdi Hassani, Hossein Moshtagh, Mohammad Ghorbani (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We study moments of the difference D n ( x ) - x n n ! e - 1 / x concerning derangement polynomials D n ( x ) . For the first moment, we obtain an explicit formula in terms of the exponential integral function and we show that it is always negative for x > 0 . For the higher moments, we obtain a multiple integral representation of the order of the moment under computation.

The factorization of f ( x ) x n + g ( x ) with f ( x ) monic and of degree 2 .

Joshua Harrington, Andrew Vincent, Daniel White (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper we investigate the factorization of the polynomials f ( x ) x n + g ( x ) [ x ] in the special case where f ( x ) is a monic quadratic polynomial with negative discriminant. We also mention similar results in the case that f ( x ) is monic and linear.

Estimates for polynomials in the unit disk with varying constant terms

Stephan Ruscheweyh, Magdalena Wołoszkiewicz (2011)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let · be the uniform norm in the unit disk. We study the quantities M n ( α ) : = inf ( z P ( z ) + α - α ) where the infimum is taken over all polynomials P of degree n - 1 with P ( z ) = 1 and α > 0 . In a recent paper by Fournier, Letac and Ruscheweyh (Math. Nachrichten 283 (2010), 193-199) it was shown that inf α > 0 M n ( α ) = 1 / n . We find the exact values of M n ( α ) and determine corresponding extremal polynomials. The method applied uses known cases of maximal ranges of polynomials.

Some limit theorems for m -pairwise negative quadrant dependent random variables

Yongfeng Wu, Jiangyan Peng (2018)

Kybernetika

Similarity:

The authors first establish the Marcinkiewicz-Zygmund inequalities with exponent p ( 1 p 2 ) for m -pairwise negatively quadrant dependent ( m -PNQD) random variables. By means of the inequalities, the authors obtain some limit theorems for arrays of rowwise m -PNQD random variables, which extend and improve the corresponding results in [Y. Meng and Z. Lin (2009)] and [H. S. Sung (2013)]. It is worthy to point out that the open problem of [H. S. Sung, S. Lisawadi, and A. Volodin (2008)] can be...

The algebra of polynomials on the space of ultradifferentiable functions

Katarzyna Grasela (2010)

Banach Center Publications

Similarity:

We consider the space of ultradifferentiable functions with compact supports and the space of polynomials on . A description of the space ( ) of polynomial ultradistributions as a locally convex direct sum is given.

Stable random fields and geometry

Shigeo Takenaka (2010)

Banach Center Publications

Similarity:

Let (M,d) be a metric space with a fixed origin O. P. Lévy defined Brownian motion X(a); a ∈ M as 0. X(O) = 0. 1. X(a) - X(b) is subject to the Gaussian law of mean 0 and variance d(a,b). He gave an example for M = S m , the m-dimensional sphere. Let Y ( B ) ; B ( S m ) be the Gaussian random measure on S m , that is, 1. Y(B) is a centered Gaussian system, 2. the variance of Y(B) is equal of μ(B), where μ is the uniform measure on S m , 3. if B₁ ∩ B₂ = ∅ then Y(B₁) is independent of Y(B₂). 4. for B i , i = 1,2,..., B i B j = ,...

Remarks on q-CCR relations for |q| > 1

Marek Bożejko (2007)

Banach Center Publications

Similarity:

In this paper we give a construction of operators satisfying q-CCR relations for q > 1: A ( f ) A * ( g ) - A * ( g ) A ( f ) = q N f , g I and also q-CAR relations for q < -1: B ( f ) B * ( g ) + B * ( g ) B ( f ) = | q | N f , g I , where N is the number operator on a suitable Fock space q ( ) acting as Nx₁ ⊗ ⋯ ⊗ xₙ = nx₁ ⊗ ⋯ ⊗xₙ. Some applications to combinatorial problems are also given.

On the lattice of polynomials with integer coefficients: the covering radius in L p ( 0 , 1 )

Wojciech Banaszczyk, Artur Lipnicki (2015)

Annales Polonici Mathematici

Similarity:

The paper deals with the approximation by polynomials with integer coefficients in L p ( 0 , 1 ) , 1 ≤ p ≤ ∞. Let P n , r be the space of polynomials of degree ≤ n which are divisible by the polynomial x r ( 1 - x ) r , r ≥ 0, and let P n , r P n , r be the set of polynomials with integer coefficients. Let μ ( P n , r ; L p ) be the maximal distance of elements of P n , r from P n , r in L p ( 0 , 1 ) . We give rather precise quantitative estimates of μ ( P n , r ; L ) for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of μ ( P n , r ; L p ) for p ≠ 2. It follows that μ ( P n , r ; L p ) n - 2 r - 2 / p as n → ∞. The results...