Coinitial Grapfis and Whitehead Automorphisms

1979 ◽  
Vol 31 (1) ◽  
pp. 112-123 ◽  
Author(s):  
A. H. M. Hoare
Keyword(s):  
Automorphism Groups ◽  
Fuchsian Groups ◽  
Topological Methods ◽  
Combinatorial Properties ◽  
Algebraic Proofs

Coinitial graphs were used in [2; 3 ; 4] as a combinatorial tool in the Reidemeister- Schreier process in order to prove subgroup theorems for Fuchsian groups. Whitehead had previously introduced such graphs but used topological methods for his proofs [8; 9]. Subsequently Rapaport [7] and Iliggins and Lyndon [1] gave algebraic proofs of the results in [9], and AIcCool [5; 6] has further developed these methods so that presentations of automorphism groups could be found.In this paper it is shown that Whitehead automorphisms can be described by a “cutting and pasting” operation on coinitial graphs. Section 1 defines and gives some combinatorial properties of these operations, based on [1].

CROSS RATIO GRAPHS

2001 ◽  
Vol 64 (2) ◽  
pp. 257-272 ◽  
Author(s):  
A. GARDINER ◽  
CHERYL E. PRAEGER ◽  
SANMING ZHOU
Keyword(s):  
Automorphism Groups ◽  
Projective Line ◽  
Cross Ratio ◽  
Transitive Graph ◽  
Combinatorial Properties ◽  
The Family ◽  
The Cross ◽  
Transitive Graphs ◽  
Ordered Pairs

A family of arc-transitive graphs is studied. The vertices of these graphs are ordered pairs of distinct points from a finite projective line, and adjacency is defined in terms of the cross ratio. A uniform description of the graphs is given, their automorphism groups are determined, the problem of isomorphism between graphs in the family is solved, some combinatorial properties are explored, and the graphs are characterised as a certain class of arc-transitive graphs. Some of these graphs have arisen as examples in studies of arc-transitive graphs with complete quotients and arc-transitive graphs which ‘almost cover’ a 2-arc transitive graph.

scholarly journals A Finite Word Poset

10.37236/1607 ◽  
2000 ◽  
Vol 8 (2) ◽  
Author(s):  
Péter L. Erdős ◽  
Péter Sziklai ◽  
David C. Torney
Keyword(s):  
Automorphism Groups ◽  
Partial Ordering ◽  
Finite Alphabet ◽  
Combinatorial Properties ◽  
Normalized Matching Property ◽  
Finite Word

Our word posets have finite words of bounded length as their elements, with the words composed from a finite alphabet. Their partial ordering follows from the inclusion of a word as a subsequence of another word. The elemental combinatorial properties of such posets are established. Their automorphism groups are determined (along with similar result for the word poset studied by Burosch, Frank and Röhl [4]) and a BLYM inequality is verified (via the normalized matching property).

RESIDUAL FINITENESS OF OUTER AUTOMORPHISM GROUPS OF FINITELY GENERATED NON-TRIANGLE FUCHSIAN GROUPS

2005 ◽  
Vol 15 (01) ◽  
pp. 59-72 ◽  
Author(s):  
R. B. J. T. ALLENBY ◽  
GOANSU KIM ◽  
C. Y. TANG
Keyword(s):  
Automorphism Groups ◽  
Outer Automorphism ◽  
Fuchsian Groups ◽  
Residual Finiteness ◽  
Finitely Generated ◽  
Free Products ◽  
Residually Finite ◽  
Hnn Extensions ◽  
Outer Automorphism Groups ◽  
Orientable Surfaces

In [5] Grossman showed that outer automorphism groups of free groups and of fundamental groups of compact orientable surfaces are residually finite. In this paper we introduce the concept of "Property E" of groups and show that certain generalized free products and HNN extensions have this property. We deduce that the outer automorphism groups of finitely generated non-triangle Fuchsian groups are residually finite.

scholarly journals On Computing the Distinguishing Numbers of Trees and Forests

10.37236/1037 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Christine T. Cheng
Keyword(s):  
Automorphism Groups ◽  
Combinatorial Properties ◽  
Distinguishing Number ◽  
Minimum Number

Let $G$ be a graph. A vertex labeling of $G$ is distinguishing if the only label-preserving automorphism of $G$ is the identity map. The distinguishing number of $G$, $D(G)$, is the minimum number of labels needed so that $G$ has a distinguishing labeling. In this paper, we present $O(n \log n)$-time algorithms that compute the distinguishing numbers of trees and forests. Unlike most of the previous work in this area, our algorithm relies on the combinatorial properties of trees rather than their automorphism groups to compute for their distinguishing numbers.

scholarly journals Further steps on the reconstruction of convex polyominoes from orthogonal projections

2021 ◽  
Author(s):  
Paolo Dulio ◽  
Andrea Frosini ◽  
Simone Rinaldi ◽  
Lama Tarsissi ◽  
Laurent Vuillon
Keyword(s):  
Discrete Geometry ◽  
Convex Subset ◽  
Convex Sets ◽  
A Priori ◽  
Orthogonal Projections ◽  
Reconstruction Process ◽  
Combinatorial Properties ◽  
The Family ◽  
Discrete Counterpart ◽  
Interior Part

AbstractA remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.

scholarly journals Cwebs beyond three loops in multiparton amplitudes

2021 ◽  
Vol 2021 (3) ◽  
Author(s):  
Neelima Agarwal ◽  
Lorenzo Magnea ◽  
Sourav Pal ◽  
Anurag Tripathi
Keyword(s):  
Gauge Theories ◽  
Anomalous Dimension ◽  
Wilson Line ◽  
Building Blocks ◽  
Feynman Diagrams ◽  
Loop Order ◽  
Abelian Gauge ◽  
Sum Rule ◽  
Combinatorial Properties ◽  
Low Dimensional

Abstract Correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of collections of Feynman diagrams called webs. In [1] we introduced the concept of Cweb, or correlator web, which is a set of skeleton diagrams built with connected gluon correlators, and we computed the mixing matrices for all Cwebs connecting four or five Wilson lines at four loops. Here we complete the evaluation of four-loop mixing matrices, presenting the results for all Cwebs connecting two and three Wilson lines. We observe that the conjuctured column sum rule is obeyed by all the mixing matrices that appear at four-loops. We also show how low-dimensional mixing matrices can be uniquely determined from their known combinatorial properties, and provide some all-order results for selected classes of mixing matrices. Our results complete the required colour building blocks for the calculation of the soft anomalous dimension matrix at four-loop order.

Pentavalent 1-Transitive Digraphs with Non-Solvable Automorphism Groups

2020 ◽  
Vol 51 (4) ◽  
pp. 1919-1930
Author(s):  
Masoumeh Akbarizadeh ◽  
Mehdi Alaeiyan ◽  
Raffaele Scapellato
Keyword(s):  
Automorphism Groups
Sign in / Sign up

Export Citation Format

Share Document