Infinitesimal operations on complexes of graphs

In two seminal papers Kontsevich used a construction called graph homology as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms of a free group, and invariants of odd dimensional manifolds. In this paper, we show that Kontsevichs graph complexes, which include graph complexes studied earlier by Culler and Vogtmann and by Penner, have a rich algebraic structure. We define a Lie bracket and cobracket on graph complexes, and in fact show that they are Batalin-Vilkovisky algebras, and therefore Gerstenhaber algebras. We also find natural subcomplexes on which the bracket and cobracket are compatible as a Lie bialgebra. Kontsevichs graph complex construction was generalized to the context of operads by Ginzburg and Kapranov, with later generalizations by Getzler-Kapranov and Markl. In [CoV], we show that Kontsevichs results in fact extend to general cyclic operads. For some operads, including the examples associated to moduli space and outer automorphism groups of free groups, the subcomplex on which we have a Lie bi-algebra structure is quasi-isomorphic to the entire connected graph complex. In the present paper we show that all of the new algebraic operations canonically vanish when the homology functor is applied, and we expect that the resulting constraints will be useful in studying the homology of the mapping class group, finite type manifold invariants and the homology of Out(F _n ). Mathematics Subject Classification (2000):17B62, 17B63, 17B70, 20F28, 57M07, 57M15, 57M27Partially supported by NSF VIGRE grant DMS-9983660Partially supported by NSF grant DMS-9307313     

On a Hierarchy of Groups of Computable Automorphisms

Basics and results on groups of computable automorphisms are collected in [1].We recall the main definitions. A computable model

Linearity of Automorphisms of Standard Quadrics of Codimension m in ℂ m+n

Standard quadrics of codimension in are considered. A condition for all automorphisms of such quadrics to be linear is given.     

The Hoffman-Singleton Graph and its Automorphisms

We describe the Hoffman-Singleton graph geometrically, showing that it is closely related to the incidence graph of the affine plane over ₅. This allows us to construct all automorphisms of the graph.     

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.     

On periodic groups of automorphisms of extremal groups

It is proved that if a periodic group has an extremal normal divisor , determining a complete abelian factor group , then the center of the group contains a complete abelian subgroup , satisfying the relation and intersecting on a finite subgroup. It is also established with the aid of this proposition that every periodic group of automorphisms of an extremal group is a finite extension of a contained in it subgroup of inner automorphisms of the group .Translated from Matematicheskie Zametki, Vol. 4, No. 1, pp. 91–96, July, 1968.     

Crossed Modules and Quantum Groups in Braided Categories

Let A be a Hopf algebra in a braided category . Crossed modules over A are introduced and studied as objects with both module and comodule structures satisfying a compatibility condition. The category of crossed modules is braided and is a concrete realization of a known general construction of a double or center of a monoidal category. For a quantum braided group the corresponding braided category of modules is identified with a full subcategory in . The connection with cross products is discussed and a suitable cross product in the class of quantum braided groups is built. Majid–Radford theorem, which gives equivalent conditions for an ordinary Hopf algebra to be such a cross product, is generalized to the braided category. Majid's bosonization theorem is also generalized.     

The type of group measure space von Neumann algebras

LetG be a countable discrete group acting by measure-preserving automorphisms of a finite measure space (M, ) and let (G,M) be the corresponding group measure space von Neumann algebra, which will be a finite von Neumann algebra. Necessary and sufficient conditions are given for (G,M) to have a non-zero type I part, and the projection on the type I part is explicitly described.This research was supported in part by National Science Foundation Grant MCS 74-19876.     

Triads, Flocks of Conics and Q -(5,q)

We show that if an ovoid of Q (4,q),q even, admits a flock of conics then that flock must be linear. It follows that an ovoid of PG (3,q),q even, which admits a flock of conics must be an elliptic quadric. This latter result is used to give a characterisation of the classical example Q ^-(5,q) among the generalized quadrangles T ₃( ), where is an ovoid of PG (3q) and q is even, in terms of the geometric configuration of the centres of certain triads.     

(C_k \oplus G,k,\lambda ) Difference Families

Let G be an additive group and C _k be the additive group of the ring Z _k of residues modulo k. If there exist a (G, k, ) difference family and a (G, k, ) perfect Mendelsohn difference family, then there also exists a difference family. If the (G, k, ) difference family and the (G, k, ) perfect Mendelsohn difference family are further compatible, then the resultant difference family is elementary resolvable. By first constructing several series of perfect Mendelsohn difference families, many difference families and elementary resolvable difference families are thus obtained.     

On signed majority total domination in graphs

We initiate the study of signed majority total domination in graphs. Let G = (V, E) be a simple graph. For any real valued function f: V and S V, let . A signed majority total dominating function is a function f: V {–1, 1} such that f(N(v)) 1 for at least a half of the vertices v V. The signed majority total domination number of a graph G is = min{f(V): f is a signed majority total dominating function on G}. We research some properties of the signed majority total domination number of a graph G and obtain a few lower bounds of .This research was supported by National Natural Science Foundation of China.     

KMS States for generalized Gauge actions on Cuntz-Krieger algebras

Given a zero-one matrix A we consider certain one-parameter groups of automorphisms of the Cuntz-Krieger algebra , generalizing the usual gauge group, and depending on a positive continuous function H defined on the Markov space _A. The main result consists of an application of Ruelles Perron-Frobenius Theorem to show that these automorphism groups admit a single KMS state.*Partially supported by CNPq.     

Galois Graphs: Walks, Trees and Automorphisms

Given a symmetric polynomial (x, y) over a perfect field k of characteristic zero, the Galois graph G() is defined by taking the algebraic closure as the vertex set and adjacencies corresponding to the zeroes of (x, y). Some graph properties of G(), such as lengths of walks, distances and cycles are described in terms of . Symmetry is also considered, relating the Galois group Gal( /k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.     

Profinite and Continuous Higher K-Theory of Exact Categories, Orders, and Group Rings

Let be a rational prime, an exact category. In this article, we define and study for all , the profinite higher K-theory of , that is as well as , where is the -dimensional mod- Moore space. We study connections between and prove several -completeness results involving these and associated groups including the cases where is the category of finitely generated (resp. finitely generated projective) modules over orders in semi-simple algebras over number fields and p-adic fields. We also define and study continuous K-theory of orders in p-adic semi-simple algebras and show some connection between the profinite and continuous K-theory of .     

Almost block independence and bernoullicity of ℤ d -actions by automorphisms of compact abelian groups

Summary We prove that a ^d -action by automorphisms of a compact, abelian group is Bernoulli if and only if it has completely positive entropy. The key ingredients of the proof are the extension of certain notions of asymptotic block independence from -actions to ^d -action and their equivalence with Bernoullicity, and a surprisingly close link between one of these asymptotic block independence properties for ^d -actions by automorphisms of compact, abelian groups and the product formula for valuations on global fields.Oblatum 20-X-1994     

On a Problem Concerning k-Subdomination Numbers of Graphs

One of numerical invariants concerning domination in graphs is the k-subdomination number of a graph G. A conjecture concerning it was expressed by J.H. Hattingh, namely that for any connected graph G with n vertices and any k with the inequality holds. This paper presents a simple counterexample which disproves this conjecture. This counterexample is the graph of the three-dimensional cube and k = 5.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

Zur Darstellung der Automorphismengruppe einer kinematischen Kettengeometrie im Quadrikenmodell

There is a unique projective representation of the group of automorphisms of a geometry () [1] over a kinematic [3] algebra which is compatible with the quadric model [2].     

Vertex-Transitive Non-Cayley Graphs with Arbitrarily Large Vertex-Stabilizer

A construction is given for an infinite family {_n} of finite vertex-transitive non-Cayley graphs of fixed valency with the property that the order of the vertex-stabilizer in the smallest vertex-transitive group of automorphisms of _n is a strictly increasing function ofn . For each n the graph is 4-valent and arc-transitive, with automorphism group a symmetric group of large prime degree . The construction uses Sierpinski's gasket to produce generating permutations for the vertex-stabilizer (a large 2-group).     

Elementary Abelian Covers of Graphs

Let _G (X) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G Aut X of automorphisms lifts. There is a natural lattice structure on _G (X), where _{1 2} whenever ₂ factors through ₁. The sublattice _G () of coverings which are below a given covering : X^~ X naturally corresponds to a lattice _G () of certain subgroups of the group of covering transformations. In order to study this correspondence, some general theorems regarding morphisms and decomposition of regular covering projections are proved. All theorems are stated and proved combinatorially in terms of voltage assignments, in order to facilitate computation in concrete applications.For a given prime p, let _G ^p (X) _G (X) denote the sublattice of all regular covering projections with an elementary abelian p-group of covering transformations. There is an algorithm which explicitly constructs _G ^p (X) in the sense that, for each member of _G ^p (X), a concrete voltage assignment on X which determines this covering up to equivalence, is generated. The algorithm uses the well known algebraic tools for finding invariant subspaces of a given linear representation of a group. To illustrate the method two nontrival examples are included.