Schwachdiskrete Bewegungsgruppen einer pseudoeuklidischen Ebene

There are considered discontinuous motion groups — in a very weak sense — of a pseudoeuclidean plane. A motion groupG is to be said (8)-discrete, if there can be found a nontrivial orbit G(P) and a Minkovskian circle diskU which contains only a finite number of elements of G(P). Such groups will be divided after their subgroup of translations, necessary and sufficient conditions for the translations will be given as same as — to a certain extent — a classification of (8)-discrete groups.

---

---

Herrn Professor Benno Klotzek zum 60. Geburtstag gewidmet     

Lotketten in metrischen Ebenen

In [3] F. Bachmann defined chains of perpendiculars for a geometric structure which is endowed with a set of lines and a symmetric orthogonality relation on this set, and he studied these chains in the group plane of a Hjelmslev group. All Bachmann groups (the groups which are the main subject of [1]) are Hjelmslev groups, and the theory of Hjelmslev groups includes also Hjelmlev's theory of Allgemeine Kongruenzlehre. In a Hjelmslev group, the chains of perpendiculars are closely related to the subgroup which is generated by the points. In this paper we establish some results concerning chains of perpendiculars mainly with regard to Bachmann groups.     

Torsion-free groups with factor-groups on their hypercenter which are periodic

Assume that G is a torsion-free group, Zk(G) is the k-th term of the upper central series of G, and ¯G_k=G/Z_k(G) is a nontrivial periodic group. Then every finite subgroup of ¯G_k is nilpotent of class not higher than k; the group k 2 contains an infinite subgroup with k generators if k2 and two generators if k=1. Moreover any nontrivial invariant subgroup of ¯G_k is infinite. All elements of ¯Gk are of odd order. This assertion is generalized.Translated from Matematicheskie Zametki, Vol. 8, No. 3, pp. 373–383, September, 1970.     

On the commutator subgroup of a nonconnected central group

In this paperG denotes a central topologicalT ₂-group—G/Z(G) compact, whereZ(G) is the center. There are some results concerning compactness of the commutator subgroupG; in general (G)^– is compact ([3]), but not necessarilyG ([7]). If in additionG is a Lie group or ifG is connected,G is compact ([6], [5]). The purpose of this paper is to show, that if the componentG ₀ of the identity is open,G must be compact, and to give an example of a compact group with (G/G ₀) compact, whileG is not compact.Dedicated to Prof. R. Inzinger on his 70th birthday     

On the graph of large distances

For a setS of points in the plane, letd ₁>d ₂>... denote the different distances determined byS. Consider the graphG(S, k) whose vertices are the elements ofS, and two are joined by an edge iff their distance is at leastd _k . It is proved that the chromatic number ofG(S, k) is at most 7 if |S|constk ². IfS consists of the vertices of a convex polygon and |S|constk ², then the chromatic number ofG(S, k) is at most 3. Both bounds are best possible. IfS consists of the vertices of a convex polygon thenG(S, k) has a vertex of degree at most 3k – 1. This implies that in this case the chromatic number ofG(S, k) is at most 3k. The best bound here is probably 2k+1, which is tight for the regular (2k+1)-gon.     

Order and topology in projective Hjelmslev planes

The concept of an ordered projective Hjelmslev plane was intuitively introduced by Hjelmslev in Einleitung in die allgemeine Kongruenglehre ([9], [10]).This paper is concerned with formalizing and examing preorderings and orderings for projective Hjelmslev planes. In addition we show that orderings generated topologies of the point and line sets which render the plane a topological Hjelmslev plane ([19], [13]). These planes — unlike the ordinary ordered planes ([18]) — are, due to the existence of infinitesimals, non-archimedian, non-compact and disconnected with the neighbour classes as certain quasi-components.The authors gratefully acknowledge the support of the Natural Sciences and Engineering Research Council of Canada.     

Number of no nisomorphic subgraphs in an n-point graph

LetG(n) be the set of all nonoriented graphs with n enumerated points without loops or multiple lines, and let v_k(G) be the number of mutually nonisomorphic k-point subgraphs of G G(n). It is proved that at least |G(n)| (1–1/n) graphs G G(n) possess the following properties: a) for any k [6log₂n], where c=–c log₂c–(1–c)×log₂(1–c) and c>1/2, we havev _k(G) > C _n ^k (1–1/n²); b) for any k [cn + 5 log₂n] we havev _k(G) = C _n ^k . Hence almost all graphs G G(n) containv(G) 2ⁿ pairwise nonisomorphic subgraphs.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 263–273, March, 1971.     

Random Subgraphs of Cayley Graphs overp-Groups

The subject of this paper is the size of the largest component in random subgraphs of Cayley graphs, X_n, taken over a class of p -groups, G_n. G_nconsists of p -groups, G_n, with the following properties: (i)G_n / Φ(G_n)  = F_pⁿ, where Φ(G_n) is the Frattini subgroup and (ii) | G_n|  ≤ n^Kn, where K is some positive constant. We consider Cayley graphs X_n = Γ(G_n, S_n′), where S_n′ = S_n  S_n ^− 1, and S_nis a minimal G_n-generating set. By selecting G_n-elements with the independent probability λ_nwe induce random subgraphs of X_n. Our main result is, that there exists a positive constant c >  0 such that for λ_n = c ln(| S_n′ |) / | S_n′ | the largest component of random induced subgraphs of X_ncontains almost all vertices.     

On integral Cayley sum graphs

Let S be a subset of a finite abelian group G. The Cayley sum graph Cay⁺(G, S) of G with respect to S is a graph whose vertex set is G and two vertices g and h are joined by an edge if and only if g + h ∈ S. We call a finite abelian group G a Cayley sum integral group if for every subset S of G, Cay⁺(G, S) is integral i.e., all eigenvalues of its adjacency matrix are integers. In this paper, we prove that all Cayley sum integral groups are represented by Z₃ and Zn₂ ⁿ, n ≥ 1, where Z_k is the group of integers modulo k. Also, we classify simple connected cubic integral Cayley sum graphs.     

Steiner centers and Steiner medians of graphs

Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d_G(S) or d(S). The Steiner n-eccentricity e_n(v) and Steiner n-distance d_n(v) of a vertex v in G are defined as e_n(v)=max{d(S)| SV(G), |S|=n and vS} and d_n(v)=∑{d(S)| SV(G), |S|=n and vS}, respectively. The Steiner n-center C_n(G) of G is the subgraph induced by the vertices of minimum n-eccentricity. The Steiner n-median M_n(G) of G is the subgraph induced by those vertices with minimum Steiner n-distance. Let T be a tree. Oellermann and Tian [O.R. Oellermann, S. Tian, Steiner centers in graphs, J. Graph Theory 14 (1990) 585–597] showed that C_n(T) is contained in C_n+1(T) for all n2. Beineke et al. [L.W. Beineke, O.R. Oellermann, R.E. Pippert, On the Steiner median of a tree, Discrete Appl. Math. 68 (1996) 249–258] showed that M_n(T) is contained in M_n+1(T) for all n2. Then, Oellermann [O.R. Oellermann, On Steiner centers and Steiner medians of graphs, Networks 34 (1999) 258–263] asked whether these containment relationships hold for general graphs. In this note we show that for every n2 there is an infinite family of block graphs G for which C_n(G)C_n+1(G). We also show that for each n2 there is a distance–hereditary graph G such that M_n(G)M_n+1(G). Despite these negative examples, we prove that if G is a block graph then M_n(G) is contained in M_n+1(G) for all n2. Further, a linear time algorithm for finding the Steiner n-median of a block graph is presented and an efficient algorithm for finding the Steiner n-distances of all vertices in a block graph is described.     

On the local Artin conductor f<Subscript>Artin</Subscript> (Χ) of a character Χ of Gal(E/K) — II: Main results for the metabelian case

This paper which is a continuation of [2], is essentially expository in nature, although some new results are presented. LetK be a local field with finite residue class fieldK _k. We first define (cf. Definition 2.4) the conductorf(E/K) of an arbitrary finite Galois extensionE/K in the sense of non-abelian local class field theory as wheren _G is the break in the upper ramification filtration ofG = Gal(E/K) defined by . Next, we study the basic properties of the idealf(E/K) inO _k in caseE/K is a metabelian extension utilizing Koch-de Shalit metabelian local class field theory (cf. [8]). After reviewing the Artin charactera _G : G → ℂ ofG := Gal(E/K) and Artin representationsA _g G → G →GL(V) corresponding toa _G : G → ℂ, we prove that (Proposition 3.2 and Corollary 3.5) where Χ_gr : G → ℂ is the character associated to an irreducible representation ρ: G → GL(V) ofG (over ℂ). The first main result (Theorem 1.2) of the paper states that, if in particular,ρ : G → GL(V) is an irreducible representation ofG(over ℂ) with metabelian image, then where Gal(E^ker(ρ)/E^ker(ρ)•) is any maximal abelian normal subgroup of Gal(E^ker(ρ)/K) containing Gal(E^ker(ρ) /K)′, and the break n_G/ker(ρ) in the upper ramification filtration of G/ker(ρ) can be computed and located by metabelian local class field theory. The proof utilizes Basmaji’s theory on the structure of irreducible faithful representations of finite metabelian groups (cf. [1]) and on metabelian local class field theory (cf. [8]). We then discuss the application of Theorem 1.2 on a problem posed by Weil on the construction of a ‘natural’A _G ofG over ℂ (Problem 1.3). More precisely, we prove in Theorem 1.4 that ifE/K is a metabelian extension with Galois group G, then Kazim İlhan ikeda whereN runs over all normal subgroups of G, and for such anN, V _n denotes the collection of all ∼-equivalence classes [ω]∼, where ‘∼’ denotes the equivalence relation on the set of all representations ω : (G/N)^• → ℂ^Χ satisfying the conditions Inert(ω) = {δ ∈ G/N : ℂ_δ} = ω =(G/N) and where δ runs over R((G/N)^•/(G/N)), a fixed given complete system of representatives of (G/N)^•/(G/N), by declaring that ω₁ ∼ ω₂ if and only if ω₁ = ω _2,δ for some δ ∈ R((G/N)^•/(G/N)). Finally, we conclude our paper with certain remarks on Problem 1.1 and Problem 1.3.     

Steiner systems andn −1-isomorphisms

In this work we introduce the concept of n ^–1-isomorphism between Steiner systems (this coincides with the concept of isomorphism whenever n=1).Precisely two Steiner systems S₁ and S₂ are said to be n^–1-isomorphic if there exist n partial systems S _i ⁽¹⁾ ,...,S _i ⁽ⁿ⁾ contained in Si, i.{1,2},such that S ₁ ^(k) and S ₂ ^(k) are isomorphic for each k{1,..., n}.The n^–1-isomorphisms are also used to study nets replacements, see Ostrom [8], and to study the transformation methods of designs and other incidence structures introduced in [9] and generalized in [1] and [10].Work done under the auspicies of G.N.S.A.G.A. supported by 40% grants of M.U.R.S.T.     

Non-closed Lie subgroups of Lie groups

We obtain several homotopy obstructions to the existence of non-closed connected Lie subgroupsH in a connected Lie groupG.First we show that the foliationF(G, H) onG determined byH is transversely complete [4]; moreover, forK the closure ofH inG, F(K, H) is an abelian Lie foliation [2].Then we prove that ₁(K) and ₁(H) have the same torsion subgroup, _n (K)= _n (H) for alln 2, and rank₁(K) — rank₁(H) > codimF(K, H). This implies, for instance, that a contractible (e.g. simply connected solvable) Lie subgroup of a compact Lie group must be abelian. Also, if rank₁(G) 1 then any connected invariant Lie subgroup ofG is closed; this generalizes a well-known theorem of Mal'cev [3] for simply connected Lie groups.Finally, we show that the results of Van Est on (CA) Lie groups [6], [7] provide many interesting examples of such foliations. Actually, any Lie group with non-compact centre is the (dense) leaf of a foliation defined by a closed 1-form. Conversely, when the centre is compact, the latter is true only for (CA) Lie groups (e.g. nilpotent or semisimple).     

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph

Let G be a graph and S ⊂ V(G). We denote by α(S) the maximum number of pairwise nonadjacent vertices in S. For x, y ∈ V(G), the local connectivity κ(x, y) is defined to be the maximum number of internally-disjoint paths connecting x and y in G. We define . In this paper, we show that if κ(S) ≥ 3 and for every independent set {x ₁, x ₂, x ₃, x ₄} ⊂ S, then G contains a cycle passing through S. This degree condition is sharp and this gives a new degree sum condition for a 3-connected graph to be hamiltonian.     

Non-microstates free entropy dimension for groups

We show that for any discrete finitely-generated group G and any self-adjoint n-tuple X₁,...,X_n of generators of the group algebra Voiculescu’s non-microstates free entropy dimension δ^*(X₁,...,X_n) is exactly equal to β₁(G) − β₀(G) + 1 where β_i are the ℓ²-Betti numbers of G.Received: January 2004 Revision: October 2004 Accepted: January 2005     

Primitive permutation groups with a regular subgroup

This paper starts the classification of the primitive permutation groups (G,Ω) such that G contains a regular subgroup X. We determine all the triples (G,Ω,X) with soc(G) an alternating, or a sporadic or an exceptional group of Lie type. Further, we construct all the examples (G,Ω,X) with G a classical group which are known to us. Our particular interest is in the 8-dimensional orthogonal groups of Witt index 4. We determine all the triples (G,Ω,X) with . In order to obtain all these triples, we also study the almost simple groups G with GPΩ_2n+1(q). The case GU_n(q) is started in this paper and finished in [B. Baumeister, Primitive permutation groups of unitary type with a regular subgroup, Bull. Belg. Math. Soc. 112 (5) (2006) 657–673]. A group X is called a Burnside-group (or short a B-group) if each primitive permutation group which contains a regular subgroup isomorphic to X is necessarily 2-transitive. In the end of the paper we discuss B-groups.