The kernel of the wreath product of semigroups

All wreath products, in the general sense, of two semigroups with completely simple kernels have completely simple kernels. Presented here are computational characterizations of the primitive idempotents of such a wreath and of the identities and inverses in subgroups of its kernel. Research sponsored by the Air Force Office of Scientific Research, Office of Aerospace Research, United States Air Force, under Grant AF AFOSR 924-67.     

拟正则半群的圈积嵌入与矩阵同余

给出了拟正则半群的圈积嵌入．研究了幂等元集 Ｅ Ｓ 生成的子半群〈 Ｅ Ｓ〉上的矩阵同余可扩张为 Ｓ上的矩阵同余的条件． 特别地,如果〈 Ｅ Ｓ〉上的最小矩阵同余可扩张为 Ｓ上的矩阵同余,那么〈 Ｅ Ｓ〉上的每个矩阵同余可扩张为 Ｓ上的矩阵同余     

A generalization of the rees theorem to a class of regular semigroups

Let S be a regular semigroup for which Green's relations J and D coincide, and which is max-principal in the sense that every element of S is contained in maximal principal right, left and two-sided ideals of S. A construction is given of a max-principal regular semigroup W with J=D, which is also principally separated in the sense that distinct maximal principal right (or left) ideals of S are disjoint, and an epimorphism ψ: W→S that preserves maximality of principal left, right, and two sided ideals, and is in a sense locally one-to-one. If S is completely simple, this construction reduces to the Rees matrix representation of S. The main result of this paper has its origin in an incorrect result contained in the author's doctoral dissertation which was written at the University of California (Berkeley) under Professor John Rhodes. This theorem was first established for finite regular semigroups in [1] (Corollary 2.3), and the present generalization of this result to infinite semigroups was suggested by Professor A. H. Clifford, who the author would like to thank for this as well as his generous encouragement and many helpful editorial suggestions. The author would also like to thank Professor Rhodes for his encouragement.     

Palindromic widths of nilpotent and wreath products

We prove that the nilpotent product of a set of groups A ₁,…,A _s has finite palindromic width if and only if the palindromic widths of A _i ,i=1,…,s,are finite. We give a new proof that the commutator width of F _n ?K is infinite, where F _n is a free group of rank n≥2 and K is a finite group. This result, combining with a result of Fink [9] gives examples of groups with infinite commutator width but finite palindromic width with respect to some generating set.     

Degenerations of binary Lie and nilpotent Malcev algebras

We describe degenerations of four-dimensional binary Lie algebras, and five- and six-dimensional nilpotent Malcev algebras over ?. In particular, we describe all irreducible components of these varieties.     

A generalization of the remainder theorem and factor theorem

We propose a generalization of the classical Remainder Theorem for polynomials over commutative coefficient rings that allows calculating the remainder without using the long division method. As a consequence we obtain an extension of the classical Factor Theorem that provides a general divisibility criterion for polynomials. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities for college and high school students.     

Restricted permutations and the wreath product

Restricted permutations are those constrained by having to avoid subsequences ordered in various prescribed ways. A closed set is a set of permutations all satisfying a given basis set of restrictions. A wreath product construction is introduced and it is shown that this construction gives rise to a number of useful techniques for deciding the finite basis question and solving the enumeration problem. Several applications of these techniques are given.     

A generalization of the cosine addition law on semigroups

Aequationes mathematicae - Our main result is that we describe the solutions $$g,f:S\rightarrow \mathbb {C}$$ of the functional equation $$\begin{aligned} g(x\sigma (y))=g(x)g(y)-f(x)f(y)+\alpha...     

A generalization of the Looman-Menchoff theorem

In this paper we give a generalization of the classical Looman-Menchoff theorem:If f is a complex-valued continuous function of a complex variable in a domain G, f has partial derivatives f _x and f _y everywhere in G and the Cauchy Riemann equations f _x +if _y = 0are satisfied almost everywhere, then f is holomorphic in G. From our generalization of this theorem, we deduce a theroem of Sindalovskii [9] as a corollary and also answer some of the questions raised in [9]. We note in this context that, as far as we know, Sindalovskii’s result is the best published to date in this area.     

A generalization of the rogosinski-rogosinski theorem

We establish necessary and sufficient conditions for numerical functions αj(x), j ∈ N, x ∈ X, under which the conditions K(f _j ⊂ K(f ₁) ∀j≥2 and yield The functions fj(x) are uniformly bounded on the set X and take values in a boundedly compact space L, and K(fj) is the kernel of the function fj. The well-known Rogosinski-Rogosinski theorem follows from the proved statements in the case where X = N, α _j (x) ≡ α_j, and the space L is the m-dimensional Euclidean space.     

A generalization of the Riesz-Fischer theorem

An analog is established, in a certain sense, of the Riesz-Fischer theorem for the space L^P, p1, and a corollary derived.Translated from Matematicheskie Zametki, Vol. 12, No. 4, pp. 365–372, October, 1972.     

A generalization of the Gauss-Lucas theorem

Given a set of points in the complex plane, an incomplete polynomial is defined as the one which has these points as zeros except one of them. The classical result known as Gauss-Lucas theorem on the location of zeros of polynomials and their derivatives is extended to convex linear combinations of incomplete polynomials. An integral representation of convex linear combinations of incomplete polynomials is also given.     

A generalization of the ray-chaudhuri-wilson theorem

Let K = {k₁,…,k_r} and L = {l₁,…,l_s} be two sets of non-negative integers and assume k_i > l_j for every i,j. Let F be an L-intersecting family of subsets of a set of n elements. Assume the size of every set in F is a number from K. We conjecture that |F| ? (ⁿ_s). We prove that our conjecturer is true for any K. (with min k_i ? s) when L = {0,1,…,s ? 1}. We also show that for any K and any L, (with min k_i > max l_j) CALLING STATEMENT : © 1995 John Wiley & Sons, Inc.