Search results for "vector"
showing 10 items of 2660 documents
Shrinking and boundedly complete Schauder frames in Fréchet spaces
2014
We study Schauder frames in Fréchet spaces and their duals, as well as perturbation results. We define shrinking and boundedly complete Schauder frames on a locally convex space, study the duality of these two concepts and their relation with the reflexivity of the space. We characterize when an unconditional Schauder frame is shrinking or boundedly complete in terms of properties of the space. Several examples of concrete Schauder frames in function spaces are also presented.
The support localization property of the strongly embedded subspaces of banach function spaces
2015
[EN] Motivated by the well known Kadec-Pelczynski disjointifcation theorem, we undertake an analysis of the supports of non-zero functions in strongly embedded subspaces of Banach functions spaces. The main aim is to isolate those properties that bring additional information on strongly embedded subspaces. This is the case of the support localization property, which is a necessary condition fulflled by all strongly embedded subspaces. Several examples that involve Rademacher functions, the Volterra operator, Lorentz spaces or Orlicz spaces are provided.
Periodicity vectors for labelled trees
2003
AbstractThe concept of a periodicity vector is introduced in the context of labelled trees, and some new periodicity theorems are obtained. These results constitute generalizations of the classical periodicity theorem of Fine and Wilf for words. The concept of a tree congruence is also generalized and the isomorphism between the lattice of tree congruences and the lattice of unlabelled trees (prefix codes) is established.
Some properties of [tr(Q2p)]12p with application to linear minimax estimation
1990
Abstract A nondifferentiable minimization problem is considered which occurs in linear minimax estimation. This problem is solved by replacing the nondifferentiable maximal eigenvalue of a real nonnegative definite matrix Q with [tr( Q 2 p )] 1/2 p . It is shown that any descent algorithm with inexact step-length rule can be used to obtain linear minimax estimators for the parameter vector of a parameter-restricted linear model.
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
2010
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the text s requires to find a substring t of s with p(t) = q. The corresponding decision problem is to verify whether at least one such match exists. So, for example for the alphabet Σ = {a, b, c}, the string s = abaccbabaaa has Parikh vector p(s) = (6,3,2), and the Parikh vector q = (2,1,1) appears once in s in position (1,4). Like its more precise counterpart, the renown Exact String Matching, Jumbled Pattern Matching has ubiquitous applications, e.g., string matching with a dyslectic word processor, table rearrangements, …
Lineability of non-differentiable Pettis primitives
2014
Let \(X\) be an infinite-dimensional Banach space. In 1995, settling a long outstanding problem of Pettis, Dilworth and Girardi constructed an \(X\)-valued Pettis integrable function on \([0,1]\) whose primitive is nowhere weakly differentiable. Using their technique and some new ideas we show that \(\mathbf{ND}\), the set of strongly measurable Pettis integrable functions with nowhere weakly differentiable primitives, is lineable, i.e., there is an infinite dimensional vector space whose nonzero vectors belong to \(\mathbf{ND}\).
Scalable Ellipsoidal Classification for Bipartite Quantum States
2008
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as s…
Deciding reachability for planar multi-polynomial systems
1996
In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state space corresponds to the standard Euclidean plane, which is partitioned into a finite number of (polyhedral) regions. To each of these regions is assigned some vector field which governs the dynamical behaviour of the system within this region. We prove the decidability of point to point and region to region reachability problems for planar hybrid systems for the case when trajectories within the regions can be described by polynomials of arbitrary degree.
Bounded elements of C*-inductive locally convex spaces
2013
The notion of bounded element of C*-inductive locally convex spaces (or C*-inductive partial *-algebras) is introduced and discussed in two ways: The first one takes into account the inductive structure provided by certain families of C*-algebras; the second one is linked to the natural order of these spaces. A particular attention is devoted to the relevant instance provided by the space of continuous linear maps acting in a rigged Hilbert space.
Property (R) under perturbations
2012
Property (R) holds for a bounded linear operator $${T \in L(X)}$$ , defined on a complex infinite dimensional Banach space X, if the isolated points of the spectrum of T which are eigenvalues of finite multiplicity are exactly those points λ of the approximate point spectrum for which λI − T is upper semi-Browder. In this paper we consider the permanence of this property under quasi nilpotent, Riesz, or algebraic perturbations commuting with T.