Normal series and character values in p-standard table algebras

We investigate the character values and structures of p-standard table algebras (A,B) with o(B) = p^N. If N≤3, then B has a complete normal series. If for every χ∈Irr(B), χ has at most p distinct classes of character values, and if either B has a complete normal series or p = 2, then B is an elementary abelian p-group.     

Table algebras with multiple P-polynomial structures

Using covering numbers we prove that a standard real integral table algebra (A, B) with |B| ≥ 6 has a P-polynomial structure with respect to every b ≠ 1 in B if and only if 2|B|-1 is prime and (A, B) is exactly isomorphic to the Bose-Mesner algebra of the association scheme of the ordinary (2|B|-1)-gon. Then we present an example showing that this result is not true if |B| ≤ 5.     

Ideal-comparability over Regular Rings

We introduce the concept of ideal-comparability condition for regular rings. Let I be an ideal of a regular ring R. If R satisfies the I-comparability condition, then R is one-sided unit-regular if and only if so is R/I. Also, we show that a regular ring R satisfies the general comparability if and only if the following hold： （1） R/I satisfies the general comparability; （2） R satisfies the general I-comparability condition; （3） The natural map B（R） → B（R/I） is surjective.     

Regularity properties of H-graphs

It is proved that if H(u) is non-decreasing and if , then if u (x) describes a graph over a disk B _R (0), with (upward oriented) mean curvature H(u), there is a bound on the gradient that depends only on R, on u (0), and on the particular function H (u). As a consequence a form of Harnack's inequality is obtained, in which no positivity hypothesis appears. The results are qualitatively best possible, in the senses a) that they are false if H is constant, and b) the dependences indicated are essential.?The demonstrations are based on an existence theorem for a nonlinear boundary problem with singular data, which is of independent interest. Received: April 22, 1996     

Walker's Cancellation Theorem

Walker's cancellation theorem says that, if B ⊕ Z is isomorphic to C ⊕ Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of abelian groups where the theorem fails. As a consequence, the original theorem does not have a constructive proof even if B and C are subgroups of the free abelian group on two generators. Both of these results contrast with a group whose endomorphism ring has stable range one, which allows a constructive proof of cancellation and also a proof in any diagram category.     

Injective Hulls of T0 Topological Fibre Spaces

We investigate the existence of injective hulls (with respect to the class of embeddings) in the categories Top ₀/B of T₀ topological fibre spaces over B. We prove that, if f:AB has a restriction to the image injective in Top ₀/f(A), (A,f) has an injective hull in Top ₀/B if and only if f(A) is locally closed in B, where A denotes the union of non-indiscrete fibres of f.     

w-Hyponormal Operators are Subscalar

We prove that if X is a Banach space, R, S B(X), then RS is subscalar (subdecomposable) if and only if SR is. As corollaries, it is shown that w-hyponormal operators (including p-hyponormal (p > 0) and log-hyponormal operators) and their Aluthge transformations and inverse Aluthge transformations are subscalar.     

A WEAKER FORM OF BAER'S SPLITTING PROBLEM OVER VALUATION DOMAINS

Abstract

Eklof-Fuchs [3] have shown that over an arbitrary valuation domain R, the modules B which satisfy Ext 1/R (B,T) = 0 for all torsion R-modules T are precisely the free R-modules. Here we modify the problem and describe all R-modules B for which Ext 1/R (B, T) vanishes for all bounded and for all divisible torsion R-modules T. It is well known that if R is a descrete rank one valuation domain then all torsion—free R-modules B have this property.     

Minimal Blocking Sets in PG(n, 2) and Covering Groups by Subgroups

In this article we prove that a set of points B of PG(n, 2) is a minimal blocking set if and only if ?B? = PG(d, 2) with d odd and B is a set of d + 2 points of PG(d, 2) no d + 1 of them in the same hyperplane. As a corollary to the latter result we show that if G is a finite 2-group and n is a positive integer, then G admits a ? _n+1-cover if and only if n is even and G? (C ₂) ⁿ , where by a ? _m -cover for a group H we mean a set 𝒞 of size m of maximal subgroups of H whose set-theoretic union is the whole H and no proper subset of 𝒞 has the latter property and the intersection of the maximal subgroups is core-free. Also for all n < 10 we find all pairs (m,p) (m > 0 an integer and p a prime number) for which there is a blocking set B of size n in PG(m,p) such that ?B? = PG(m,p).     

Isometries of JB-algebras

A bijective linear mapping between two JB-algebrasA andB is an isometry if and only if it commutes with the Jordan triple products ofA andB. Other algebraic characterizations of isometries between JB-algebras are given. Derivations on a JB-algebraA are those bounded linear operators onA with zero numerical range. For JB-algebras of selfadjoint operators we have: IfH andK are left Hilbert spaces of dimension ≥3 over the same fieldF (the real, complex, or quaternion numbers), then every surjective real linear isometryf fromS(H) ontoS(K) is of the formf(x)=UoxoU ⁻¹ forx inS(H), whereτ is a real-linear automorphism ofF andU is a real linear isometry fromH ontoK withU(λh)=τ(λ)U(h) for λ inF andh inH. Supported by Acción Integrada Hispano-Alemana HA 94 066 B     

On a strong property of the weak subalgebra lattice

In the present paper, we apply results from [Pió1] to prove that for an arbitrary total and locally finite unary algebra A of finite unary type K, its weak subalgebra lattice uniquely determines its strong subalgebra lattice (recall that in the case of total algebras the strong subalgebra lattice is the well-known lattice of all (total) subalgebras). More precisely, we prove that for every unary partial algebra B of the same unary type K, if weak subalgebra lattices of A and B are isomorphic (with A as above), then the strong subalgebra lattices of A and B are isomorphic, and moreover B is also total and locally finite. At the end of this paper we also show the necessity of all the three conditions for A. Received September 5, 1997; accepted in final form October 7, 1998.     

Riemannian submersions with minimal fibers and affine hypersurfaces

Let π : M → B be a Riemannian submersion with minimal fibers. In this article we prove the following results: (1) If M is positively curved, then the horizontal distribution of the submersion is a non-totally geodesic distribution; (2) if M is non-negatively (respectively, negatively) curved, then the fibers of the submersion have non-positive (respectively, negative) scalar curvature; and (3) if M can be realized either as an elliptic proper centroaffine hypersphere or as an improper hypersphere in some affine space, then the horizontal distribution is non-totally geodesic. Several applications are also presented.     

Riemannian submersions with minimal fibers and affine hypersurfaces

Let π : M → B be a Riemannian submersion with minimal fibers. In this article we prove the following results: (1) If M is positively curved, then the horizontal distribution of the submersion is a non-totally geodesic distribution; (2) if M is non-negatively (respectively, negatively) curved, then the fibers of the submersion have non-positive (respectively, negative) scalar curvature; and (3) if M can be realized either as an elliptic proper centroaffine hypersphere or as an improper hypersphere in some affine space, then the horizontal distribution is non-totally geodesic. Several applications are also presented.     

Best Basis Selection for Approximation in L p

We study the approximation of a function class F in L _p by choosing first a basis B and then using n -term approximation with the elements of B . Into the competition for best bases we enter all greedy (i.e., democratic and unconditional [20]) bases for L _p . We show that if the function class F is well-oriented with respect to a particular basis B then, in a certain sense, this basis is the best choice for this type of approximation. Our results extend the recent results of Donoho [9] from L ₂ to L _p , p\neq 2 .     

Quasi-Frobenius Corings and Quasi-Frobenius Extensions

In this article, the notions of a Frobenius pair of functors and Frobenius corings are generalized to an l-QF pair of functors and l-QF corings. We prove that an extension ι:B → A is left quasi-Frobenius if and only if (F ₁,G ₁) is an l-QF pair of functors, where F ₁: _A ? →  _B ? is the restriction of scalars functors, and G ₁ = A? _{B ^?} : _B ? →  _A ? is the induction functor. For an A-coring , we prove that  is an l-QF coring if and only if A → ? is an l-QF extension and _A  is a finitely generated projective modules if and only if (G ₂,F ₂) is an l-QF pair of functors, where G ₂ =  ? _{A ^?} : _A ? →  ? is the induction functor, F ₂:  ? →  _A ? is the forgetful functor, the result of Brzezinski is generalized.     

On Hereditary Coreflective Subcategories of Top

Let A be a topological space which is not finitely generated and CH(A) denote the coreflective hull of A in Top. We construct a generator of the coreflective subcategory SCH(A) consisting of all subspaces of spaces from CH(A) which is a prime space and has the same cardinality as A. We also show that if A and B are coreflective subcategories of Top such that the hereditary coreflective kernel of each of them is the subcategory FG of all finitely generated spaces, then the hereditary coreflective kernel of their join CH(AB) is again FG.     

Subdirect products of hereditary congruence lattices

A congruence lattice L of an algebra A is called power-hereditary if every 0-1 sublattice of Lⁿ is the congruence lattice of an algebra on Aⁿ for all positive integers n. Let A and B be finite algebras. We prove

On subgroups of finite <Emphasis Type="Italic">p</Emphasis>-groups

In §2, we prove that if a 2-group G and all its nonabelian maximal sub-groups are two-generator, then G is either metacyclic or minimal non-abelian. In §3, we consider a similar question for p > 2. In §4 the 2-groups all of whose minimal nonabelian subgroups have order 16 and a cyclic subgroup of index 2, are classified. It is proved, in §5, that if G is a nonmetacyclic two-generator 2-group and A, B, C are all its maximal subgroups with d(A) ≤ d(B) ≤ d(C), then d(C) = 3 and either d(A) = d(B) = 3 (this occurs if and only if G/G′ has no cyclic subgroup of index 2) or else d(A) = d(B) = 2. Some information on the last case is obtained in Theorem 5.3.     

Semigroups that are factors of subdirectly irreducible semigroups by their monolith

Jeek and Kepka [4] proved that a universal algebra A with at least one at least binary operation is isomorphic to the factor of a subdirectly irreducible algebra B by its monolith if and only if the intersection of all of its (nonempty) ideals is nonempty, and that B may be chosen to be finite if A is finite. (By an ideal of A is meant a non-empty subset I of A such that f(a₁, . . . , a_n) I whenever f is an n-ary fundamental operation of A and a₁, . . . , a_n A are elements with a_i I for at least one index i.) In the present paper, we prove that if A is a semigroup, then B may be chosen also to be a semigroup, but that a finite semigroup need not be isomorphic to the factor of a finite subdirectly irreducible semigroup by its monolith.     

Approximate multiplication of tensor matrices based on the individual filtering of factors

Algorithms are proposed for the approximate calculation of the matrix product $ \tilde C $ \tilde C ≈ C = A · B, where the matrices A and B are given by their tensor decompositions in either canonical or Tucker format of rank r. The matrix C is not calculated as a full array; instead, it is first represented by a similar decomposition with a redundant rank and is then reapproximated (compressed) within the prescribed accuracy to reduce the rank. The available reapproximation algorithms as applied to the above problem require that an array containing r ^2d elements be stored, where d is the dimension of the corresponding space. Due to the memory and speed limitations, these algorithms are inapplicable even for the typical values d = 3 and r ∼ 30. In this paper, methods are proposed that approximate the mode factors of C using individually chosen accuracy criteria. As an application, the three-dimensional Coulomb potential is calculated. It is shown that the proposed methods are efficient if r can be as large as several hundreds and the reapproximation (compression) of C has low complexity compared to the preliminary calculation of the factors in the tensor decomposition of C with a redundant rank.