Characterizations of certain completely regular varieties

Abstract. We characterize orthogroups, local orthogroups and (left,right) cryptogroups within completely regular semigroups by means of absence of certain kind of subsemigroups. For each of these varieties V , we determine the complete set of minimal non-V -varieties. For each of the latter varieties, we determine the lattice of its subvarieties. We then give a generating semigroup and a basis of its identities for every variety which occurs in this way. The subvariety lattices are illustrated by three diagrams.     

Birational maps between generalized Severi-Brauer varieties

A conjecture of Amitsur states that two Severi-Brauer varieties V(A) and V(B) are birationally isomorphic if and only if the underlying algebras A and B are the same degree and generate the same cyclic subgroup of the Brauer group. We examine the question of finding birational isomorphisms between generalized Severi-Brauer varieties. As a first step, we exhibit a birational isomorphism between the generalized Severi-Brauer variety of an algebra and its opposite. We also extend a theorem of P. Roquette to generalized Severi-Brauer varieties and use this to show that one may often reduce the problem of finding birational isomorphisms to the case where each of the separable subfields of the corresponding algebras are maximal, and therefore to the case where the algebras have prime power degree. We observe that this fact allows us to verify Amitsur’s conjecture for many particular cases.     

LR-normal orthogroups

A new kind of regular orthogroups, namely, the LR-normal orthogroups is introduced and investigated. In particular, we will introduce the gearing techniques for fitting semigroup components on a semilattice in the construction of LR-normal orthogroups.     

Maximal Normal Orthogroups in Rings Containing No Infinite Semilattices

Let R be a ring regarded as a multiplicative semigroup which contains no infinite subsemilattices. We investigate subsemigroups of R which are normal orthogroups, and present a construction from which all such maximal normal orthogroups can be obtained. In particular, we construct all maximal normal orthogroups of matrices over a field under matrix multiplication.

Communicated by D. Easdown.     

The algebraic surfaces on which the classical Phragmén-Lindelöf theorem holds

Let V be an algebraic variety in . We say that V satisfies the strong Phragmén-Lindelöf property (SPL) or that the classical Phragmén-Lindelöf Theorem holds on V if the following is true: There exists a positive constant A such that each plurisubharmonic function u on V which is bounded above by |z|+o(|z|) on V and by 0 on the real points in V already is bounded by A| Im z|. For algebraic varieties V of pure dimension k we derive necessary conditions on V to satisfy (SPL) and we characterize the curves and surfaces in which satisfy (SPL). Several examples illustrate how these results can be applied.     

Secant varieties and Hirschowitz bound on vector bundles over a curve

For a vector bundle V of rank n over a curve X and for each integer r in the range 1 ≤ r ≤ n ? 1, the Segre invariant s _r is defined by generalizing the minimal self-intersection number of the sections on a ruled surface. In this paper we generalize Lange and Narasimhan’s results on rank 2 bundles which related the invariant s ₁ to the secant varieties of the curve inside certain extension spaces. For any n and r, we find a way to get information on the invariant s _r from the secant varieties of certain subvariety of a scroll over X. Using this geometric picture, we obtain a new proof of the Hirschowitz bound on s _r .     

Matrix regular operator space and operator system

We establish a relationship between Schreiner's matrix regular operator space and Werner's (nonunital) operator system. For a matrix ordered operator space V with complete norm, we show that V is completely isomorphic and complete order isomorphic to a matrix regular operator space if and only if both V and its dual space V^∗ are (nonunital) operator systems.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.     

On n-clone extensions of algebras

We consider algebras of a given type with a set F of fundamental operation symbols and without nullary operations. In this paper we generalize notions and results of [12]. An identity is called clone compatible if and are the same variable or the sets of fundamental operation symbols in and are nonempty and identical. In connection with these identities we define in section 1 a construction called an n-clone extension of an algebra for where n is an integer and we study its properties. For a variety V we denote by V ^c the variety defined by all clone compatible identities from Id (V). We also define a variety V ^c,n called the n-clone extension of V. These two varieties are strictly connected. In section 2 under some assumptions we give representations of algebras from V ^c,n and V ^c using n-clone extensions of algebras from V. We also find equational bases of these varieties. In section 3 we apply these results to some important varieties. In section 4 we find minimal generics of V ^c when V is the variety of distributive lattices or the variety of Boolean algebras. Received November 27, 1996; accepted in final form March 19, 1998.     

The complete optimal stars-clustering-tree problem

We consider the following complete optimal stars-clustering-tree problem: Given a complete graph G=(V,E) with a weight on every edge and a collection of subsets of V, we want to find a minimum weight spanning tree T such that each subset of the vertices in the collection induces a complete star in T. One motivation for this problem is to construct a minimum cost (weight) communication tree network for a collection of (not necessarily disjoint) groups of customers such that each group induces a complete star. As a result the network will provide a “group broadcast” property, “group fault tolerance” and “group privacy”. We present another motivation from database systems with replications. For the case where the intersection graph of the subsets is connected we present a structure theorem that describes all feasible solutions. Based on it we provide a polynomial algorithm for finding an optimal solution. For the case where each subset induces a complete star minus at most k leaves we prove that the problem is NP-hard.     

New Braided Crossed Categories and Drinfel'd Quantum Double for Weak Hopf Group Coalgebras

A simple and nice structure theorem for orthogroups was given by Petrich in 1987. In this paper, we consider a generalized orthogroup, that is, a quasi-completely regular semigroup with a band of idempotents in which its set of regular elements, namely, RegS, forms an ideal of S. A method of construction of such semigroups is provided and as a result, the Petrich structure theorem of orthogroups becomes an immediate corollary of our theorem on generalized orthogroups. An example of such generalized orthogroup is also constructed. This example provides some useful information for the construction of various kinds of quasi-completely regular semigroups.     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.     

Essential variables in hypersubstitutions

For a variety V of algebras of type , we consider the set M _i (V) of all hypersubstitutions such that the variable x _i is essential in the term (f) with respect to the variety V. We will give a complete answer to the question for which varieties V of type = (n) the set M _i (v) of hypersubstitutions forms a monoid. This is important since to every monoid of hypersubstitutions there corresponds a complete sublattice of the lattice of all varieties of algebras of the given type. For varieties of semigroups we get the monoid of all leftmost and all rightmost hypersubstitutions. Received December 2, 1998; accepted in final form December 18, 2000.