Tensor Products of Torsion Free C n -Modules of Finite Degree and Finite Dimensional Modules

It is known that every torsion free C _n -module of finite degree is completely reducible. In this article, we provide a formula for the decomposition of the tensor product of a simple torsion free C _n -module of finite degree with a simple finite dimensional C _n -module. As a byproduct we obtain a recursion formula for the decomposition of the tensor product of any two simple finite dimensional C _n -modules.     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003     

On locally finite groups with a small centralizer of a four-subgroup

The main result of the paper is the following theorem. Let G be a locally finite group having a four-subgroup V such that C _G (V) is finite. Suppose that V contains two involutions v ₁ and v ₂ such that the centralizers C _G (v ₁) and C _G (v ₂) have finite exponent. Then G is almost locally soluble and [G, V]′ has finite exponent. Since [G, V] has finite index in G, the result gives a fairly detailed information about the structure of G.     

Finite volume method based on stabilized finite elements for the nonstationary Navier–Stokes problem

A finite volume method based on stabilized finite element for the two‐dimensional nonstationary Navier–Stokes equations is investigated in this work. As in stabilized finite element method, macroelement condition is introduced for constructing the local stabilized formulation of the nonstationary Navier–Stokes equations. Moreover, for P₁ ? P₀ element, the H¹ error estimate of optimal order for finite volume solution (u_h,p_h) is analyzed. And, a uniform H¹ error estimate of optimal order for finite volume solution (u_h, p_h) is also obtained if the uniqueness condition is satisfied. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Locally Finite Groups with All Subgroups Normal-by-(Finite Rank)

A group is said to have finite (special) rank ≤ sif all of its finitely generated subgroups can be generated byselements. LetGbe a locally finite group and suppose thatH/H_Ghas finite rank for all subgroupsHofG, whereH_Gdenotes the normal core ofHinG. We prove that thenGhas an abelian normal subgroup whose quotient is of finite rank (Theorem 5). If, in addition, there is a finite numberrbounding all of the ranks ofH/H_G, thenGhas an abelian subgroup whose quotient is of finite rank bounded in terms ofronly (Theorem 4). These results are based on analogous theorems on locally finitep-groups, in which case the groupGis also abelian-by-finite (Theorems 2 and 3).     

Finite L 2-gain with nondifferentiable storage functions

We consider affine control systems with the finite L₂-gain property in the case the storage function is nondifferentiable. We generalize some classical results concerning the connection of the finite L₂-gain property with the stability properties of the unforced system, the characterization of finite L₂-gain by means of partial differential inequalities of the Hamilton-Jacobi type and the problem of giving to a system the finite L₂-gain property by means of a feedback law. Moreover, we introduce and study the apparently new notion of exact storage function.     

Theories of linear order

LetT be a complete theory of linear order; the language ofT may contain a finite or a countable set of unary predicates. We prove the following results. (i) The number of nonisomorphic countable models ofT is either finite or 2^ω. (ii) If the language ofT is finite then the number of nonisomorphic countable models ofT is either 1 or 2^ω. (iii) IfS ₁(T) is countable then so isS _n(T) for everyn. (iv) In caseS ₁(T) is countable we find a relation between the Cantor Bendixon rank ofS ₁(T) and the Cantor Bendixon rank ofS _n(T). (v) We define a class of modelsL, and show thatS ₁(T) is finite iff the models ofT belong toL. We conclude that ifS ₁(T) is finite thenT is finitely axiomatizable. (vi) We prove some theorems concerning the existence and the structure of saturated models. Most of the results in this paper appeared in the author’s Master of Science thesis which was prepared at the Hebrew University under the supervision of Professor H. Gaifman.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

Generic modules over the quantum groupU t (sl(2)) att a root of unit

LetA be a finite dimensionalk-algebra, an indecomposable (left)A-moduleM is called generic providedM is infinitek-dimensional but finite length as (right) End _A M-module. In this paper we given the explicit structure of generic modules and their endomorphism rings over the finite dimensional quantum groupU _t (sl(2)) att being a root of unit.     

Extending partial isomorphisms on finite structures

We prove the following theorem:Let A be a finite structure in a fixed finite relational language,p ₁,...,p _m partial isomorphisms of A. Then there exists a finite structure B, and automorphismsf _i of B extending thep _i 's. This theorem can be used to prove the small index property for the random structure in this language. A special case of this theorem is, if A and B are hypergraphs. In addition we prove the theorem for the case of triangle free graphs.     

Fixed points of finite groups acting on generalised Thompson groups

We study centralisers of finite order automorphisms of the generalised Thompson groups F _n,∞ and conjugacy classes of finite subgroups in finite extensions of F _n,∞. In particular, we show that centralisers of finite automorphisms in F _n,∞ are either of type FP_∞ or not finitely generated.     

On the number of generators needed for free profinite products of finite groups

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C ₁, ..., C _n are finite cyclic groups then there exists a finite group G which is generated by isomorphic copies of C ₁, ..., C _n and the minimal number of generators of G is n. The first author’s research is partially supported by NSF grant DMS-0701105. The second author’s research is partially supported by OTKA grant T38059 and the Magyary Zoltán Postdoctoral Fellowship.     

Finiteness of Higher K -Groups of Orders and Group Rings

In this paper, we prove that if R is the ring of integers in a number field F, A any R-order in a semisimple F-algebra, then K_2n(A), G_2n(A) are finite groups for all positive integers n. Hence, even dimensional higher K- and G-groups of integral grouprings of finite groups are finite. We also show that in odd dimensions, SK_n of integral and p-adic integral grouprings of finite p-groups are also finite p-groups (Received: August 2005)     

On MODkP Counting Degrees

For a prime k, the embeddability of finite lattices are discussed for various kind of the MOD_kP degrees of recursive sets. In particular, all finite lattices are embeddable into the MOD_kP Turing degrees, whereas the non distributive lattice M₃ is embeddable into the MOD₂P many-one degrees but N₅ is not.     

Characterization of finite Frobenius rings

It is shown that a finite ring R is a Frobenius ring if and only if _R(R/Rad R) @ Soc (_RR)_R(R/\hbox {Rad}\, R)\cong \hbox {Soc}\, (_RR). Other combinatorial characterizations of finite Frobenius rings are presented which have applications in the theory of linear codes over finite rings.     

Negative K-Theory of Generalized Quaternion Groups and Binary Polyhedral Groups

Classical group representation theory is used to determine which finite groups have finite negative K-theory. There follows a computation of the K _?1 of integral group rings ZG for all finite non-abelian subgroups of the group SU(2) of unit quaternions. In principle, the method applies to any finite group.     

Finite degree: algebras in general and semigroups in particular

An algebra A has finite degree if its term functions are determined by some finite set of finitary relations on A. We study this concept for finite algebras in general and for finite semigroups in particular. For example, we show that every finite nilpotent semigroup has finite degree (more generally, every finite algebra with bounded p _n -sequence), and every finite commutative semigroup has finite degree. We give an example of a five-element unary semigroup that has infinite degree. We also give examples to show that finite degree is not preserved in general under taking subalgebras, homomorphic images, direct products or subdirect factors.     

Finite alperin 2-groups with cyclic second commutants

An Alperin group is a group in which every 2-generated subgroup has a cyclic commutant. Previously, we constructed examples of finite Alperin 2-groups with second commutant isomorphic to Z ₂ or Z ₄. Here, it is proved that for any natural n, there exists a finite Alperin 2-group whose second commutant is isomorphic to Z _2n .     

Two graphs without planar covers

In this note we prove that two specific graphs do not have finite planar covers. The graphs are K₇–C₄ and K_4,5–4K₂. This research is related to Negami's 1‐2‐∞ Conjecture which states “A graph G has a finite planar cover if and only if it embeds in the projective plane.” In particular, Negami's Conjecture reduces to showing that 103 specific graphs do not have finite planar covers. Previous (and subsequent) work has reduced these 103 to a few specific graphs. This paper covers 2 of the remaining cases. The sole case currently remaining is to show that K_2,2,2,1 has no finite planar cover. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 318–326, 2002