Structure of the semigroup <Emphasis Type="Italic">OT</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We study the structure of the semigroup OT _n , which is a unique (up to an isomorphism) R-section of the semigroup T _n . For this semigroup, we describe Green relations, determine regular and nilpotent elements, describe maximal nilpotent subsemigroups, and determine the unique irreducible system of generatrices and maximal subsemigroups.     

Maximal properties of some subsemigroups in finite order-preserving transformation semigroups

Let [n] = {1,2,…,n} be a finite set, ordered in the usual way. The order-preserving transformation semigroup O_n is the set of all order-preserving transformations of [n] (excluding the identity mapping) under composition. In this paper we first describe maximal idempotent-generated subsemigroups of O _n, and show that O_n has 2n - 2 such subsemi-groups. Secondly, we investigate maximal regular subsemigroups of O_n , and obtain the number of such subsemigroups as 2n - 3. Thirdly, we describe maximal idempotent-generated regular subsemigroups of O_n , and also obtain their classification and number.     

On the Structure of IO n

Abstract. We study the structure of the semigroup IO _n of all order-preserving partial bijections on an n -element set. For this semigroup we describe maximal subsemigroups, maximal inverse subsemigroups, automorphisms and maximal nilpotent subsemigroups. We also calculate the maximal cardinality for the nilpotent subsemigroups in IO _n which happens to be given by the n -th Catalan number.     

Maximal Subsemigroups of Finite Transformation Semigroups K（n, r）

Let Tn be the full transformation semigroup on the n-element set Xn. For an arbitrary integer r such that 2 ≤ r ≤ n-1, we completely describe the maximal subsemigroups of the semigroup K(n, r) = {α∈Tn : |im α| ≤ r}. We also formulate the cardinal number of such subsemigroups which is an answer to Problem 46 of Tetrad in 1969, concerning the number of subsemigroups of Tn.     

Structure of subsemigroups of factor-powers of finite symmetric groups

For the factor-powerFP(S _n ) of the symmetric groupS _n , we describe regular elements, maximal subgroups, isolated and fully isolated subsemigroups, and also maximal nilpotent subsemigroups whose zero elements coincide with the zero element of the semigroupFP(S _n ). Translated fromMatematicheskie Zametki, Vol. 58, No. 3, pp. 341–354, September, 1995. This research was partially supported by the Foundation for Fundamental Research of the State Committee for Science and Engineering of the Ukraine.     

On the structure of IO n

We study the structure of the semigroup IO _n of all order-preserving partial bijections on an n-element set. For this semigroup we describe maximal subsemigroups, maximal inverse subsemigroups, automorphisms and maximal nilpotent subsemigroups. We also calculate the maximal cardinality for the nilpotent subsemigroups in IO _n which happens to be given by the n-th Catalan number.     

A classification of the maximal idempotent-generated subsemigroups of finite singular semigroups

We describe the maximal idempotent-generated subsemigroups of the finite singular semigroup Sing _n on the finite set X _n ={1,2, \ldots,n} , and count the number of its maximal idempotent-generated subsemigroups. October 21, 1999     

Mathematical modeling of nilpotent subsemigroups of semigroups of contracting transformations of a Boolean

We study mathematical models of the structure of nilpotent subsemigroups of the semigroup PTD(B _n ) of partial contracting transformations of a Boolean, the semigroup TD(B _n ) of full contracting transformations of a Boolean, and the inverse semigroup ISD(B _n ) of contracting transformations of a Boolean. We propose a convenient graphical representation of the semigroups considered. For each of these semigroups, the uniqueness of its maximal nilpotent subsemigroup is proved. For PTD(B _n ) and TD(B _n ) , the capacity of a maximal nilpotent subsemigroup is calculated. For ISD(B _n ), we construct estimates for the capacity of a maximal nilpotent subsemigroup and calculate this capacity for small n. For all indicated semigroups, we describe the structure of nilelements and maximal nilpotent subsemigroups of nilpotency degree k and determine the number of elements and subsemigroups for some special cases.     

A classification of maximal idempotent-generated subsemigroups of finite orientation-preserving singular partial transformation semigroups

In this paper we describe the maximal idempotent-generated subsemigroups of the finite orientation-preserving singular partial transformation semigroup SPOP _n and obtain their complete classification. We also obtain a classification of the maximal idempotent-generated subsemigroups of the finite order-preserving singular partial transformation semigroup PO^k_n\mathit{PO}^{k}_{n} with respect to ≤ _k .     

Maximal Regular Subsemibands of Singn

We describe maximal regular subsemibands of the singular transformation semigroup Sing_n on the set X_n = {1, 2, . . . n} and obtain their complete classification We show that Sing_n has n(n + 1)/2 maximal regular subsemibands, and formulate the cardinal number of such subsemigroups.     

Maximal regular subsemibands of finite order-preserving transformation semigroups <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)

Let O _n be the order-preserving transformation semigroup on X _n . For an arbitrary integer r such that 1≤r≤n−2, we completely describe the maximal regular subsemibands of the semigroup K(n,r)={α∈O _n :|im(α)|≤r}. We also formulate the cardinal number of such subsemigroups.     

The Ideal Structure of Semigroups of Linear Transformations with Upper Bounds on Their Nullity or Defect

Suppose V is a vector space with dim V = p ≥ q ≥ ?₀, and let T(V) denote the semigroup (under composition) of all linear transformations of V. For α ∈ T (V), let ker α and ran α denote the “kernel” and the “range” of α, and write n(α) = dim ker α and d(α) = codim ran α. In this article, we study the semigroups AM(p, q) = {α ∈ T(V):n(α) < q} and AE(p, q) = {α ∈ T(V):d(α) < q}. First, we determine whether they belong to the class of all semigroups whose sets of bi-ideals and quasi-ideals coincide. Then, for each semigroup, we describe its maximal regular subsemigroup, and we characterise its Green's relations and (two-sided) ideals. As a precursor to further work in this area,, we also determine all the maximal right simple subsemigroups of AM(p, q).     

On the Monoid of All Partial Order-Preserving Extensive Transformations

A partial transformation α on an n-element chain X _n is called order-preserving if x ≤ y implies xα ≤yα for all x, y in the domain of α and it is called extensive if x ≤ xα for all x in the domain of α. The set of all partial order-preserving extensive transformations on X _n forms a semiband POE _n . We determine the maximal subsemigroups as well as the maximal subsemibands of POE _n .     

Fully invariant transformations and associated groups

It is well known that the symmetric group S _ntogether with one idempotent of rank n- 1 on a finite n-element set Nserves as a set of generators for the semigroup T _nof all the total transformations on N. It is also well known that the singular part Sing _n of T _n can be generated by a set of idempotents of rank n- 1. The purpose of this paper is to begin an investigation of the way in which Sing_nand its subsemigroups can be generated by the conjugates of a subset of elements of T _n by a subgroup of S _n . We look for the smallest subset of elements of T _n that will serve and, correspondingly, for a characterization of those subgroups of S _n that will serve. Using some techniques from graph theory we prove our main result:the conjugates of a single transformation of rank n- 1 under Gsuffice to generate Sing_nif and only if Gis what we define to be a 2-block transitive subgroup of S _n .     

Volume approximation of smooth convex bodies by three-polytopes of restricted number of edges

For a given convex body K in \Bbb R³{\Bbb R}^3 with C ² boundary, let P ^c _n be the circumscribed polytope of minimal volume with at most n edges, and let P ⁱ _n be the inscribed polytope of maximal volume with at most n edges. Besides presenting an asymptotic formula for the volume difference as n tends to infinity in both cases, we prove that the typical faces of P ^c _n and P ⁱ _n are asymptotically regular triangles and squares, respectively, in a suitable sense.     

Rang maximal pourT_{P^n }

Letk be an algebraically closed field,P ⁿ the n-dimensional projective space overk andT _P ⁿ the tangent vector bundle ofP ⁿ . In this paper I prove the following result: for every integerl, for every non-negative integers, ifZ _s is the union ofs points in sufficiently general position inP ⁿ , then the restriction mapH ⁰(P ⁿ ,T _P ⁿ (l)) →H ⁰(Z _s,T _P ⁿ (l)_{|z s} ) has maximal rank. This result implies that the last non-trivial term of the minimal free resolution of the homogeneous ideal ofZ _s is the conjectured one by the Minimal Resolution Conjecture of Anna Lorenzini (cf. [Lo]).     

Existence varieties with lattices of regular subsemigroups

A class of regular semigroups is called an existence variety, ore-variety, if it is closed under taking homomorphic images, regular subsemigroups, and direct products. For a regular semigroupS, the set of all regular subsemigroups ofS forms a partially ordered set under set inclusion. We determine for whiche-varietiesV the set of regular subsemigroups of members ofV forms a lattice. This includes the known result that the regular subsemigroups of an orthodox semigroup form a lattice.Presented by R. Freese.     

A reversal index for tournament matrices *

Given a tournament matrix T, its reversal indexi_R (T), is the minimum k such that the reversal of the orientation of k arcs in the directed graph associated with T results in a reducible matrix. We give a formula for i_R (T) in terms of the score vector of T which generalizes a simple criterion for a tournament matrix to be irreducible. We show that i_R (T)≤[(n?1)/2] for any tournament matrix T of order n, with equality holding if and only if T is regular or almost regular, according as n is odd or even. We construct, for each k between 1 and [(n?1)/2], a tournament matrix of order n whose reversal index is k. Finally, we suggest a few problems.