首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
A frame in an n-dimensional Hilbert space H n is a possibly redundant collection of vectors {f i } iI that span the space. A tight frame is a generalization of an orthonormal basis. A frame {f i } iI is said to be scalable if there exist nonnegative scalars {c i } iI such that {c i f i } iI is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame {f i } iI to be a collection of subsets of I ordered by inclusion so that nonempty J?I is in the factor poset iff {f j } jJ is a tight frame for H n . We study various properties of factor posets and address the inverse factor poset problem, which inquires when there exists a frame whose factor poset is some given poset P. We then turn our attention to scalable frames and present partial results regarding when a frame can be scaled to have a given factor poset; in doing so we present a bridge between erasure resilience (as studied via prime tight frames) and scalability.  相似文献   

2.
Let {c j } j=0 n be a sequence of matrix moments associated with a matrix of measures supported on the unit circle, and let {P j } j=0 n be its corresponding sequence of monic matrix orthogonal polynomials. In this contribution, we consider a perturbation on the moments and find an explicit relation for the perturbed orthogonal polynomials in terms of {P j } j=0 n . We also obtain an expression for the corresponding second kind polynomials.  相似文献   

3.
The author has established that if [λn] is a convex sequence such that the series Σn -1λn is convergent and the sequence {K n} satisfies the condition |K n|=O[log(n+1)]k(C, 1),k?0, whereK n denotes the (R, logn, 1) mean of the sequence {n log (n+1)a n}, then the series Σlog(n+1)1-kλn a n is summable |R, logn, 1|. The result obtained for the particular casek=0 generalises a previous result of the author [1].  相似文献   

4.
Let Λ={λ 1,…,λ p } be a given set of distinct real numbers. This work deals with the problem of constructing a real matrix A of order n such that each element of Λ is a Pareto eigenvalue of A, that is to say, for all k∈{1,…,p} the complementarity system
$x\geq \mathbf{0}_n,\quad Ax-\lambda_k x\geq \mathbf{0}_n,\quad \langle x, Ax-\lambda_k x\rangle = 0$
admits a nonzero solution x∈? n .
  相似文献   

5.
Let X be a symmetric Banach function space on [0, 1] and let E be a symmetric (quasi)-Banach sequence space. Let f = {f k } k=1 n , n ≥ 1 be an arbitrary sequence of independent random variables in X and let {e k } k=1 ? E be the standard unit vector sequence in E. This paper presents a deterministic characterization of the quantity
$||||\sum\limits_{k = 1}^n {{f_k}{e_k}|{|_E}|{|_X}} $
in terms of the sum of disjoint copies of individual terms of f. We acknowledge key contributions by previous authors in detail in the introduction, however our approach is based on the important recent advances in the study of the Kruglov property of symmetric spaces made earlier by the authors. Authors acknowledge support from the ARC.
  相似文献   

6.
Let χ = {χ n } n=0 be the Haar system normalized in L 2(0, 1) and M = {M s } s=1 be an arbitrary, increasing sequence of nonnegative integers. For any subsystem of χ of the form {φ k } = χS = {χ n } nS , where S = S(M) = {n k } k=1 = {nV[p]: pM}, V[0] = {1, 2} and V[p] = {2 p + 1, 2 p + 2, …, 2 p+1} for p = 1, 2, … a series of the form Σ i=1 a i φ i with a i ↘ 0 is constructed, that is universal with respect to partial series in all classes L r (0, 1), r ∈ (0, 1), in the sense of a.e. convergence and in the metric ofL r (0, 1). The constructed series is universal in the class of all measurable, finite functions on [0, 1] in the sense of a.e. convergence. It is proved that there exists a series by Haar system with decreasing coefficients, which has the following property: for any ? > 0 there exists a measurable function µ(x), x ∈ [0, 1], such that 0 ≤ µ(x) ≤ 1 and |{x ∈ [0, 1], µ(x) ≠ = 1}| < ?, and the series is universal in the weighted space L µ[0, 1] with respect to subseries, in the sense of convergence in the norm of L µ[0, 1].  相似文献   

7.
Let E ? ?n be a closed set of Hausdorff dimension α. For m > n, let{B1, …, Bk} be n × (m ? n) matrices. We prove that if the system of matrices Bj is non-degenerate in a suitable sense, α is sufficiently close to n, and if E supports a probability measure obeying appropriate dimensionality and Fourier decay conditions, then for a range of m depending on n and k, the set E contains a translate of a non-trivial k-point configuration {B1y, …, Bky}. As a consequence, we are able to establish existence of certain geometric configurations in Salem sets (such as parallelograms in ?n and isosceles right triangles in ?2). This can be viewed as a multidimensional analogue of the result of [25] on 3-term arithmetic progressions in subsets of ?.  相似文献   

8.
The paper considers cubature formulas for calculating integrals of functions f(X), X = (x 1, …, x n ) which are defined on the n-dimensional unit hypercube K n = [0, 1] n and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ k = 1 N c k f(X(k)) of cubature formulas (c k > 0) as functions of the weights c k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (rn) of the hypercube K n : |R(f)| ≤ \(\sum _{\alpha _j } \) G j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX r , where coefficients G j ) are criteria which depend only on parameters c k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c k and X(k).  相似文献   

9.
Call a sequence of k Boolean variables or their negations a k-tuple. For a set V of n Boolean variables, let T k (V) denote the set of all 2 k n k possible k-tuples on V. Randomly generate a set C of k-tuples by including every k-tuple in T k (V) independently with probability p, and let Q be a given set of q “bad” tuple assignments. An instance I = (C,Q) is called satisfiable if there exists an assignment that does not set any of the k-tuples in C to a bad tuple assignment in Q. Suppose that θ, q > 0 are fixed and ε = ε(n) > 0 be such that εlnn/lnlnn→∞. Let k ≥ (1 + θ) log2 n and let \({p_0} = \frac{{\ln 2}}{{q{n^{k - 1}}}}\). We prove that
$$\mathop {\lim }\limits_{n \to \infty } P\left[ {I is satisfiable} \right] = \left\{ {\begin{array}{*{20}c} {1,} & {p \leqslant (1 - \varepsilon )p_0 ,} \\ {0,} & {p \geqslant (1 + \varepsilon )p_0 .} \\ \end{array} } \right.$$
  相似文献   

10.
Let the sequence {λ i } (i≧0) satisfy condition (1.1) and let {A n} (n≧0) be a sequence of bounded self-adjoint operators over a complex Hilbert spaceH. We give a necessary and sufficient condition in order that {A n} (n≧0) should possess the representation (1.2).  相似文献   

11.
Let b ? (n) denote the number of ?-regular partitions of n. In 2012, using the theory of modular forms, Furcy and Penniston presented several infinite families of congruences modulo 3 for some values of ?. In particular, they showed that for α, n ≥ 0, b 25 (32α+3 n+2 · 32α+2-1) ≡ 0 (mod 3). Most recently, congruences modulo powers of 5 for c5(n) was proved by Wang, where c N (n) counts the number of bipartitions (λ12) of n such that each part of λ2 is divisible by N. In this paper, we prove some interesting Ramanujan-type congruences modulo powers of 5 for b25(n), B25(n), c25(n) and modulo powers of 7 for c49(n). For example, we prove that for j ≥ 1, \({c_{25}}\left( {{5^{2j}}n + \frac{{11 \cdot {5^{2j}} + 13}}{{12}}} \right) \equiv 0\) (mod 5 j+1), \({c_{49}}\left( {{7^{2j}}n + \frac{{11 \cdot {7^{_{2j}}} + 25}}{{12}}} \right) \equiv 0\) (mod 7 j+1) and b 25 (32α+3 · n+2 · 32α+2-1) ≡ 0 (mod 3 · 52j-1).  相似文献   

12.
We consider the partial-sum process \( {S}_n(t)={\sum}_{k=0}^{\left\lfloor nt\right\rfloor }{X}_k \) of linear processes \( {X}_n={\sum}_{i=0}^{\infty }{c}_i{\upxi}_{n-i} \) with independent identically distributed innovations {ξ i } belonging to the domain of attraction of α-stable law (0 < α ≤ 2). If |c k |?=?k ?,?k?∈???,?γ?> max(1, 1/α), and \( {\sum}_{k=0}^{\infty}\kern0.5em ck=0 \) (the case of negative memory for the stationary sequence {X n }), then it is known that the normalizing sequence of S n (1) can grow as n 1/α?γ+1 or remain bounded if the signs of the coefficients are constant or alternate, respectively. It is of interest to know whether it is possible, given ? ∈ (0, 1/α ? γ + 1), to change the signs of c k so that the rate of growth of the normalizing sequence would be n ? . In this paper, we give the positive answer: we propose a way of choosing the signs and investigate the finite-dimensional convergence of appropriately normalized S n (t) to linear fractional Lévy motion.  相似文献   

13.
For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Finite-dimensional (not necessarily associative) k-algebras of general type of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent (over k) rational functions of the structure constants. (2) There exists an “algebraic normal form” to which the set of structure constants of every such algebra can be uniquely transformed by means of passing to its new basis—namely, there are two finite systems of nonconstant polynomials on the space of structure constants, {fi}i∈I and {bj}j∈J, such that the ideal generated by the set {fi}i∈I is prime and, for every tuple c of structure constants satisfying the property bj(c) ≠ 0 for all jJ, there exists a unique new basis of this algebra in which the tuple c′ of its structure constants satisfies the property fi(c′) = 0 for all iI.  相似文献   

14.
In the field of several complex variables, the Greene-Krantz Conjecture, whose consequences would be far reaching, has yet to be proven. The conjecture is as follows: Let D be a smoothly bounded domain in ?n. Suppose there exists {g j} ? Aut(D) such that {g j(z)} accumulates at a boundary point p?D for some zD. Then ?D is of finite type at p. In this paper, we prove the following result, yielding further evidence to the probable veracity of this important conjecture: Let D be a bounded convex domain in ?2 with C 2 boundary. Suppose that there is a sequence {g j} ? Aut(D) such that {g j(z)} accumulates at a boundary point for some point zD. Then if p?D is such an orbit accumulation point, ?D contains no non-trivial analytic variety passing through p.  相似文献   

15.
Let M n be a complete, open Riemannian manifold with Ric≥0. In 1994, Grigori Perelman showed that there exists a constant δ n >0, depending only on the dimension of the manifold, such that if the volume growth satisfies \(\alpha_{M}:=\lim_{r\rightarrow \infty}\frac{\operatorname{Vol}(B_{p}(r))}{\omega_{n}r^{n}}\geq 1-\delta_{n}\), then M n is contractible. Here we employ the techniques of Perelman to find specific lower bounds for the volume growth, α(k,n), depending only on k and n, which guarantee the individual k-homotopy group of M n is trivial.  相似文献   

16.
We study the number of nonstationary bounded trajectories of autonomous systems of the form z′ = \(\overline {P_n (z)} \), z = x + iy ∈ C, where P n (z) is a polynomial of degree n with complex coefficients that has k distinct roots, n, k > 1. We prove that the number N of nonstationary bounded trajectories of this system satisfies the following assertions (Theorem 1): (a) N = n + k ? N +, N + = N ?, n + 1 ≤ N +n + k, where N + and N ? are the numbers of system trajectories unbounded as t → +∞ and t → ?∞, respectively; (b) if some r distinct roots \(c_{j_1 } \), ..., \(c_{j_r } \) of the polynomial P n satisfy the relations V n+1 (\(c_{j_1 } \)) = ··· = V n+1 (\(c_{j_r } \)), where V n+1 is the imaginary part of the indeterminate integral of P n , then N\(m_{j_1 } \) + ··· + \(m_{j_r } \) + r ? n ? 1; (c) if k = 2, then the conditions N = 1 and V n+1 (c 1) = V n+1 (c 2) are equivalent. For n = k = 3, we derive a formula for the number of nonstationary bounded trajectories (Theorem 2).  相似文献   

17.
The stationary processes of waiting times {W n } n = 1,2,… in a GI/G/1 queue and queue sizes at successive departure epochs {Q n}n = 1,2,… in an M/G/1 queue are long-range dependent when 3 < κ S < 4, where κ S is the moment index of the independent identically distributed (i.i.d.) sequence of service times. When the tail of the service time is regularly varying at infinity the stationary long-range dependent process {W n } has Hurst index ½(5?κ S ), i.e.
${\rm sup} \left\{h : {\rm lim sup}_{n\to\infty}\, \frac{{\rm var}(W_1+\cdots+W_n)}{n^{2h}} = \infty \right\} = \frac{5-\kappa_S} {2}\,.$
If this assumption does not hold but the sequence of serial correlation coefficients {ρ n } of the stationary process {W n } behaves asymptotically as cn for some finite positive c and α ? (0,1), where α = κ S ? 3, then {W n } has Hurst index ½(5?κ S ). If this condition also holds for the sequence of serial correlation coefficients {r n } of the stationary process {Q n } then it also has Hurst index ½(5κ S )
  相似文献   

18.
Let ξ12,... be independent random variables with distributions F1F2,... in a triangular array scheme (F i may depend on some parameter). Assume that Eξ i = 0, Eξ i 2 < ∞, and put \(S_n = \sum {_{i = 1}^n \;} \xi _i ,\;\overline S _n = \max _{k \leqslant n} S_k\). Assuming further that some regularly varying functions majorize or minorize the “averaged” distribution \(F = \frac{1}{n}\sum {_{i = 1}^n F_i }\), we find upper and lower bounds for the probabilities P(S n > x) and \(P(\bar S_n > x)\). We also study the asymptotics of these probabilities and of the probabilities that a trajectory {S k } crosses the remote boundary {g(k)}; that is, the asymptotics of P(maxkn(S k ? g(k)) > 0). The case n = ∞ is not excluded. We also estimate the distribution of the first crossing time.  相似文献   

19.
Let {X(t), t∈? N } be a fractional Brownian motion in ? d of index H. If L(0,I) is the local time of X at 0 on the interval I?? N , then there exists a positive finite constant c(=c(N,d,H)) such that
$m_\phi\bigl(X^{-1}(0)\cap I\bigr)=cL(0,I),$
where \(\phi(t)=t^{N-dH}(\log\log\frac{1}{t})^{dH/N}\), and m φ (E) is the Hausdorff φ-measure of E. This refines a previous result of Xiao (Probab. Theory Relat. Fields 109: 126–197, 1997) on the relationship between the local time and the Hausdorff measure of zero set for d-dimensional fractional Brownian motion on ? N .
  相似文献   

20.
The skeleton of a polyhedral set is the union of its edges and vertices. Let \(\mathcal {P}\) be a set of fat, convex polytopes in three dimensions with n vertices in total, and let f max be the maximum complexity of any face of a polytope in \(\mathcal {P}\). We prove that the total length of the skeleton of the union of the polytopes in \(\mathcal {P}\) is at most O(α(n)?log? n?logf max) times the sum of the skeleton lengths of the individual polytopes.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号