Searching for perfection on hypergraphs

In this paper we study the family of oriented transitive 3-hypergraphs that arise from cyclic permutations and intervals in the circle, in order to search for the notion of perfection on hypergraphs.     

On Finite 2‐Path‐Transitive Graphs

The class of graphs that are 2‐path‐transitive but not 2‐arc‐transitive is investigated. The amalgams for such graphs are determined, and structural information regarding the full automorphism groups is given. It is then proved that a graph is 2‐path‐transitive but not 2‐arc‐transitive if and only if its line graph is half‐arc‐transitive, thus providing a method for constructing new families of half‐arc‐transitive graphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 225–237, 2013     

Characterizations by Automorphism Groups of some Rank 3 Buildings – I. Some Properties of Half Strongly-Transitive Triangle Buildings

In a sequence of papers, we will show that the existence of a (half) strongly-transitive automorphism group acting on a locally finite triangle building forces to be one of the examples arising from PSL₃(K) for a locally finite local skewfield K. Furthermore, we introduce some Moufang-like conditions in affine buildings of rank 3, and characterize those examples arising from algebraic, classical or mixed type groups over a local field. In particular, we characterize the p-adic-like affine rank 3 buildings by a certain p-adic Moufang condition, and show that such a condition has zero probability to survive in hyperbolic rank 3 buildings. This shows that a construction of hyperbolic buildings as analogues of p-adic affine buildings is very unlikely to exist.     

Two‐sided Group Digraphs and Graphs

We study a family of digraphs (directed graphs) that generalises the class of Cayley digraphs. For nonempty subsets of a group G, we define the two‐sided group digraph to have vertex set G, and an arc from x to y if and only if for some and . In common with Cayley graphs and digraphs, two‐sided group digraphs may be useful to model networks as the same routing and communication scheme can be implemented at each vertex. We determine necessary and sufficient conditions on L and R under which may be viewed as a simple graph of valency , and we call such graphs two‐sided group graphs. We also give sufficient conditions for two‐sided group digraphs to be connected, vertex‐transitive, or Cayley graphs. Several open problems are posed. Many examples are given, including one on 12 vertices with connected components of sizes 4 and 8.     

On transitive algebras containing a standard finite von Neumann subalgebra

Let M be a finite von Neumann algebra acting on a Hilbert space H and A be a transitive algebra containing M^′. In this paper we prove that if A is 2-fold transitive, then A is strongly dense in B(H). This implies that if a transitive algebra containing a standard finite von Neumann algebra (in the sense of [U. Haagerup, The standard form of von Neumann algebras, Math. Scand. 37 (1975) 271-283]) is 2-fold transitive, then A is strongly dense in B(H). Non-selfadjoint algebras related to free products of finite von Neumann algebras, e.g., LFn and , are studied. Brown measures of certain operators in are explicitly computed.     

Doubly transitive 2‐factorizations

Let be a 2‐factorization of the complete graph K_v admitting an automorphism group G acting doubly transitively on the set of vertices. The vertex‐set V(K_v) can then be identified with the point‐set of AG(n, p) and each 2‐factor of is the union of p‐cycles which are obtained from a parallel class of lines of AG(n, p) in a suitable manner, the group G being a subgroup of A G L(n, p) in this case. The proof relies on the classification of 2‐(v, k, 1) designs admitting a doubly transitive automorphism group. The same conclusion holds even if G is only assumed to act doubly homogeneously. © 2006 Wiley Periodicals, Inc. J Combin Designs     

The structure of transitive ordered permutation groups

We give some necessary and sufficient conditions for transitive l-permutation groups to be 2-transitive. We also discuss primitive components and give necessary and sufficient conditions for transitive l-permutation groups to be normal-valued.     

Closed‐form formulas for Kirchhoff index

We find closed‐form expressions for the resistance, or Kirchhoff index, of certain connected graphs using Foster's theorems, random walks, and the superposition principle. © 2001 John Wiley & Sons, Inc. Int J Quant Chem 81: 135–140, 2001