Multipliers of a wandering subspace for a shift invariant subspace

For a shift-invariant subspace M of the two variable Hardy space H², we consider the associated wandering subspace M₀=M?zM. Then there exists a nonconstant function ? in H^∞ such that ?M₀⊆M₀ if and only if M=qH² for some inner function q.     

On the hyperinvariant subspace problem

In this paper, we introduce a new equivalence relation, ampliation quasisimilarity, on , more general than quasisimilarity, that preserves the existence of nontrivial hyperinvariant subspaces. We show that if T does not have nontrivial hyperinvariant subspaces for elementary reasons, then T is ampliation quasisimilar to a (BCP)-operator in the class C₀₀. This reduces the hyperinvariant subspace problem for operators in to a very special subcase of itself.     

On the quantitative subspace theorem

In this survey, we give an overview of recent improvements to the quantitative subspace theorem, obtained jointly with R. Ferretti, which follow from the work in [9]. Further, we give a new gap principle with which we can estimate the number of subspaces containing the “small solutions” of the systems of inequalities under consideration. As an introduction, we start with a quantitative version of Roth’s theorem. Bibliography: 28 titles.     

Reconfiguration of subspace partitions

Let $q$ be a fixed prime power and let $V\left(n,q\right)$ denote a vector space of dimension $n$ over the Galois field with $q$ elements. A subspace partition (also called “vector space partition”) of $V\left(n,q\right)$ is a collection of subspaces of $V\left(n,q\right)$ with the property that every nonzero element of $V\left(n,q\right)$ appears in exactly one of these subspaces. Given positive integers $a,b,n$ such that $1\le a<b<n$, we say a subspace partition of $V\left(n,q\right)$ has type $a^x{b}^y$ if it is composed of $x$ subspaces of dimension $a$ and $y$ subspaces of dimension $b$. Let $c=\text{gcd}\left(a,b\right)$. In this paper, we prove that if $b$ divides $n$, then one can (algebraically) construct every possible subspace partition of $V\left(n,q\right)$ of type $a^x{b}^y$ whenever $y\ge \left(q^e?1\right)∕\left(q^b?1\right)$, where $0\le e<ab∕c$ and $n\equiv e\left(\mathrm{mod}ab∕c\right)$. Our construction allows us to sequentially reconfigure batches of $\left(q^a?1\right)∕\left(q^c?1\right)$ subspaces of dimension $b$ into batches of $\left(q^b?1\right)∕\left(q^c?1\right)$ subspaces of dimension $a$. In particular, this accounts for all numerically allowed subspace partition types $a^x{b}^y$ of $V\left(n,q\right)$ under some additional conditions, for example, when $e=b$.     

On the hyperinvariant subspace problem III

In two recent papers (Foias and Pearcy, J. Funct. Anal., in press, Hamid et al., Indiana Univ. Math. J., to appear), the authors reduced the hyperinvariant subspace problem for operators on Hilbert space to the question whether every C₀₀-(BCP)-operator that is quasidiagonal and has spectrum the unit disc has a nontrivial hyperinvariant subspace (n.h.s.). In this note, we continue this study by showing, with the help of a new equivalence relation, that every operator whose spectrum is uncountable, as well as every nonalgebraic operator with finite spectrum, has a hyperlattice (i.e., lattice of hyperinvariant subspaces) that is isomorphic to the hyperlattice of a C₀₀, quasidiagonal, (BCP)-operator whose spectrum is the closed unit disc.     

Explicit subspace designs

A subspace design is a collection {H ₁, H ₂, ...,H _M } of subspaces of \(\mathbb{F}_q^m\) with the property that no low-dimensional subspace W of \(\mathbb{F}_q^m\) intersects too many subspaces of the collection. Subspace designs were introduced by Guruswami and Xing (STOC 2013) who used them to give a randomized construction of optimal rate list-decodable codes over constant-sized large alphabets and sub-logarithmic (and even smaller) list size. Subspace designs are the only non-explicit part of their construction. In this paper, we give explicit constructions of subspace designs with parameters close to the probabilistic construction, and this implies the first deterministic polynomial time construction of list-decodable codes achieving the above parameters.Our constructions of subspace designs are natural and easily described, and are based on univariate polynomials over finite fields. Curiously, the constructions are very closely related to certain good list-decodable codes (folded RS codes and univariate multiplicity codes). The proof of the subspace design property uses the polynomial method (with multiplicities): Given a target low-dimensional subspace W, we construct a nonzero low-degree polynomial P _W that has several roots for each H _i that non-trivially intersects W. The construction of P _W is based on the classical Wronskian determinant and the folded Wronskian determinant, the latter being a recently studied notion that we make explicit in this paper. Our analysis reveals some new phenomena about the zeroes of univariate polynomials, namely that polynomials with many structured roots or many high multiplicity roots tend to be linearly independent.     

Quasidiagonality and the hyperinvariant subspace problem

In a sequence of recent papers, [11], [13], [9] and [5], the authors (together with H. Bercovici and C. Foias) reduced the hyperinvariant subspace problem for operators on Hilbert space to the question whether every C ₀₀-(BCP)-contraction that is quasidiagonal and has spectrum the unit disc has a nontrivial hyperinvariant subspace (n.h.s.). An essential ingredient in this reduction was the introduction of two new equivalence relations, ampliation quasisimilarity and hyperquasisimilarity, defined below. This note discusses the question whether, by use of these relations, a further reduction of the hyperinvariant subspace problem to the much-studied class (N + K) (defined below) might be possible.     

Cyclic subspace codes via subspace polynomials

Subspace codes have been intensely studied in the last decade due to their application in random network coding. In particular, cyclic subspace codes are very useful subspace codes with their efficient encoding and decoding algorithms. In a recent paper, Ben-Sasson et al. gave a systematic construction of subspace codes using subspace polynomials. In this paper, we mainly generalize and improve their result so that we can obtain larger codes for fixed parameters and also we can increase the density of some possible parameters. In addition, we give some relative remarks and explicit examples.     

Deletion-restriction for subspace arrangements

Let A be a subspace arrangement in V with a designated maximal affine subspace A₀. Let A^′=A?{A₀} be the deletion of A₀ from A and A^″={A∩A₀|A∩A₀≠∅} be the restriction of A to A₀. Let M=V?_?A∈AA be the complement of A in V. If A is an arrangement of complex affine hyperplanes, then there is a split short exact sequence, 0→Hk(M^′)→Hk(M)→Hk+1−codimR(A₀)(M^″)→0. In this paper, we determine conditions for when the triple (A,A^′,A^″) of arrangements of affine subspaces yields the above split short exact sequence. We then generalize the no-broken-circuit basis nbc of Hk(M) for hyperplane arrangements to deletion-restriction subspace arrangements.     

Galois generators and the subspace theorem

In an earlier paper [2], a preliminary attempt was made to investigate the divisibility properties of the set of normal integral generators in a tame, prime extension ofQ. The result suggested that the contribution from an arbitrary, fixed, finite set of primes is very small. In this paper we are going to show (1) that it is about as small as it could be and (2) that the results hold in general for tame, abelian extensions (with only a mild technical condition). The approach is twofold, depending upon (a) a good understanding of the geometry of the units in abelian group rings, and (b) the generalisation, due to Schlickewei, of the beautiful and powerful subspace theorem of W. Schmidt. In previous papers, attempts to use diophantine approximation for these problems have been frustrated by the unwieldy nature of the theorems involved. Here we go to the heart of the matter by making an appeal directly to the subspace theorem.     

Extremal sizes of subspace partitions

A subspace partition Π of V?= V(n, q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of Π. The size of Π is the number of its subspaces. Let σ _q (n, t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let ρ _q (n, t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this article, we determine the values of σ _q (n, t) and ρ _q (n, t) for all positive integers n and t. Furthermore, we prove that if n ≥?2t, then the minimum size of a maximal partial t-spread in V(n +?t ?1, q) is σ _q (n, t).     

On subspace arrangements of type

Let denote the subspace arrangement formed by all linear subspaces in given by equations of the form

₁x_i1=₂x_i2==_kx_ik,

where 1i₁<<i_kn and (₁,…,_k){+1,−1}^k.Some important topological properties of such a subspace arrangement depend on the topology of its intersection lattice. In a previous work on a larger class of subspace arrangements by Björner and Sagan (J. Algebraic Combin. 5 (1996) 291–314) the topology of the intersection lattice turned out to be a particularly interesting and difficult case.We prove in this paper that Pure(Π_n,k^±) is shellable, hence that Π_n,k^± is shellable for k>n/2. Moreover, we prove that unless i≡n−2 (mod k−2) or i≡n−3 (mod k−2), and that is free abelian for i≡n−2 (mod k−2). In the special case of Π_2k,k^± we determine homology completely. Our tools are generalized lexicographic shellability, as introduced in Kozlov (Ann. Combin. 1 (1997) 67–90), and a spectral sequence method for the computation of poset homology first used in Hanlon (Trans. Amer. Math. Soc. 325 (1991) 1–37).We state implications of our results on the cohomology of the complements of the considered arrangements.     

Derivation radical subspace arrangements

In this note we study modules of derivations on collections of linear subspaces in a finite dimensional vector space. The central aim is to generalize the notion of freeness from hyperplane arrangements to subspace arrangements. We call this generalization ‘derivation radical’. We classify all coordinate subspace arrangements that are derivation radical and show that certain subspace arrangements of the Braid arrangement are derivation radical. We conclude by proving that under an algebraic condition the subspace arrangement consisting of all codimension c intersections, where c is fixed, of a free hyperplane arrangement are derivation radical.     

Hilbert series of subspace arrangements

The vanishing ideal I of a subspace arrangement V₁∪V₂∪?∪V_m⊆V is an intersection I₁∩I₂∩?∩I_m of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of the product ideal J=I₁I₂?I_m without any assumptions about the subspace arrangement. It turns out that the Hilbert series of J is a combinatorial invariant of the subspace arrangement: it only depends on the intersection lattice and the dimension function. The graded Betti numbers of J are determined by the Hilbert series, so they are combinatorial invariants as well. We will also apply our results to generalized principal component analysis (GPCA), a tool that is useful for computer vision and image processing.     

Regular J-classes of subspace semigroups

Subspace semigroup S(M _n (K)) of the matrix algebra over a field K is studied. Idempotents and regular J-classes are characterized and some symmetries of S(M _n (K)) are established.     

Properties of cyclic subspace regression

Various properties of the regression vector produced by cyclic subspace regression with regard to the meancentered linear regression equation are put forth. In particular, the subspace associated with the creation of is shown to contain a basis that maximizes certain covariances with respect to , the orthogonal projection of onto a specific subspace of the range of X. This basis is constructed. Moreover, this paper shows how the maximum covariance values effect the . Several alternative representations of are also developed. These representations show that is a modified version of the l-factor principal components regression vector , with the modification occurring by a nonorthogonal projection. Additionally, these representations enable prediction properties associated with to be explicitly identified. Finally, methods for choosing factors are spelled out.     

Relaxed Krylov subspace approximation

Recent computational and theoretical studies have shown that the matrix-vector product occurring at each step of a Krylov subspace method can be relaxed as the iterations proceed, i.e., it can be computed in a less exact manner, without degradation of the overall performance. In the present paper a general operator treatment of this phenomenon is provided and a new result further explaining its behavior is presented. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)