Simple and hyperhypersimple vector spaces

1978 ◽  
Vol 43 (2) ◽  
pp. 260-269 ◽  
Author(s):  
Allen Retzlaff

AbstractLet V∞ be a fixed, fully effective, infinite dimensional vector space. Let be the lattice consisting of the recursively enumerable (r.e.) subspaces of V∞, under the operations of intersection and weak sum (see §1 for precise definitions). In this article we examine the algebraic properties of .Early research on recursively enumerable algebraic structures was done by Rabin [14], Frölich and Shepherdson [5], Dekker [3], Hamilton [7], and Guhl [6]. Our results are based upon the more recent work concerning vector spaces of Metakides and Nerode [12], Crossley and Nerode [2], Remmel [15], [16], and Kalantari [8].In the main theorem below, we extend a result of Lachlan from the lattice of r.e. sets to . We define hyperhypersimple vector spaces, discuss some of their properties and show if A, B ∈ , and A is a hyperhypersimple subspace of B then there is a recursive space C such that A + C = B. It will be proven that if V ∈ and the lattice of superspaces of V is a complemented modular lattice then V is hyperhypersimple. The final section contains a summary of related results concerning maximality and simplicity.

1993 ◽  
Vol 114 (2) ◽  
pp. 303-319 ◽  
Author(s):  
John Fountain ◽  
Andrew Lewin

AbstractIn 1966, J. M. Howie characterized the self-maps of a set which can be written as a product (under composition) of idempotent self-maps of the same set. In 1967, J. A. Erdos considered the analogous question for linear maps of a finite dimensional vector space and in 1985, Reynolds and Sullivan solved the problem for linear maps of an infinite dimensional vector space. Using the concept of independence algebra, the authors gave a common generalization of the results of Howie and Erdos for the cases of finite sets and finite dimensional vector spaces. In the present paper we introduce strong independence algebras and provide a common generalization of the results of Howie and Reynolds and Sullivan for the cases of infinite sets and infinite dimensional vector spaces.


1984 ◽  
Vol 49 (4) ◽  
pp. 1125-1136 ◽  
Author(s):  
R.G. Downey ◽  
J.B. Remmel

Let V∞ be a fully effective infinite dimensional vector space over a recursive field F. That is, we assume that the universe of V∞ is a recursive set, the operations of addition and scalar multiplication are recursive, and there is a uniform effective procedure to decide whether any finite set {υ0, …, υn} of vectors from V∞ is independent. The lattice of recursively enumerable subspaces has been extensively studied since its introduction by Metakides and Nerode [MN1] (see for example, [Do2], [Gu], [KR], [Re1], [Re2], and [Sh]). For those unfamiliar with the literature on , we shall give a list of basic definitions required for this paper in §0.It is well known that complements in V∞ are not unique. For example, in [Re2] Remmel constructed r.e. spaces M1 and M2 and co-r.e. spaces Q1 and Q2 such that for all i, j ∈ {1, 2}, Mi ⊕ Qj = V∞ and M1 is supermaximal, M2 is not maximal, Q1 has a fully extendible basis, and Q2 has no extendible basis. We say a subspace Q of V∞ is fully co-r.e. if Q is generated by a co-r.e. subset of some recursive basis of V∞. Downey [Do2] has shown that every r.e. subspace of V∞ has a complement which is a fully co-r.e. subspace. Moreover suppose Q is any fully co-r.e. subspace, say Q = (C)* where C is a co-r.e. subset of a recursive basis B of V∞; if C is nonrecursive, then it is shown in [Do2] that Q has a decidable complement as well as a nondecidable nowhere simple complement.


2019 ◽  
Vol 19 (05) ◽  
pp. 2050086 ◽  
Author(s):  
T. Tamizh Chelvam ◽  
K. Prabha Ananthi

Let [Formula: see text] be a k-dimensional vector space over a finite field [Formula: see text] with a basis [Formula: see text]. The nonzero component graph of [Formula: see text], denoted by [Formula: see text], is a simple undirected graph with vertex set as nonzero vectors of [Formula: see text] such that there is an edge between two distinct vertices [Formula: see text] if and only if there exists at least one [Formula: see text] along which both [Formula: see text] and [Formula: see text] have nonzero scalars. In this paper, we find the vertex connectivity and girth of [Formula: see text]. We also characterize all vector spaces [Formula: see text] for which [Formula: see text] has genus either 0 or 1 or 2.


Author(s):  
Suzana Mendes-Gonçalves ◽  
R. P. Sullivan

Given an infinite-dimensional vector space V, we consider the semigroup GS (m, n) consisting of all injective linear α: V → V for which codim ran α = n, where dim V = m ≥ n ≥ ℵ0. This is a linear version of the well-known Baer–Levi semigroup BL (p, q) defined on an infinite set X, where |X| = p ≥ q ≥ ℵ0. We show that, although the basic properties of GS (m, n) are the same as those of BL (p, q), the two semigroups are never isomorphic. We also determine all left ideals of GS (m, n) and some of its maximal subsemigroups; in this, we follow previous work on BL (p, q) by Sutov and Sullivan as well as Levi and Wood.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Le Anh Vinh

International audience We show that if the cardinality of a subset of the $(2k-1)$-dimensional vector space over a finite field with $q$ elements is $\gg q^{2k-1-\frac{1}{ 2k}}$, then it contains a positive proportional of all $k$-simplexes up to congruence. Nous montrons que si la cardinalité d'un sous-ensemble de l'espace vectoriel à $(2k-1)$ dimensions sur un corps fini à $q$ éléments est $\gg q^{2k-1-\frac{1}{ 2k}}$, alors il contient une proportion non-nulle de tous les $k$-simplexes de congruence.


1985 ◽  
Vol 98 ◽  
pp. 139-156 ◽  
Author(s):  
Yasuo Teranishi

Let G be a connected linear algebraic group, p a rational representation of G on a finite-dimensional vector space V, all defined over C.


Sign in / Sign up

Export Citation Format

Share Document