Character restriction and relative normal complements
نویسندگان
چکیده
منابع مشابه
Weak Relative Pseudo-Complements of Closure Operators
We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main result is that if a complete lattice L is meet-continuous, then every closure operator on L admits weak relative pseudo-complements with respect to continuous closure operators on L.
متن کاملWeak Relative Pseudo - Complements of Closure OperatorsRoberto
We deene the notion of weak relative pseudo-complement, and we show that, for an arbitrary lattice, the property of weak relative pseudo-complementation is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main interest for this notion is in relation with the theory of closure operators. We prove that if a complete lattice L is completely inf-di...
متن کاملRigidity and Relative Hyperbolicity of Real Hyperbolic Hyperplane Complements
For n > 3 we study spaces obtained from finite volume complete real hyperbolic n-manifolds by removing a compact totally geodesic submanifold of codimension two. We prove that their fundamental groups are relative hyperbolic, co-Hopf, biautomatic, residually hyperbolic, not Kähler, not isomorphic to lattices in virtually connected real Lie groups, have no nontrivial subgroups with property (T),...
متن کاملRelative Chern Character, Boundaries and Index Formulæ
For three classes of elliptic pseudodifferential operators on a compact manifold with boundary which have ‘geometric K-theory’, namely the ‘transmission algebra’ introduced by Boutet de Monvel [5], the ‘zero algebra’ introduced by Mazzeo in [9, 10] and the ‘scattering algebra’ from [16] we give explicit formulæ for the Chern character of the index bundle in terms of the symbols (including norma...
متن کاملOn relative OR-complexity of Boolean matrices and their complements
We construct explicit Boolean square matrices whose rectifier complexity (OR-complexity) differs significantly from the complexity of the complement matrices. This note can be viewed as an addition to the material of [2, §5.6]. Recall that rectifier (m,n)-circuit is an oriented graph with n vertices labeled as inputs and m vertices labeled as outputs. Rectifier circuit (ORcircuit) implements a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1989
ISSN: 0021-8693
DOI: 10.1016/0021-8693(89)90187-7