Related papers: Characterization of greedy bases in Banach spaces
Given a frequency $\lambda=(\lambda_n)$, we consider the Hardy spaces $ \mathcal{H}_p^\lambda$ of $\lambda$-Dirichlet series $ D = \sum_n a_n e^{-\lambda_n s}$ and study the asymptotic behavior of the upper and lower democracy functions of…
If a Banach space is saturated with basic sequences whose linear span embeds into the linear span of any subsequence, then it contains a minimal subspace. It follows that any Banach space is either ergodic or contains a minimal subspace.…
We consider questions posed in a recent paper of Mandayam, Bandyopadhyay, Grassl and Wootters [10] on the nature of "unextendible mutually unbiased bases." We describe a conceptual framework to study these questions, using a connection…
We consider learning a convex combination of basis models, and present some new theoretical and empirical results that demonstrate the effectiveness of a greedy approach. Theoretically, we first consider whether we can use linear, instead…
For nonuniform exponentially bounded evolution families defined on Banach spaces, we introduce a class of Banach function spaces, whose norms are completely determined by the nonuniform behaviour of the corresponding evolution family. We…
We show for several computational problems how classical greedy algorithms for special cases can be derived in a simple way from dynamic programs for the general case: interval scheduling (restricted to unit weights), knapsack (restricted…
A generalization of Lozanovskii's result is proved. Let E be $k$-dimensional subspace of an $n$-dimensional Banach space with unconditional basis. Then there exist $x_1,..,x_k \subset E$ such that $B_E \p \subset \p absconv\{x_1,..,x_k\}$…
We provide a new extension of Pitt's theorem for compact operators between quasi-Banach lattices, which permits to describe unconditional bases of finite direct sums of Banach spaces $\mathbb{X}_{1}\oplus\dots\oplus\mathbb{X}_{n}$ as direct…
Probabilistic independence can dramatically simplify the task of eliciting, representing, and computing with probabilities in large domains. A key technique in achieving these benefits is the idea of graphical modeling. We survey existing…
We construct a reflexive Banach space $X_\mathcal{D}$ with an unconditional basis such that all spreading models admitted by normalized block sequences in $X_\mathcal{D}$ are uniformly equivalent to the unit vector basis of $\ell_1$, yet…
We consider positional numeration systems with negative real base $-\beta$, where $\beta>1$, and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
We present a transition-based parser that jointly produces syntactic and semantic dependencies. It learns a representation of the entire algorithm state, using stack long short-term memories. Our greedy inference algorithm has linear time,…
We identify a quantum lift of the greedy basis for rank 2 coefficient-free cluster algebras. Our main result is that our construction does not depend on the choice of initial cluster, that it builds all cluster monomials, and that it…
We describe the spaces $H^1(R)$ and BMO$(R)$ in terms of their closely related, simpler dyadic and two-sided counterparts. As a result of these characterizations we establish when a bounded linear operator defined on dyadic or two-sided…
It is well known that in the calculus of variations and in optimization there exist many formulations of the fundamental propositions on the attainment of the infima of sequentially weakly lower semicontinuous coercive functions on…
Reduced bases have been introduced for the approximation of parametrized PDEs in applications where many online queries are required. Their numerical efficiency for such problems has been theoretically confirmed in \cite{BCDDPW,DPW}, where…
Based on maximally entangled states, we explore the constructions of mutually unbiased bases in bipartite quantum systems. We present a new way to construct mutually unbiased bases by difference matrices in the theory of combinatorial…
A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. Denote the minimum size of a base for $G$ by $b(G)$. There is a…
We argue that a description of supersymmetric extended objects from a unified geometric point of view requires an enlargement of superspace. To this aim we study in a systematic way how superspace groups and algebras arise from Grassmann…