9,295 research outputs found
Regular two-graphs and extensions of partial geometries
Geometry;meetkunde
Regular Incidence Complexes, Polytopes, and C-Groups
Regular incidence complexes are combinatorial incidence structures
generalizing regular convex polytopes, regular complex polytopes, various types
of incidence geometries, and many other highly symmetric objects. The special
case of abstract regular polytopes has been well-studied. The paper describes
the combinatorial structure of a regular incidence complex in terms of a system
of distinguished generating subgroups of its automorphism group or a
flag-transitive subgroup. Then the groups admitting a flag-transitive action on
an incidence complex are characterized as generalized string C-groups. Further,
extensions of regular incidence complexes are studied, and certain incidence
complexes particularly close to abstract polytopes, called abstract polytope
complexes, are investigated.Comment: 24 pages; to appear in "Discrete Geometry and Symmetry", M. Conder,
A. Deza, and A. Ivic Weiss (eds), Springe
Problems on Polytopes, Their Groups, and Realizations
The paper gives a collection of open problems on abstract polytopes that were
either presented at the Polytopes Day in Calgary or motivated by discussions at
the preceding Workshop on Convex and Abstract Polytopes at the Banff
International Research Station in May 2005.Comment: 25 pages (Periodica Mathematica Hungarica, Special Issue on Discrete
Geometry, to appear
On highly regular strongly regular graphs
In this paper we unify several existing regularity conditions for graphs,
including strong regularity, -isoregularity, and the -vertex condition.
We develop an algebraic composition/decomposition theory of regularity
conditions. Using our theoretical results we show that a family of non rank 3
graphs known to satisfy the -vertex condition fulfills an even stronger
condition, -regularity (the notion is defined in the text). Derived from
this family we obtain a new infinite family of non rank strongly regular
graphs satisfying the -vertex condition. This strengthens and generalizes
previous results by Reichard.Comment: 29 page
Permutation group approach to association schemes
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid to the schurity problem and the separability problem. Several applications of schemes to constructing polynomial-time algorithms, in particular, graph isomorphism tests, are discussed
- …