Equational Theories for Classes of Finite Semigroups

It is proved that there exists an infinite sequence of finitely based semigroup varieties such that, for all i, an equational theory for and for the class of all finite semigroups in is undecidable while an equational theory for and for the class of all finite semigroups in is decidable. An infinite sequence of finitely based semigroup varieties is constructed so that, for all i, an equational theory for and for the class of all finite semigroups in is decidable whicle an equational theory for and for the class of all finite semigroups in is not.     

Relatively Hyperimmune Relations on Structures

Let be a computable structure and let R be an additional relation on its domain. We establish a necessary and sufficient condition for the existence of an isomorphic copy of such that the image of R is h-simple (h-immune) relative to .     

The property of having independent basis in semigroup varieties

There exist independently based semigroup varieties and , , such that has no cover in the interval [ ; ].Translated from Algebra i Logika, Vol. 44, No. 1, pp. 81–96, January–February, 2005.     

On the Irreducibility of Commuting Varieties Associated with Involutions of Simple Lie Algebras

Let be a reductive Lie algebra over an algebraically closed field of characteristic zero and an arbitrary -grading. We consider the variety , which is called the commuting variety associated with the -grading. Earlier it was proved by the author that is irreducible, if the -grading is of maximal rank. Now we show that is irreducible for and (E₆,F₄). In the case of symmetric pairs of rank one, we show that the number of irreducible components of is equal to that of nonzero non--regular nilpotent G ₀-orbits in . We also discuss a general problem of the irreducibility of commuting varieties.     

Varieties Defined by Permutations

We continue to study interrelations between permutative varieties and the cyclic varieties defined by cycles of the form . A criterion is given determining whether a cyclic variety is interpretable in . For a permutation without fixed elements, it is stated that a set of primes for which is interpretable in in the lattice is finite. It is also proved that for distinct primes , the Helly number of a type in coincides with dimension of the dual type and equals .     

Factorizations of One-Generated Composition Formations

A non-empty formation of finite groups is said to be solubly saturated, or we call it a composition formation, if every finite group G having a normal subgroup N such that belongs to . An intersection of all composition formations containing a given group G is denoted cformG. Conditions are described under which has the form , where .     

Quasivariety Generated by Free Metabelian and 2-Nilpotent Groups

Let qG be a quasivariety generated by a group G and be a non-Abelian quasivariety of groups with a finite lattice of subquasivarieties. Suppose is contained in a quasivariety generated by the following two groups: a free 2-nilpotent group F₂( ₂) of rank 2 and a free metabelian (i.e., with an Abelian commutant) group F₂( ₂) of rank 2. It is proved that either = qF₂( ₂) or = qF₂( ₂) in this instance.__________Translated from Algebra i Logika, Vol. 44, No. 4, pp. 389–398, July–August, 2005.     

Test Rank for Some Free Polynilpotent Groups

We prove a theorem on possible test rank values for groups of the form . It is shown that test rank of a free polynilpotent group is equal to or , for any and every collection of classes. Moreover, for and .     

Trajectory and Global Attractors of Three-Dimensional Navier--Stokes Systems

We construct the trajectory attractor of a three-dimensional Navier--Stokes system with exciting force . The set consists of a class of solutions to this system which are bounded in , defined on the positive semi-infinite interval of the time axis, and can be extended to the entire time axis so that they still remain bounded-in- solutions of the Navier--Stokes system. In this case any family of bounded-in- solutions of this system comes arbitrary close to the trajectory attractor . We prove that the solutions are continuous in t if they are treated in the space of functions ranging in . The restriction of the trajectory attractor to , , is called the global attractor of the Navier--Stokes system. We prove that the global attractor thus defined possesses properties typical of well-known global attractors of evolution equations. We also prove that as the trajectory attractors and the global attractors of the -order Galerkin approximations of the Navier--Stokes system converge to the trajectory and global attractors and , respectively. Similar problems are studied for the cases of an exciting force of the form depending on time and of an external force rapidly oscillating with respect to the spatial variables or with respect to time .     

A Question in the Theory of Totally Local Formations of Finite Groups

It is proved that all proper totally local subformations of a non one-generated totally local formation of finite groups are one-generated iff coincides with a formation of all soluble -groups, where ||=2.     

Lattice Ordered Polynomial Algebras

In this paper we define a lattice order on a set F of binary functions. We then provide necessary and sufficient conditions for the resulting algebra F to be a distributive lattice or a Boolean algebra. We also prove a Cayley theorem for distributive lattices by showing that for every distributive lattice , there is an algebra F of binary functions, such that is isomorphic to F and we show that F is a distributive lattice iff the operations and are idempotent and cummutative, showing that this result cannot be generalized to non-distributive lattices or quasilattices without changing the definitions of and . We also examine the equational properties of an Algebra for which , now defined on the set of binary -polynomials is a lattice or Boolean algebra.     

Bernstein-Type Theorems and Uniqueness Theorems

Let be an entire function of finite type with respect to finite order and let be a subset of an open cone in a certain n-dimensional subspace (the smaller , the sparser ). We assume that this cone contains a ray 0} \right\}$$ " align="middle" border="0"> . It is shown that the radial indicator of at any point may be evaluated in terms of function values at points of the discrete subset . Moreover, if tends to zero fast enough as over , then this function vanishes identically. To prove these results, a special approximation technique is developed. In the last part of the paper, it is proved that, under certain conditions on and , which are close to exact conditions, the function bounded on is bounded on the ray.     

Automorphisms of Aschbacher Graphs

If a regular graph of valence and diameter has vertices, then , which was proved by Moore (cf. [1]). Graphs for which this non-strict inequality turns into an equality are called Moore graphs. Such have an odd girth equal to . The simplest example of a Moore graph is furnished by a -triangle. Damerell proved that a Moore graph of valence has diameter 2. In this case , the graph is strongly regular with and , and the valence is equal to 3 (Peterson's graph), to 7 (Hoffman–Singleton's graph), or to 57. The first two graphs are of rank 3. Whether a Moore graph of valence exists is not known; yet, Aschbacher proved that the Moore graph with will not be a rank 3 graph. We call the Moore graph with the Aschbacher graph. Cameron showed that such cannot be vertex transitive. Here, we treat subgraphs of fixed points of Moore graph automorphisms and an automorphism group of the hypothetical Aschbacher graph for the case where that group contains an involution.     

Quotient Groups of Groups of Certain Classes

For an arbitrary variety of groups and an arbitrary class of groups that is closed on quotient groups, we prove that a quotient group G/N of the group G possesses an invariant system with - and -factors (respectively, is a residually -group) if G possesses an invariant system with - and -factors (respectively, is a residually -group) and N (respectively, N is a maximal invariant -subgroup of the group G).     

On Dense Subspaces Satisfying Stronger Separation Axioms

We prove that it is independent of ZFC whether every Hausdorff countable space of weight less than has a dense regular subspace. Examples are given of countable Hausdorff spaces of weight which do not have dense Urysohn subspaces. We also construct an example of a countable Urysohn space, which has no dense completely Hausdorff subspace. On the other hand, we establish that every Hausdorff space of -weight less than has a dense completely Hausdorff (and hence Urysohn) subspace. We show that there exists a Tychonoff space without dense normal subspaces and give other examples of spaces without "good" dense subsets.     

On a Problem of the Theory of Multiply Local Formations

We describe the -closed n-multiply local formations such that the lattice of all -closed n-multiply local formations between and is Boolean.     

Levi Classes Generated by Nilpotent Groups

Let be a class of all groups G for which the normal closure (x) ^G of every element x belongs to a class . is a Levi class generated by . Let and ₀ be classes of finitely generated nilpotent groups and of torsion-free, finitely generated, nilpotent groups, respectively. We prove that and , and so and . It is shown that quasivarieties and are closed under free products, and that each contains at most one maximal proper subquasivariety. It is also proved that is closed under free products if so is .     

Constructive and Non-Constructive Infinite Formulas in Computable Structures

A transition from arbitrary -formulas to computable formulas in the class of computable structures is considered. It is shown that transition of a certain type is possible which doubles the complexity of the formulas. In addition, the complexity jump is analyzed for the transition from an arbitrary Scott family consisting of -formulas to a computable Scott family in a fixed computable structure. Exact estimates of this jump are found.