Any convex polytope whose combinatorial automorphism group has two orbits on the flags is isomorphic to one whose group of Euclidean symmetries has two orbits on the flags (equivalently, to one whose automorphism group and symmetry group coincide). Hence, a combinatorially two-orbit convex polytope is isomorphic to one of a known finite list, all of which are 3-dimensional: the cuboctahedron, i...

AbstractLet W be a non-empty subset of a free group. The automorphism of a group G is said to be a marginal automorphism, if for all x in G,x^−1alpha(x) in W^*(G), where W^*(G) is the marginal subgroup of G.In this paper, we give necessary and sufficient condition for a purelynon-abelian p-group G, such that the set of all marginal automorphismsof G forms an elementary abelian p-group.

abstractlet w be a non-empty subset of a free group. the automorphism of a group g is said to be a marginal automorphism, if for all x in g,x^−1alpha(x) in w^*(g), where w^*(g) is the marginal subgroup of g.in this paper, we give necessary and sufficient condition for a purelynon-abelian p-group g, such that the set of all marginal automorphismsof g forms an elementary abelian p-group.

suppose $gamma$ is a graph with $v(gamma) = { 1,2, cdots, p}$and $ mathcal{f} = {gamma_1,cdots, gamma_p} $ is a family ofgraphs such that $n_j = |v(gamma_j)|$, $1 leq j leq p$. define$lambda = gamma[gamma_1,cdots, gamma_p]$ to be a graph withvertex set $ v(lambda)=bigcup_{j=1}^pv(gamma_j)$ and edge set$e(lambda)=big(bigcup_{j=1}^pe(gamma_j)big)cupbig(bigcup_{ijine(gamma)}{uv;uin v(gamma_i),vin ...

In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking cons...

A shift automorphism algebra is one satisfying the conditions of the shift automorphism theorem, and a shift automorphism variety is a variety generated by a shift automorphism algebra. In this paper, we show that every shift automorphism variety contains a countably infinite subdirectly irreducible algebra. 2000 Mathematics subject classification: primary 03C05; secondary 08B05, 08B26.

Let P 1⁄4 ðP;LÞ be a topological projective plane with a compact point set P of finite (covering) dimension d 1⁄4 dimP > 0. A systematic treatment of such planes can be found in the book Compact Projective Planes [15]. Each line L A L is homotopy equivalent to a sphere Sl with l j 8, and d 1⁄4 2l, see [15] (54.11). In all known examples, L is in fact homeomorphic to Sl. Taken with the compact-o...

We call a Cayley digraph Γ = Cay(G,S) normal for G if R(G), the right regular representation of G, is a normal subgroup of the full automorphism group Aut(Γ) of Γ. In this paper we determine the normality of Cayley digraphs of valency 2 on the groups of order pq and also on non-abelian finite groups G such that every proper subgroup of G is abelian.