Centralizers of coprime automorphisms of finite groups

Let A be an elementary abelian group of order p ^k with k ≥ 3 acting on a finite p′-group G. The following results are proved. If γ _k-2(C _G (a)) is nilpotent of class at most c for any ${a \in A^{\#}}$ , then γ _k-2(G) is nilpotent and has {c, k, p}-bounded nilpotency class. If, for some integer d such that 2 ^d  + 2 ≤ k, the dth derived group of C _G (a) is nilpotent of class at most c for any ${a \in A^{\#}}$ , then the dth derived group G ^(d) is nilpotent and has {c, k, p}-bounded nilpotency class.     

Minimal Blocking Sets in PG(n, 2) and Covering Groups by Subgroups

In this article we prove that a set of points B of PG(n, 2) is a minimal blocking set if and only if ?B? = PG(d, 2) with d odd and B is a set of d + 2 points of PG(d, 2) no d + 1 of them in the same hyperplane. As a corollary to the latter result we show that if G is a finite 2-group and n is a positive integer, then G admits a ? _n+1-cover if and only if n is even and G? (C ₂) ⁿ , where by a ? _m -cover for a group H we mean a set 𝒞 of size m of maximal subgroups of H whose set-theoretic union is the whole H and no proper subset of 𝒞 has the latter property and the intersection of the maximal subgroups is core-free. Also for all n < 10 we find all pairs (m,p) (m > 0 an integer and p a prime number) for which there is a blocking set B of size n in PG(m,p) such that ?B? = PG(m,p).     

Root Sublattices and Torus-Restriction of Prehomogeneous Vector Spaces Associated with Dynkin Quivers

For a Dynkin quiver Γ with r vertices, a subset S of the vertices of Γ, and an r-tuple d = (d⁽¹⁾, d⁽²⁾,…, d^(r)) of positive integers, we define a “torus-restricted” representation (G_S, R _d (Γ)) in natural way. Here we put G_S = G₁ × G₂ × … ×G_r, where each G_i is either SL(d⁽ⁱ⁾) or GL(d⁽ⁱ⁾) according to S containing i or not. In this paper, for a prescribed torus-restriction S, we give a necessary and sufficient condition on d that R _d (Γ) has only finitely many G_S-orbits. This can be paraphrased as a condition whether or not d is contained in a certain lattice spanned by positive roots of Γ. We also discuss the prehomogeneity of (G_S, R _d (Γ)).     

Orders in regular rings with minimal condition for principal right ideals

ABSTRACT

A ring R is called an n-clean (resp. Σ-clean) ring if every element in R is n-clean (resp. Σ-clean). Clean rings are 1-clean and hence are Σ-clean. An example shows that there exists a 2-clean ring that is not clean. This shows that Σ-clean rings are a proper generalization of clean rings. The group ring ?_(p) G with G a cyclic group of order 3 is proved to be Σ-clean. The m× m matrix ring M _m (R) over an n-clean ring is n-clean, and the m×m (m>1) matrix ring M _m (R) over any ring is Σ-clean. Additionally, rings satisfying a weakly unit 1-stable range were introduced. Rings satisfying weakly unit 1-stable range are left-right symmetric and are generalizations of abelian π-regular rings, abelian clean rings, and rings satisfying unit 1-stable range. A ring R satisfies a weakly unit 1-stable range if and only if whenever a ₁ R + ˙˙˙ a _m R = dR, with m ≥ 2, a ₁,…, a _m, d ∈ R, there exist u ₁ ∈ U(R) and u ₂,…, u _m ∈ W(R) such that a ₁ u ₁ + ? a _m u _m = Rd.     

THE STRUCTURE OF THE TANGENT CONE: AN INTERESTING BIJECTION#

ABSTRACT

Let X = Spec(R) be a reduced equidimensional algebraic variety over an algebraically closed field k. Let Y = Spec(R/𝔮) be a codimension one ordinary multiple subvariety, where 𝔮 is a prime ideal of height 1 of R. If U is a nonempty open subset of Y and 𝔪 a closed point of U, we denote by A ? R _𝔪 its local ring in X, by 𝔭 the extension of 𝔮 in A, and by K the algebraic closure of the residue field k(𝔭).

Then there exists a bijection γ^𝔪:Proj(G _𝔭(A) ?  _A/𝔭 k) → Proj(G(A _𝔭) ?  _k(𝔭)K) such that for every subset Σ of Proj(G _𝔭(A) ?  _A/𝔭 k), the Hilbert function of Σ coincides with the Hilbert function of γ^𝔪(Σ). We examine some applications. We study the structure of the tangent cone at a closed point of a codimension one ordinary multiple subvariety.     

Strict Dead-End Elements in Free Soluble Groups

Let G be a group generated by a finite set A. An element g ∈ G is a strict dead end of depth k (with respect to A) if |g|>|ga ₁|>|ga ₁ a ₂|>···>|ga ₁ a ₂… a _k | for any a ₁, a ₂,…, a _k  ∈ A ^±1 such that the word a ₁ a ₂… a _k is freely irreducible. (Here |g| is the distance from g to the identity in the Cayley graph of G.) We show that in finitely generated free soluble groups of degree d ≥ 2 there exist strict dead elements of depth k = k(d), which grows exponentially with respect to d.     

The Connected Monophonic Number of a Graph

For a connected graph G = (V, E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A set S of vertices of G is a monophonic set of G if each vertex v of G lies on an x ? y monophonic path for some elements x and y in S. The minimum cardinality of a monophonic set of G is defined as the monophonic number of G, denoted by m(G). A connected monophonic set of G is a monophonic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected monophonic set of G is the connected monophonic number of G and is denoted by m _c (G). We determine bounds for it and characterize graphs which realize these bounds. For any two vertices u and v in G, the monophonic distance d _m (u, v) from u to v is defined as the length of a longest u ? v monophonic path in G. The monophonic eccentricity e _m (v) of a vertex v in G is the maximum monophonic distance from v to a vertex of G. The monophonic radius rad _m G of G is the minimum monophonic eccentricity among the vertices of G, while the monophonic diameter diam _m G of G is the maximum monophonic eccentricity among the vertices of G. It is shown that for positive integers r, d and n ≥ 5 with r <  d, there exists a connected graph G with rad _m G =  r, diam _m G =  d and m _c (G) =  n. Also, if a,b and p are positive integers such that 2 ≤  a <  b ≤  p, then there exists a connected graph G of order p, m(G) =  a and m _c (G) =  b.     

Vanishing Derivations and Co-Centralizing Generalized Derivations on Multilinear Polynomials in Prime Rings

Let R be a noncommutative prime ring of characteristic different from 2 with Utumi quotient ring U and extended centroid C, and f(x₁,…, x_n) be a multilinear polynomial over C, which is not central valued on R. Suppose that F and G are two generalized derivations of R and d is a nonzero derivation of R such that d(F(f(r))f(r) ? f(r)G(f(r))) = 0 for all r = (r₁,…, r_n) ∈ Rⁿ, then one of the following holds:

1. There exist a, p, q, c ∈ U and λ ∈C such that F(x) = ax + xp + λx, G(x) = px + xq and d(x) = [c, x] for all x ∈ R, with [c, a ? q] = 0 and f(x₁,…, x_n)² is central valued on R;

2. There exists a ∈ U such that F(x) = xa and G(x) = ax for all x ∈ R;

3. There exist a, b, c ∈ U and λ ∈C such that F(x) = λx + xa ? bx, G(x) = ax + xb and d(x) = [c, x] for all x ∈ R, with b + αc ∈ C for some α ∈C;

4. R satisfies s₄ and there exist a, b ∈ U and λ ∈C such that F(x) = λx + xa ? bx and G(x) = ax + xb for all x ∈ R;

5. There exist a′, b, c ∈ U and δ a derivation of R such that F(x) = a′x + xb ? δ(x), G(x) = bx + δ(x) and d(x) = [c, x] for all x ∈ R, with [c, a′] = 0 and f(x₁,…, x_n)² is central valued on R.

     

On Galois Algebras Satisfying the Fundamental Theorem

Let B be a Galois algebra over a commutative ring R with Galois group G such that B ^H is a separable subalgebra of B for each subgroup H of G. Then it is shown that B satisfies the fundamental theorem if and only if B is one of the following three types: (1) B is an indecomposable commutative Galois algebra, (2) B = Re ⊕ R(1 ? e) where e and 1 ? e are minimal central idempotents in B, and (3) B is an indecomposable Galois algebra such that for each separable subalgebra A, V _B (A) = ?∑ _g∈G(A) J _g , and the centers of A and B ^G(A) are the same where V _B (A) is the commutator subring of A in B, J _g  = {b ∈ B | bx = g(x)b for each x ∈ B} for a g ∈ G, and G(A) = {g ∈ G | g(a) = a for all a ∈ A}.     

On Solvable R* Groups of Finite Rank

Abstract

For an element a of a group G,let S(a) denote the semigroup generated by all conjugates of a in G. We prove that if G is solvable of finite rank and 1 ? S(a) for all 1 ≠ a ∈ G,then ?a ^G ?/?b ^G ? is a periodic group for every b ∈ S(a). Conversely if every two generator subgroup of a finitely generated torsion-free solvable group G has this property then G has finite rank,and if every finitely generated subgroup has this property then every partial order on G can be extended to a total order.     

Involutory Automorphisms of Groups of Odd Order

The following theorem is proved. Let G be a finite group of odd order admitting an involutory automorphism φ. Suppose that G has derived length d and that C_G(φ) is nilpotent of class c. Assume that C_G(φ) is a m-generator. Then [G,φ]^′ is nilpotent of {c,d,m}-bounded class.     

On B(5, 18) Groups

A group G is said to be a B(n, k) group if for any n-element subset A of G, |A²| ≤k. In this paper, a characterization of B(5, 18) groups is given. It is shown that G is a B(5, 18) group if and only if one of the following statements holds: (1) G is abelian; (2) |G| ≤18; (3) G ? ? a, b | a⁵ = b⁴ = 1, a^b = a^?1 ?.     

Involutory Automorphisms of Groups of Odd Order

The following theorem is proved. Let G be a finite group of odd order admitting an involutory automorphism φ. Suppose that G has derived length d and that C_G(φ) is nilpotent of class c. Assume that C_G(φ) is a m-generator. Then [G,φ]^′ is nilpotent of {c,d,m}-bounded class.     

The Division Relation: Congruence Conditions and Axiomatisability

We examine a universal algebraic abstraction of the semigroup theoretic concept of “divides:” a divides b in an algebra A if for some n ∈ ω, there is a term t(x, y ₁,…, y _n ) involving all of the listed variables, and elements c ₁,…, c _n such that t ^A (a, c ₁,…, c _n ) = b. The first order definability of this relation is shown to be a very broad generalisation of some familiar congruence properties, such as definability of principal congruences. The algorithmic problem of deciding when a finitely generated variety has this relation definable is shown to be equivalent to an open problem concerning flat algebras. We also use the relation as a framework for establishing some results concerning the finite axiomatisability of finitely generated varieties.     

Grassmannians of 2-Sided Vector Spaces

Let k ? K be an extension of fields, and let A ? M _n (K) be a k-algebra. We study parameter spaces of m-dimensional subspaces of K ⁿ which are invariant under A. The space  _A (m, n), whose R-rational points are A-invariant, free rank m summands of R ⁿ , is well known. We construct a distinct parameter space,  _A (m, n), which is a fiber product of a Grassmannian and the projectivization of a vector space. We then study the intersection  _A (m, n) ∩  _A (m, n), which we denote by  _A (m, n). Under suitable hypotheses on A, we construct affine open subschemes of  _A (m, n) and  _A (m, n) which cover their K-rational points. We conclude by using  _A (m, n),  _A (m, n), and  _A (m, n) to construct parameter spaces of 2-sided subspaces of 2-sided vector spaces.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Classification of Finite Completions of a Class Locally D 8 Amalgams

Let 𝒜 = (A ₁, A ₁₂, A ₂) be a locally D ₈ amalgam with a finite completion G. Suppose that A ₁ ∈ Syl ₂(G). We show that under these conditions |A ₁| ≤2⁵, or N _{A 1} (A ₁₂) is Abelian. As applications of our results, we determine all the finite completions G, up to O(G), in the case where N _{A 1} (A ₁₂) is non-Abelian.     

Depth of Initial Ideals of Normal Edge Rings

Let G be a finite graph on the vertex set [d] = {1,…, d} with the edges e ₁,…, e _n and K[t] = K[t ₁,…, t _d ] the polynomial ring in d variables over a field K. The edge ring of G is the semigroup ring K[G] which is generated by those monomials t ^e  = t _i t _j such that e = {i, j} is an edge of G. Let K[x] = K[x ₁,…, x _n ] be the polynomial ring in n variables over K, and define the surjective homomorphism π: K[x] → K[G] by setting π(x _i ) = t ^{e _i} for i = 1,…, n. The toric ideal I _G of G is the kernel of π. It will be proved that, given integers f and d with 6 ≤ f ≤ d, there exists a finite connected nonbipartite graph G on [d] together with a reverse lexicographic order <_rev on K[x] and a lexicographic order <_lex on K[x] such that (i) K[G] is normal with Krull-dim K[G] = d, (ii) depth K[x]/in_<rev (I _G ) = f and K[x]/in_<lex (I _G ) is Cohen–Macaulay, where in_<rev (I _G ) (resp., in_<lex (I _G )) is the initial ideal of I _G with respect to <_rev (resp., <_lex) and where depth K[x]/in_<rev (I _G ) is the depth of K[x]/in_<rev (I _G ).     

Characterization of A5 and SL(2,5) by the number of conjugacy classes of non-cyclic subgroups

For a finite group G, let ν_c(G) denote the number of conjugacy classes of non-normal non-cyclic subgroups of G. We show that for every finite non-solvable group G, ν_c(G) = |π(G)|+1 if and only if G?A₅, the alternating group on 5 letters, or SL(2,5).