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.     

Ideals of identities of representations of nilpotent lie algebras

Let L be a Lie algebra, nilpotent of class 2, over an infinite field K, and suppose that the centre C of L is one dimensional; such Lie algebras are called Heisenberg algebras. Let ρ:L→hom _KV be a finite dimensional representation of the Heisenberg algebra L such that ρ(C) contains non-singular linear transformations of V, and denote l(ρ) the ideal of identities for the representation ρ. We prove that the ideals of identities of representations containing I(ρ) and generated by multilinear polynomials satisfy the ACC. Let sl ₂(L) be the Lie algebra of the traceless 2×2 matrices over K, and suppose the characteristic of K equals 2. As a corollary we obtain that the ideals of identities of representations of Lie algebras containing that of the regular representation of sl ₂(K) and generated by multilinear polynomials, are finitely based. In addition we show that one cannot simply dispense with the condition of multilinearity. Namely, we show that the ACC is violated for the ideals of representations of Lie algebras (over an infinite field of characteristic 2) that contain the identities of the regular representation of sl ₂(K).     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Minima of initial segments of infinite sequences of reals

Suppose that 〈x_k〉_k∈? is a countable sequence of real numbers. Working in the usual subsystems for reverse mathematics, RCA₀ suffices to prove the existence of a sequence of reals 〈u_k〉_k∈? such that for each k, u_k is the minimum of {x₀, x₁, …, x_k}. However, if we wish to prove the existence of a sequence of integer indices of minima of initial segments of 〈x_k〉_k∈?, the stronger subsystem WKL₀ is required. Following the presentation of these reverse mathematics results, we will derive computability theoretic corollaries and use them to illustrate a distinction between computable analysis and constructive analysis. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some Properties of Certain Subgroups of Tensor Squares of p-Groups

Let G be a finite p-group of order p ⁿ and ?(G) be the subgroup of the tensor square of G generated by all symbols x ? x, for all x in G. In the present article, we construct an upper bound for the order of ?(G) and any extra special p-group. It is also shown that ?(G) ? ?(G/G′). Using our result, we obtain the explicit structure of the tensor square of G and π₃ SK(G, 1). Finally, the structure of G will be characterized when the bound is attained.     

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.     

The algebra of hyperboloids of revolution

If we change the sign of p ? m columns (or rows) of an m × m positive definite symmetric matrix A, the resultant matrix B has p negative eigenvalues. We give systems of inequalities for the eigenvalues of B and of the matrix obtained from B by deleting one row and column. To obtain these, we first develop characterizations of the eigenvalues of B which are analogous to the minimum-maximum properties of the eigenvalues of a symmetric A, i.e. the Courant-Fischer theorem. These results arose from studying probability distributions on the hyperboloid of revolution

$\text{x}{}^2{}_1\text{+ ? + x}{}^2{}_{\mathrm{m?p}}\text{? x}{}^2{}_{\mathrm{m\; ?\; p\; +\; 1}}\text{? ? ? x}{}^2{}_{\mathrm{m}}\text{= 1}$

. By contrast, the familiar results are associated with the sphere x²₁ + ? + x²_m = 1.     

A characterization of p-bases of rings of constants

We obtain two equivalent conditions for m polynomials in n variables to form a p-basis of a ring of constants of some polynomial K-derivation, where K is a unique factorization domain of characteristic p > 0. One of these conditions involves Jacobians while the other some properties of factors. In the case m = n this extends the known theorem of Nousiainen, and we obtain a new formulation of the Jacobian conjecture in positive characteristic.     

Systems of sets of lengths of Puiseux monoids

In this paper we study the system of sets of lengths of non-finitely generated atomic Puiseux monoids (a Puiseux monoid is an additive submonoid of ${\mathbb{Q}}_{\ge 0}$). We begin by presenting a BF-monoid M with full system of sets of lengths, which means that for each subset S of ${\mathbb{Z}}_{\ge 2}$ there exists an element $x\in M$ whose set of lengths $\mathsf{L}(x)$ is S. It is well known that systems of sets of lengths do not characterize numerical monoids. Here, we prove that systems of sets of lengths do not characterize non-finitely generated atomic Puiseux monoids. In a recent paper, Geroldinger and Schmid found the intersection of systems of sets of lengths of numerical monoids. Motivated by this, we extend their result to the setting of atomic Puiseux monoids. Finally, we relate the sets of lengths of the Puiseux monoid $P=〈1/p|p\text{is prime}〉$ with the Goldbach's conjecture; in particular, we show that $\mathsf{L}(2)$ is precisely the set of Goldbach's numbers.