The fitting length of solvableH pn-groups

For a (finite) groupG and some prime powerp ⁿ, theH _p ⁿ -subgroupH _pn (G) is defined byH _p ⁿ (G)=〈xεG|x ^pn≠1〉. A groupH≠1 is called aH _p ⁿ -group, if there is a finite groupG such thatH is isomorphic toH _p ⁿ (G) andH _p ⁿ (G)≠G. It is known that the Fitting length of a solvableH _p ⁿ -group cannot be arbitrarily large: Hartley and Rae proved in 1973 that it is bounded by some quadratic function ofn. In the following paper, we show that it is even bounded by some linear function ofn. In view of known examples of solvableH _p ⁿ -groups having Fitting lengthn, this result is “almost” best possible.     

Simplification d’idéaux fractionnaires

Riassunto SianoI, J, N eL degli ideali frazionari di un dominioA. Mostriamo che se dueA-moduli moltiplicativi (I ⊕J, 〈,〉) e (L ⊕N, 〈,〉) sono isometrici suA alloraI è isomorfo aL (rispettivamenteJ≈N) o aN (rispettivamenteJ≈L); se ne deduce un criterio che permette di sapere se dueA-moduli quadratici, isotropici di rango 2, sono isometrici o no su un anello di Prüfer.

---

Summary LetI, J, L andN be fractional ideals of a domainA. We prove that if two ?Multiplicative modules? (I⊕J, 〈,〉) and (L⊕N, 〈,〉) are isometric, thenI is isomorphic toL (respectivelyJ is isomorphic toN) or toN (respectively toL). As a consequence, we can know if two isotropic quadratic spaces of rank 2 are isometric on a Prüfer domain.

     

Superstability of the generalized orthogonality equation on restricted domains

Chmielinski has proved in the paper [4] the superstability of the generalized orthogonality equation |〈f(x), f(y)〉| = |〈x,y〉|. In this paper, we will extend the result of Chmielinski by proving a theorem: LetD _n be a suitable subset of ℝⁿ. If a function f:D _n → ℝⁿ satisfies the inequality ∥〈f(x), f(y)〉| |〈x,y〉∥ ≤ φ(x,y) for an appropriate control function φ(x, y) and for allx, y ∈ D _n, thenf satisfies the generalized orthogonality equation for anyx, y ∈ D _n.     

The fraction of the bijections generating the near-ring of 0-preserving functions

Let 〈G, +〉 be a finite (not necessarily abelian) group. Then M₀(G) := {f : G → G| f (0) = 0} is a near-ring, i.e., a group which is also closed under composition of functions. In Theorem 4.1 we give lower and upper bounds for the fraction of the bijections which generate the near-ring M₀(G). From these bounds we conclude the following: If G has few involutions and the order of G is large, then a high fraction of the bijections generate the near-ring M₀(G). Also the converse holds: If a high fraction of the bijections generate M₀(G), then G has few involutions (compared to the order of G). Received: 10 January 2005     

Distance-Dominating Cycles in Quasi Claw-Free Graphs

We say that a graph G is quasi claw-free if every pair (a ₁, a ₂) of vertices at distance 2 satisfies {u∈N (a ₁)∩N (a ₂) | N[u]⊆N[a ₁]∪N [a ₂]}≠∅. A cycle C is m-dominating if every vertex of G is of distance at most m from C. We prove that if G is a κ-connected (κ≥2) quasi claw-free graph then either G has an m-dominating cycle or G has a set of at least κ+1 vertices such that the distance between every pair of them is at least 2m+3. Received: June 12, 1996 Revised: November 9, 1998     

Lifting retracted diagrams with respect to projectable functors

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by a lattice, of finite Boolean 〈∨ ,0 〉-semilattices with 〈∨ ,0 〉-embeddings, can be lifted, with respect to the Con_c functor, by a diagram of lattices, then so can every diagram, indexed by a lattice, of finite distributive 〈∨ ,0 〉-semilattices with 〈∨ ,0 〉-embeddings. If the premise of this statement held, this would solve in turn the (still open) problem whether every distributive algebraic lattice is isomorphic to the congruence lattice of a lattice. We also outline potential applications of our method to other functors, such as the functor on von Neumann regular rings. Received August 12, 2004; accepted in final form June 6, 2005.     

Uniformization of conformal involutions on stable Riemann surfaces

Let S be a closed Riemann surface of genus g. It is well known that there are Schottky groups producing uniformizations of S (Retrosection Theorem). Moreover, if τ: S → S is a conformal involution, it is also known that there is a Kleinian group K containing, as an index two subgroup, a Schottky group G that uniformizes S and so that K/G induces the cyclic group 〈τ〉. Let us now assume S is a stable Riemann surface and τ: S → S is a conformal involution. Again, it is known that S can be uniformized by a suitable noded Schottky group, but it is not known whether or not there is a Kleinian group K, containing a noded Schottky group G of index two, so that G uniformizes S and K/G induces 〈τ〉. In this paper we discuss this existence problem and provide some partial answers: (1) a complete positive answer for genus g ≤ 2 and for the case that S/〈τ〉 is of genus zero; (2) the existence of a Kleinian group K uniformizing the quotient stable Riemann orbifold S/〈τ〉. Applications to handlebodies with orientation-preserving involutions are also provided.     

The Kantor-Koecher-Tits construction for Jordan coalgebras

The relationship between Jordan and Lie coalgebras is established. We prove that from any Jordan coalgebra 〈L(A), Δ〉, it is possible to construct a Lie coalgebra 〈L(A), Δ_L〉. Moreover, any dual algebra of the coalgebra 〈L(A), Δ_L〉 corresponds to a Lie algebra that can be determined from the dual algebra for (A, Δ), following the Kantor-Koecher-Tits process. The structure of subcoalgebras and coideals of the coalgebra 〈L(A), Δ_L〉 is characterized. Supported by ISF grant No. RB 6000. Translated fromAlgebra i Logika, Vol. 35, No. 2, pp. 173–189, March–April, 1996.     

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

For any vertex u∈V(G), let T_N(U)={u}∪{uv|uv∈E(G), v∈v(G)}∪{v∈v(G)|uv∈E(G)}and let f be a total k-coloring of G. The total-color neighbor of a vertex u of G is the color set C_f(u)={f(x)|x∈TN(U)}. For any two adjacent vertices x and y of V(G)such that C_f(x)≠C_f(y), we refer to f as a k-avsdt-coloring of G("avsdt"is the abbreviation of"adjacent-vertex-strongly- distinguishing total"). The avsdt-coloring number of G, denoted by X_(ast)(G), is the minimal number of colors required for a avsdt-coloring of G. In this paper, the avsdt-coloring numbers on some familiar graphs are studied, such as paths, cycles, complete graphs, complete bipartite graphs and so on. We proveΔ(G) 1≤X_(ast)(G)≤Δ(G) 2 for any tree or unique cycle graph G.     

A criterion for the primeness of ideals generated by polynomials with separated variables

Proving primeness of an idealI=〈f ₁, …,f _m〉 in a polynomial ringR=K[X ₁, …,X _n]ofn indeterminates over an algebraically closed fieldK is a difficult task in general. Although there are straightforward algorithms that decide whetherI is prime or not, they are prohibitively lengthy if the number of indeterminates or the degrees of thef _iare large. In this paper we will give an easy criterion for the primeness ofI if thef _iare polynomials with separated variables, i.e. no mixed monomials occur in thef _i. The work on this paper was done while the author was a MINERVA fellow at Tel Aviv University.     

A Characterization of Quadric Constant Mean Curvature Hypersurfaces of Spheres

Let be an immersion of a complete n-dimensional oriented manifold. For any v∈ℝ ⁿ⁺², let us denote by ℓ _v :M→ℝ the function given by ℓ _v (x)=〈φ(x),v〉 and by f _v :M→ℝ, the function given by f _v (x)=〈ν(x),v〉, where is a Gauss map. We will prove that if M has constant mean curvature, and, for some v≠0 and some real number λ, we have that ℓ _v =λ f _v , then, φ(M) is either a totally umbilical sphere or a Clifford hypersurface. As an application, we will use this result to prove that the weak stability index of any compact constant mean curvature hypersurface M ⁿ in which is neither totally umbilical nor a Clifford hypersurface and has constant scalar curvature is greater than or equal to 2n+4. A. Brasil Jr. was partially supported by CNPq, Brazil, 306626/2007-1.     

On finite Moufang polygons

We show that a finite generalized polygon Γ is Moufang with respect to a groupG if and only if for every flag {x, y} of Γ, the subgroupG ₁(x, y) ofG fixing every element incident with one ofx, y acts transitively on the set of apartments containing the elementsu, x, y, w, whereu≠y (resp.w≠x) is an arbitrary element incident withx (resp.y). Research Associate at the National Fund of Scientific Research of Belgium. Research partially supported by NSF Grant DMS-8901904.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

On the doubly connected domination number of a graph

For a given connected graph G = (V, E), a set is a doubly connected dominating set if it is dominating and both 〈D〉 and 〈V (G)-D〉 are connected. The cardinality of the minimum doubly connected dominating set in G is the doubly connected domination number. We investigate several properties of doubly connected dominating sets and give some bounds on the doubly connected domination number.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

On the Cauchy problem for a doubly nonlinear degenerate parabolic equation with strongly nonlinear sources

In this article, we consider the existence of local and global solution to the Cauchy problem of a doubly nonlinear equation. By introducing the norms |||_f||| _h and 〈f〉_h, we give the sufficient and necessary conditions on the initial value to the existence of local solution of doubly nonlinear equation. Moreover some results on the global existence and nonexistence of solutions are considered. This work was supported by the National Natural Science Foundation of China (Grant No. 10531020)     

Attainability of the minimal exponential growth rate for free products of finite cyclic groups

We consider free products of two finite cyclic groups of orders 2 and n, where n is a prime power. For any such group ℤ₂ * ℤ _n = 〈a, b | a ² = b ⁿ = 1〉, we prove that the minimal growth rate α _n is attained on the set of generators {a, b} and explicitly write out an integer polynomial whose maximal root is α _n . In the cases of n = 3, 4, this result was obtained earlier by A. Mann. We also show that under sufficiently general conditions, the minimal growth rates of a group G and of its central extension [(G)\tilde]\tilde G coincide and that the attainability of one implies the attainability of the other. As a corollary, the attainability is proved for some cyclic extensions of the above-mentioned free products, in particular, for groups 〈a, b | a ² = b ⁿ 〉, which are groups of torus knots for odd n.     

Group Chromatic Number of Graphs without K5-Minors

 Let G be a graph with a fixed orientation and let A be a group. Let F(G,A) denote the set of all functions f: E(G) ↦A. The graph G is A -colorable if for any function f∈F(G,A), there is a function c: V(G) ↦A such that for every directed e=u v∈E(G), c(u)−c(v)≠f(e). The group chromatic numberχ₁(G) of a graph G is the minimum m such that G is A-colorable for any group A of order at least m under a given orientation D. In [J. Combin. Theory Ser. B, 56 (1992), 165–182], Jaeger et al. proved that if G is a simple planar graph, then χ₁(G)≤6. We prove in this paper that if G is a simple graph without a K ₅-minor, then χ₁(G)≤5. Received: August 18, 1999 Final version received: December 12, 2000