相关论文: Lacunary matrices

We characterize the 1-unconditional subsequences of the canonical basis (e_rc) of elementary matrices in the Schatten-von-Neumann class S^p . The set I of couples (r,c) must be the set of edges of a bipartite graph without cycles of even…

We prove that a sequence $(f_i)_{i=1}^\infty$ of translates of a fixed $f\in L_p(R)$ cannot be an unconditional basis of $L_p(R)$ for any $1\le p<\infty$. In contrast to this, for every $2<p<\infty$, $d\in N$ and unbounded sequence…

The Gram matrix is defined for Bessel sequences by combining synthesis with subsequent analysis operators. If different sequences are used and an operator U is inserted we reach so called U-cross Gram matrices. This can be seen as…

The paper contains three results, the common feature of which is that they deal with the Schatten $p$ class. The first is a presentation of a new complemented subspace of $C_p$ in the reflexive range (and $p\not= 2$). This construction…

In this paper we prove that $M^p_\Lambda$ is almost isometric to $\ell^p$ in the canonical way when $\Lambda$ is lacunary with a large ratio. On the other hand, our approach can be used to study also the Carleson measures for M\"untz spaces…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

For any fixed simple graph $H=(V,E)$ and any fixed $u>0$, we establish the leading order of the exponential rate function for the probability that the number of copies of $H$ in the Erd\H{o}s--R\'enyi graph $G(n,p)$ exceeds its expectation…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

We prove that both multiple Rademacher system and Rademacher chaos possess the property of random unconditional convergence in the space $L_\infty$. This fact combined with some intimate connections between $L_\infty$-norms of linear…

Random matrix ensembles are introduced that respect the local tensor structure of Hamiltonians describing a chain of $n$ distinguishable spin-half particles with nearest-neighbour interactions. We prove a central limit theorem for the…

We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…

In this paper we present a rare combination of abstract results on the spectral properties of slanted matrices and some of their very specific applications to frame theory and sampling problems. We show that for a large class of slanted…

Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters $D$ on $I$, $|I| = \lambda > \aleph_0$, the fact…

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

We prove that, unless assuming additional set theoretical axioms, there are no reflexive space without unconditional sequences of density the continuum. We give for every integer $n$ there are normalized weakly-null sequences of length…

We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…

Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…

We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph is connected, has a perfect fractional matching and,…

It is shown that every normalized weakly null sequence of length $\kappa_{\lambda}$ in a Banach space has a subsequence of length $\lambda$ which is an unconditional basic sequence; here $\kappa_{\lambda}$ is a large cardinal depending on a…

Let E be a Dedekind complete Riesz space with weak unit e, equipped with a conditional expectation operator T. We prove that the spaces Lp(T), with their natural vector-valued norms, are strongly complete, extending the p=2 case of Kuo,…