Applications of group theory to combinatorics

1st Edition Jack Koolen pdf download

https://ebookname.com/product/applications-of-group-theory-to-
combinatorics-1st-edition-jack-koolen/

Get Instant Ebook Downloads – Browse at https://ebookname.com

Instant digital products (PDF, ePub, MOBI) available
Download now and explore formats that suit you...

Molecular symmetry and group theory a programmed

introduction to chemical applications 2nd ed Edition
Vincent

https://ebookname.com/product/molecular-symmetry-and-group-
theory-a-programmed-introduction-to-chemical-applications-2nd-ed-
edition-vincent/

Advanced Graph Theory and Combinatorics 1st Edition

Michel Rigo

https://ebookname.com/product/advanced-graph-theory-and-
combinatorics-1st-edition-michel-rigo/

Combinatorics automata and number theory Valérie Berthé

https://ebookname.com/product/combinatorics-automata-and-number-
theory-valerie-berthe/

Oracle Cloud Infrastructure A Guide to Building Cloud

Native Applications 1st Edition Jeevan Joseph

https://ebookname.com/product/oracle-cloud-infrastructure-a-
guide-to-building-cloud-native-applications-1st-edition-jeevan-
joseph/
Hierarchy in International Relations 1st Edition David
A. Lake

https://ebookname.com/product/hierarchy-in-international-
relations-1st-edition-david-a-lake/

Clinical Trials in Cancer Principles and Practice

Oxford Medical Publications 1st Edition David J.
Girling

https://ebookname.com/product/clinical-trials-in-cancer-
principles-and-practice-oxford-medical-publications-1st-edition-
david-j-girling/

Prealgebra An Applied Approach 6th Edition Richard N.

Aufmann

https://ebookname.com/product/prealgebra-an-applied-approach-6th-
edition-richard-n-aufmann/

Catalysys and Surface Science First Edition Somorjai

https://ebookname.com/product/catalysys-and-surface-science-
first-edition-somorjai/

Organization Development at Work Margaret Wheatley

https://ebookname.com/product/organization-development-at-work-
margaret-wheatley/
■■■■■■■ N3 ■■ Nihongo So matome N3 Vocabulary 1st
Edition ■■■ ■■

https://ebookname.com/product/%e6%97%a5%e6%9c%ac%e8%aa%9e%e7%b7%8
f%e3%81%be%e3%81%a8%e3%82%81-n3-%e8%aa%9e%e5%bd%99-nihongo-so-
matome-n3-vocabulary-1st-
edition-%e4%bd%90%e3%80%85%e6%9c%a8-%e4%bb%81%e5%ad%90/
APPLICATIONS OF GROUP THEORY TO COMBINATORICS
SELECTED PAPERS FROM THE COM2MAC CONFERENCE ON APPLICATIONS OF
GROUP THEORY TO COMBINATORICS, POHANG, KOREA, 9–12 JULY 2007

Applications of Group Theory

to Combinatorics
Editors
Jack Koolen
Department of Mathematics, Pohang University of Science
and Technology, Pohang 790–784, Korea

Jin Ho Kwak
Department of Mathematics, Pohang University of Science
and Technology, Pohang 790–784, Korea

Ming-Yao Xu
Department of Mathematics, Peking University, Beijing 100891, P.R. China
Supported by Com2 MaC-KOSEF, Korea

CRC Press/Balkema is an imprint of the Taylor & Francis Group, an informa business

© 2008 Taylor & Francis Group, London, UK

Typeset by Vikatan Publishing Solutions (P) Ltd., Chennai, India

Printed and bound in Great Britain by Anthony Rowe (A CPI-group Company),
Chippenham, Wiltshire

All rights reserved. No part of this publication or the information contained herein may be repro-
duced, stored in a retrieval system, or transmitted in any form or by any means, electronic,
mechanical, by photocopying, recording or otherwise, without written prior permission from the
publisher.

Although all care is taken to ensure integrity and the quality of this publication and the information
herein, no responsibility is assumed by the publishers nor the author for any damage to the property
or persons as a result of operation or use of this publication and/or the information contained herein.

Published by: CRC Press/Balkema

P.O. Box 447, 2300 AK Leiden, The Netherlands
e-mail: [email protected]
www.crcpress.com – www.taylorandfrancis.co.uk – www.balkema.nl

ISBN: 978-0-415-47184-8 (Hardback)

ISBN: 978-0-203-88576-5 (ebook)
 Applications of Group Theory to Combinatorics - Koolen, Kwak & Xu (eds)
© 2008 Taylor & Francis Group, London, ISBN 978-0-415-47184-8

Table of Contents

Foreword VII
About the editors IX

Combinatorial and computational group-theoretic methods in the

study of graphs, maps and polytopes with maximal symmetry 1
M. Conder
Automorphism groups of Cayley digraphs 13
Y.-Q. Feng, Z.-P. Lu & M.-Y. Xu
Symmetrical covers, decompositions and factorisations of graphs 27
M. Guidici, C.H. Li & C.E. Praeger
Complete bipartite maps, factorisable groups and generalised Fermat curves 43
G.A. Jones
Separability properties of groups 59
G. Kim & C.Y. Tang
Coverings, enumeration and Hurwitz problems 71
J.H. Kwak, J. Lee & A. Mednykh
Combinatorial facets of Hurwitz numbers 109
S.K. Lando
Groups and designs 133
H. Li
Injectivity radius of triangle group representations, with application
to regular embeddings of hypermaps 147
M. Mačaj, J. Širáň & M. Ipolyiová
Genus parameters and sizings of groups 155
T.W. Tucker
Belyi functions: Examples, properties and applications 161
A.K. Zvonkin

Author index 181

V
 Applications of Group Theory to Combinatorics - Koolen, Kwak & Xu (eds)
© 2008 Taylor & Francis Group, London, ISBN 978-0-415-47184-8

Foreword

The 2007 Com2 MaC International Workshop on Applications of Group Theory to Combinatorics
was held at Pohang University of Science and Technology on July 9–12, 2007 under the sponsorship
of the Combinatorial and Computational Mathematics Center. The aim of the meeting was to bring
together some foremost experts in the areas of combinatorics, group theory and combinatorial
topology in order to stimulate mutual understandings, communications and researches among all
the participants. Presented and discussed topics encompass quite a diverse spectrum, such as coding
theory, design theory, Belyi functions, distance-regular graphs, transitive graphs, regular maps, and
Hurwitz problems.
Among the about 70 participants from Australia, China, France, Japan, Korea, Netherlands, New
Zealand, Russia, Singapore, Slovakia, Slovenia, United Kingdom and United States of America,
27 invited speakers presented their results. This volume contains 11 papers of invited talks at the
workshop which mark the vitality and enthusiasm during the workshop.
Marston Conder gives a brief summary of various aspects of combinatorial group theory and
associated computational methods, with special reference to finitely-presented groups and their
applications, found useful in the study of graphs, maps and polytopes having maximal symmetry.
He discusses recent computational results and how this led to new general results in the theory
of maps.
Yan-Quan Feng, Zai-Ping Lu and Ming-Yao Xu give a brief survey of recent results on
automorphism groups of Cayley digraphs concentrating on the normality of Cayley digraphs.
Michael Giudici, Cai Heng Li and Cheryl E. Praeger introduce three new types of combinatorial
structures associated with group actions, namely symmetrical covers, symmetrical decompositions,
and symmetrical factorisations of graphs. These structures are related to and generalise various
combinatorial objects, such as 2-designs, regular maps, near-polygonal graphs, and linear spaces.
General theory is developed for each of these structures, pertinent examples and constructions are
given, and a number of open research problems are posed.
Gareth Jones surveys recent progress on the combinatorial problem of classifying the orientably
regular embeddings of complete bipartite graphs. The motivation for this problem comes from
two main areas, topological graph theory and arithmetic algebraic geometry, while the techniques
required to solve it come from a third area, finite group theory—specifically the theories of factor-
isable groups and of finite solvable groups.
Goansu Kim and C.Y. Tang discuss separability properties of groups. They discuss S-
separable groups, in particular, residually finite groups, subgroup separable groups and con-
jugacy separable groups.
Jin Ho Kwak, Jaeun Lee and Alexander Mednykh discuss the enumeration problem for
(branched) coverings of Riemann surfaces and, more generally, graphs, manifolds and orbifolds
with finitely generated fundamental group. They present some well-known results in this field,
recent developments of the problem and indicate a general approach to solve the problem in the
high-dimensional case. They cover group-theoretical, combinatorial and topological view points
on the problem.
Sergei Lando surveys recent progress in understanding Hurwitz numbers, with stress made on
their combinatorial rather than geometric nature. Hurwitz numbers enumerate ramified coverings
of two-dimensional surfaces. They have many other manifestations in other fields such as in group
theory, combinatorics, algebraic topology and mathematical physics.

VII
 Huiling Li discusses the applications of finite permutation groups to combinatorial designs.
He discusses block transitive 2 − (v, k, 1) designs with k small and how classical groups act on
designs.
Martin Mačaj, Jozef Širáň and Mária Ipolyiová survey the algebraic background for constructing
representations of triangle groups in linear groups over algebras arising from quotients of multi-
variate polynomial rings, leading to improvements of upper bounds on the order of epimorphic
images of triangle groups with a given injectivity radius and to bounds on the size of the associated
hypermaps with a given planar width.
Tom Tucker views the various genus parameters for finite groups in the broader context of
‘sizings’ of groups, that is, order-preserving functions from the collection of all finite groups to
the natural numbers. He discusses topics like the range of a sizing and whether a sizing provides a
certificate of isomorphism. Also he discusses asymptotic behavior of several sizings.
Alexander Zvonkin studies Belyi functions, also known as dessins d’enfants. These functions
provide a link between many important theories, namely Riemann surfaces, Galois theory, and the
theory of combinatorial maps. More generally, many properties of functions, surfaces, fields, and
groups in question may be ‘‘read from’’ the corresponding pictures, or sometimes constructed in a
‘‘picture form’’. Group theory is related to all the above subjects and therefore plays a central role
in the theory of Belyi functions.
The organizers truly thank Ministry of Science and Technology of Korea and the Korean Science
and Engineering Foundation for their financial support for this successful workshop.

Jack Koolen
Jin Ho Kwak
Ming-Yao Xu

VIII
 Applications of Group Theory to Combinatorics - Koolen, Kwak & Xu (eds)
© 2008 Taylor & Francis Group, London, ISBN 978-0-415-47184-8

About the editors

Jack Koolen teaches in the Department of Mathematics at the Pohang

University of Science and Technology. His main research interests
lie in the interaction of geometry, linear algebra and combinatorics.
He has published more than 60 papers in these areas.

Jin Ho Kwak is a professor in the Department of Mathematics at

the Pohang University of Science and Technology and the direc-
tor of the Combinatorial and Computational Mathematics Center
(Com2 MaC). He works on combinatorics and topology, mainly on
covering enumeration related to Hurwitz problems and regular maps
on surfaces. He has published more than 100 papers in these areas.

Ming-Yao Xu is a professor in the Department of Mathematics at

Peking University. He works on finite group theory and algebraic
graph theory. His main research interests lie in finite p-groups and
the interaction of groups and graphs. He has published more than 80
papers in these areas.

IX
X
 Applications of Group Theory to Combinatorics – Koolen, Kwak & Xu (eds)
© 2008 Taylor & Francis Group, London, ISBN 978-0-415-47184-8

Combinatorial and computational group-theoretic methods in the study

of graphs, maps and polytopes with maximal symmetry

Marston Conder1
Department of Mathematics, University of Auckland, Auckland, New Zealand

ABSTRACT: This paper gives a brief summary of various aspects of combinatorial group theory
and associated computational methods, with special reference to finitely-presented groups and
their applications, found useful in the study of graphs, maps and polytopes having maximal
symmetry. Recent results include the determination of all arc-transitive cubic graphs on up to
2048 vertices, and of all regular maps of genus 2 to 100, and construction of the first known
examples of finite chiral 5-polytopes. Moreover, patterns in the maps data have led to new
theorems about the genus spectrum of chiral maps and regular maps with simple underlying
graph.

2000 Mathematics Subject Classification: 20B25 (primary), 05C25, 20F05, 52B15, 57M60
(secondary).

1 INTRODUCTION

This paper is intended to give a brief summary of various aspects of combinatorial group theory
and associated computational methods that have proved useful (to the author, at least) in the study
of graphs, maps and polytopes having maximum possible symmetry under certain conditions.
It extends (and updates) an earlier summary given in [9], but is not intended to be a comprehensive
survey, by any means. Our aim is to provide examples of potential interest to students and others
wishing to learn about the use of such theory and methods, together with some references to places
where further details are available.
Special focus is given to finitely-presented groups and means of investigating them (and their
subgroups of finite index and quotients of finite order), with numerous applications.
We begin by giving some background on symmetries of discrete structures and their connection
with certain finitely-presented groups, in Section 2. Then in Section 3 we briefly describe some
ways in which Schreier coset diagrams can be used to depict and construct homomorphic images
of these groups, and give some applications to exhibit the remarkable power of such an approach.
We summarise a number of computational procedures for handling finitely-presented groups in
Section 4, and then look at the particular case of methods for finding subgroups of small index and
quotient of small order, in Section 5. Finally, we describe a theorem of Schur about centre-by-finite
groups and its use in these contexts in Section 6, and complete the paper by announcing some
recent results about the genus spectra of various classes of arc-transitive maps in Section 7.

1 Research supported in part by the N.Z. Marsden Fund, Grant UOA 412.

1
2 BACKGROUND: SYMMETRIES OF DISCRETE STRUCTURES,
AND CONNECTIONS WITH FINITELY-PRESENTED GROUPS

2.1 Symmetric graphs

An automorphism of a (combinatorial) graph X = (V , E) is any permutation of its vertices that
preserves adjacency. Under composition, the set of all automorphisms of X forms a group known as
the automorphism group of X and denoted by Aut X . A graph X is called vertex-transitive, edge-
transitive or arc-transitive automorphism group Aut X has a single orbit on the set of vertices,
edges or arcs (ordered edges) of X , respectively. Graphs which are arc-transitive are also called
symmetric, and any graph that is edge-transitive but not vertex-transitive is called semisymmetric.
More generally, for any positive integer s, an s-arc in a graph X is a directed walk of length s
which never includes the reverse of an arc just crossed—that is, an ordered (s + 1)-tuple of
vertices (v0 , v1 , v2 , . . . , vs−1 , vs ) such that any two consecutive vi are adjacent in X and any three
consecutive vi are distinct. A graph X is then called s-arc-transitive if Aut X has a single orbit on
the set of arcs of X . For example, circuit graphs are s-arc-transitive for all s, while the cube graph
Q3 and all complete graphs on more than three vertices are 2-arc-transitive but not 3-arc-transitive.
The situation for arc-transitive 3-valent graphs (also called symmetric cubic graphs) is particu-
larly interesting. In [32, 33] Tutte proved that if G is the automorphism group of a finite symmetric
cubic graph, then G is sharply-transitive on the set of s-arcs of X for some s ≤ 5 (in which case
X is called s-arc-regular). The smallest example of a finite 5-arc-regular cubic graph is Tutte’s
8-cage, on 30 vertices, depicted in Figure 1.
By further theory of symmetric cubic graphs (developed by Tutte, Goldschmidt, et al), it is
now known that if X is a 5-arc-regular cubic graph, then Aut X is a homomorphic image of the
finitely-presented group

G5 =  h, a, p, q, r, s | h3 = a2 = p2 = q2 = r 2 = s2 = 1,
pq = qp, pr = rp, ps = sp, qr = rq, qs = sq, sr = pqrs,
ap = qa, ar = sa, h−1 ph = p, h−1 qh = r, h−1 rh = pqr, shs = h−1 ,

with the subgroups H = h, p, q, r, s, A = a, p, q, r, s and H ∩ A = p, q, r, s mapping to the
stabilizers of a vertex, edge and arc, respectively.
Conversely, given any epimorphism θ : G5 → G to a finite group G, with torsion-free kernel
K, a cubic graph X may be constructed on which G acts 5-arc-regularly: Take as vertices the

Figure 1. Tutte’s 8-cage.

2
right cosets of V = HK in G5 , and join Vx to Vy by an edge whenever xy−1 ∈ VaV . Under right
multiplication by G5 , the stabilizer of the vertex V is V , which induces S3 on the neighbourhood
{Ha, Hah, Hah−1 } of H , and the group induced on X is G5 /K ∼ = G. Thus 5-arc-regular cubic graphs
correspond to non-degenerate homomorphic images of the group G5 . See [18] for further details.
Tutte’s work for symmetric 3-valent graphs was extended by Richard Weiss to the study of finite
symmetric graphs of arbitrary valency, using the classification of doubly-transitive permutation
groups. In particular, Weiss proved the following generalisation of Tutte’s theorem in [34, 35]:

Theorem 1. (Weiss, 1981 & 1987) There are no finite k-arc-transitive graphs of degree > 2
for k ≥ 8. Moreover, if X is a finite 7-arc-transitive graph of degree d > 2, then d = 3t + 1
for some positive integer t, and G = Aut X is obtainable as a homomorphic image of a certain
finitely-presented group Rd,7 .

For example, R4,7 has a presentation in terms of generators p, q, r, s, t, u, v, h, b subject to defin-

ing relations that include h4 = p3 = q3 = r 3 = s3 = t 3 = u3 = v2 = b2 = 1, (hu)3 =
(uv)2 = (huv)2 = [h2 , u] = [h2 , v] = 1, [s, t] = p, [q, r] = 1, and so on, and the automorphism
group of every finite 7-arc-transitive 4-valent graph is a non-degenerate homomorphic image of
this group R4,7 .

2.2 Regular maps

A map is a 2-cell embedding of a connected (multi)graph in a surface, and an automorphism of a
map M is any permutation of its edges that preserves incidence. A map M is called regular if its
automorphism group Aut M is sharply-transitive (regular) on flags, that is, on incident vertex-edge-
face triples. Similarly, a map M on an orientable surface is called rotary (or orientably-regular) if
the group of all its orientation-preserving automorphisms is transitive on the ordered edges of M .
If M is rotary or regular then every face has the same number of edges (say p) and every vertex
has the same valency (say q), and M has type {p, q}. Regular maps of type {p, q} correspond to
non-degenerate homomorphic images of the full (2, p, q) triangle group  =  a, b, c | a2 = b2 =
c2 = (ab)p = (bc)q = (ac)2 = 1; the image of a, b gives the stabilizer of a vertex v, the image of
a, c gives the stabilizer of an edge e, and the image of b, c gives the stabilizer of a face f , where
(v, e, f ) is a flag, and incidence corresponds to non-empty intersection of cosets. Similarly, rotary

a
K Ka

Figure 2. Chirality in terms of normal subgroups of o .

3
maps of type {p, q} correspond to non-degenerate homomorphic images of the ordinary (2, p, q)
triangle group o =  x, y, z | xp = yq = z 2 = xyz = 1 , which has index 2 in  (when x, y, z are
taken as ab, bc, ca respectively). See [12] for further details.
If the rotary map M of type {p, q} admits no orientation-reversing automorphisms, then M is said
to be irreflexible, or chiral, and Aut M is a quotient of the ordinary (2, p, q) triangle group o but
not the full (2, p, q) triangle group . In that case, the kernel K of the corresponding epimorphism
θ : o → Aut M is not normal in . Indeed if M is rotary and θ : o → Aut M is the corresponding
non-degenerate homomorphism, then M is reflexible if and only if K is normalized by any element
a ∈  \ o :
If the subgroup K is not so normalized, then the rotary map M is chiral and K a is the kernel of
the corresponding epimorphism for the mirror image of M .

2.3 Abstract polytopes

An abstract polytope of rank n is a partially ordered set P endowed with a strictly monotone rank
function having range {−1, . . . , n}. The elements of rank 0, 1 and n − 1 are called the vertices,
edges and facets of the polytope, respectively. For −1 ≤ j ≤ n, elements of P of rank j are called
the j-faces, and a typical j-face is denoted by Fj . We require that P have a smallest (−1)-face F−1 ,
and a greatest n-face Fn , and that each maximal chain (or flag) of P has length n + 2, and is of the
form F−1 − F0 − F1 − F2 − · · · − Fn−1 − Fn .
This poset P must satisfy certain combinatorial conditions which generalise the properties of
geometric polytopes. One requirement is a kind of homogeneity property, called the diamond
condition: whenever F ≤ G, with rank(F) = j −1 and rank(G) = j +1, there are exactly two
j-faces Hi such that F ≤ Hi ≤ G. It is further required that P be strongly flag-connected, which
means that any two flags  and  of P can be joined by a sequence of flags  = 0 , 1 , . . . , k =
 such that each two successive faces i−1 and i are adjacent (that is, differ in only one face),
and  ∩  ⊆ i for all i.
An automorphism of an abstract polytope P is an order-preserving bijection P → P . A polytope
P is regular if the automorphism group (P ) is transitive on the flags of P .
When P is regular, (P ) can be generated by n involutions ρ0 , ρ1 , . . . , ρn−1 , where each ρi maps
a given base flag  to the adjacent flag i (differing from  only in its i-face). These generators
satisfy (among others) the defining relations for the Coxeter group of Schläfli type [p1 , . . . , pn−1 ],
where pi = o(ρi−1 ρ i ) for 1 ≤ i < n.
The generators ρi for (P ) also satisfy an extra condition known as the intersection condition,
namely  ρi : i ∈ I  ∩  ρi : i ∈ J  =  ρi : i ∈ I ∩ J  for every I , J ⊆ {0, 1, . . . , n − 1}.

Figure 3. Partial illustration of a 3-polytope.

4
 n

p1 p2 p

Figure 4. Dynkin diagram for the Coxeter group [p1 , . . . , pn−1 ].

Conversely, if  is a permutation group generated by n elements ρ0 , ρ1 , . . . , ρn−1 which satisfy

the defining relations for a Coxeter group of rank n and satisfy the intersection condition, then
there exists a polytope P with (P ) ∼= .
Similarly, chiral polytopes of rank n are obtainable from certain non-degenerate homomorphic
images of the ‘even-word’ subgroups  ρi−1 ρi : 1 ≤ i < n  of these n-generator Coxeter groups.
The automorphism group of a chiral polytope has two orbits on flags, with adjacent flags always
lying in different orbits.
See [15, 29] (and references therein) for further details.

3 SCHREIER COSET DIAGRAMS

Given a transitive permutation representation of a finitely-generated group G on a set , the effect

of the generators of G on  can be depicted by a graph with  as vertex-set, and edges joining α to
α x for each point α ∈  and every element x in some generating set for G. Such a graph is known
as a Schreier coset graph (or coset diagram) because, equivalently, given a subgroup H of G, the
effect of the generators of G by right multiplication on right cosets of H can be depicted by the same
graph, with  taken as the coset space (G : H ), and edges joining Hg to Hgx for every generator x.
(The correspondence is obtained by letting H be the stabilizer of any point of .) See [25, 8] for
further details.
For example, Figure 5 gives a coset diagram for an action of the ordinary (2, 3, 7) triangle group
 x, y | x2 = y3 = (xy)7 = 1 on 7 points, in which the triangles and heavy dot depict 3-cycles and
the fixed point of the permutation induced by the generator y:
Often two Schreier coset diagrams for the same group G on (say) m and n points can be
composed to produce a transitive permutation representation of larger degree m+n. This technique
(attributable to Graham Higman) can be used in some instances to construct families of epimorphic
images of the given group G (and interesting objects on which they act), and to prove that G is
infinite. For example, one method of composition of coset graphs for the ordinary (2, 3, 7) triangle
group is illustrated in Figure 6.
This method was used to prove, for example, that for every integer m ≥ 7, all but finitely
alternating and symmetric groups are epimorphic images of the (2, 3, m) triangle group—and
hence for all but finitely many n, there exists a rotary map M of type {3, m} with An or Sn as its
orientation-preserving group of automorphisms (see [5]). In fact all those maps are regular, but the
same method can be adapted to prove that for all m ≥ 7 and for all but finitely many n (for each
m), there exists a chiral map M of type {3, m} with Aut(M ) ∼ = An (see [3]). More generally, Brent

2 1

5 6 7

Figure 5. Example of a coset diagram.

5
Figure 6. Composition of coset graphs for the ordinary (2, 3, 7) triangle group.

Everitt has proved that every Fuchsian group has all but finitely many An among its epimorphic
images; see [27].
A variant of this method of composition can be used to prove that there are infinitely many
5-arc-transitive connected finite cubic graphs [6], and infinitely many 7-arc-transitive connected
finite 4-valent graphs [24]. A more careful analysis shows even that there are infinitely many
5-arc-transitive 3-valent finite Cayley graphs, and that every such Cayley graph is a cover of one
of just six examples, and that for every positive integer t, there are infinitely many 7-arc-transitive
finite Cayley graphs of valency 1+3t (see [10]).

4 COMPUTATIONAL PROCEDURES

The last 40 years have seen the development of a wide range of efficient computational procedures
for investigating groups with a small number of generators and defining relations. Here we give a
brief description of some of those which are very useful in the kinds of contexts mentioned earlier
in this paper. All of these procedures are available in the MAGMA package [1]. For further details
and references, see the very helpful books on computational group theory by Sims [31] and Eick,
Holt & O’Brien [28].
• Todd-Coxeter coset enumeration: This attempts to determine the index of a given finitely-
generated subgroup H in a given finitely-presented group G = X | R, by systematically
enumerating the right cosets of H in G; when it succeeds, the output can given in the form
of a coset table (in which the (i, j)th entry indicates the number of the coset obtained by multi-
plying the ith coset of H by the jth generator of G), or as permutations induced by the generators
of G on right cosets of H .
• Reidemeister-Schreier algorithm: This gives a defining presentation for a subgroup H of finite
index in a finitely-presented group G = X | R, when the coset table is known; the generators
for H are Schreier generators (obtainable from a Schreier transversal for H in G, which can be
identified with a rooted spanning tree for the corresponding coset graph for (G : H )), and the
relations are easily derived from the coset table and the relations for G (or by ‘chasing’ each
relation for G around the coset diagram).
• Abelian quotient algorithm: This produces the direct factors of the abelianisation G/G =
G/[G, G] of a finitely-presented group G = X | R, in Smith normal form. When taken together
with a variant of the Reidemeister-Schreier algorithm, it can also determine the abelianisation
H /H of a subgroup H of finite index in G, when the coset table for H in G is known.
• Low index subgroups algorithm: This finds a representative of each conjugacy class of subgroups
of up to a given index n in a finitely-presented group G = X | R, and will be explained further
in the next Section.

6
• p-quotient algorithm: This finds, for a given prime p and a given positive integer c, the largest
possible quotient P of the finitely-presented group G = X | R with the property that P is a
p-group of class at most c; for example, when c = 1 or 2 this is the largest abelian or metabelian
p-quotient, respectively.
• Nilpotent quotient algorithm: This finds, for a given positive integer c, the largest possible
nilpotent quotient of the finitely-presented group G = X | R of class at most c; for example,
when c = 1 or 2 this is the largest abelian or metabelian quotient, respectively.

5 LOW INDEX SUBGROUPS METHODS

Given a finitely-presented group G = X | R and a (small) positive integer n, all subgroups of

index up to n in G can be found (up to conjugacy) by a systematic enumeration of coset tables
with up to n rows. In practice, this is achieved by using an extended coset table, which includes
the effect of multiplying cosets of the (pseudo-) subgroup by the inverses of the elements of the
generating set X for G, as depicted below:
Such tables are assumed to be in normal form, which means that lexicographically, no coset
number j appears for the first time before a coset number k less than j. The enumeration procedure
usually defines more than n cosets, and then coincidences are forced between cosets. As cosets Hv
and Hw of a subgroup H are equal if and only if vw−1 ∈ H , forcing any coincidence gives rise to a
new element of the subgroup, which is then taken as an additional generator of the subgroup. The
fact that every subgroup of finite index in G is finitely-generated (by Schreier’s theorem) ensures
that this procedure will terminate, given sufficient time and memory. See [31, 28, 14] for further
details and references.
A key point about the low index subgroups algorithm is that it can be used to find ‘small’ finite
epimorphic images of a finitely-presented group G: for each subgroup H of index n in G, the
permutations induced by generators of G on right cosets of H generate the factor group G/K where
K is the core of H (the intersection of all conjugates of H ) in G, as a subgroup of Sn .
These images can often be used as the ‘building blocks’ for the construction of larger images
(as in Section 3), or produce interesting examples in their own right. For instance, the first known
examples of arc-transitive cubic graphs admitting no edge-reversing automorphisms of order 2,
and first known 5-arc–transitive cubic graph having no s-arc-regular group of automorphisms for
s < 5, were found in this way (see [18]). The same approach was used to help construct infinite
family of 4-arc-transitive connected finite cubic graphs of girth 12, and then (unexpectedly) to a
new symmetric presentation for the special linear group SL(3, Z); see [7]. Similarly, it enabled
the construction of a infinite family of vertex-transitive but non-Cayley finite connected 4-valent
graphs with arbitrarily large vertex-stabilizers in their automorphism groups [23], the first known
example of a finite half-arc-transitive (vertex- and edge-transitive but not arc-transitive) 4-valent
finite graph with non-abelian vertex-stabilizer [20], and the first known examples of finite chiral
polytopes of rank 5 [15].
Two drawbacks of the (standard) low index subgroups algorithm are the fact that the finite
quotients it produces can have large order but small minimal degree (as permutation groups), and

1 1
x1 x2 ... x1 x2 ...
1 2 3 4
2 1
3 1
4 1
:

Figure 7. An extended coset table.

7
the fact that it tends to be very slow for large index n or complicated presentations. (Also for
some groups, like the modular group  x, y | x2 , y3 , the number of subgroups grows exponentially,
making it impossible to search very far.)
It is not difficult, however, to adapt the algorithm so that it produces only normal subgroups
(of up to a given index), and this adaptation runs much more quickly (for given maximum) index,
and hence can produce all quotients of up to a given order, not just those which have faithful
permutation representations of small degree.
Such an adaptation was developed by the author and Peter Dobcsányi (as part of Peter’s PhD thesis
project), and applied to find all rotary and regular maps on orientable surfaces of genus 2 to 15, all
regular maps on non-orientable surfaces of genus 2 to 30, and all arc-transitive cubic graphs on up
to 768 vertices; see [12, 13]. It was also subsequently used to help find all semisymmetric cubic
graphs on up to 768 vertices [19], and to assist in obtaining a refined classification of arc-transitive
group actions on finite cubic graphs (by types of arc-transitive subgroups) [21].
Recently, a new method for finding normal subgroups of small index has been developed by
Derek Holt and his student David Firth. This systematically enumerates the possibilities for the
composition series of the factor group G/K (for any normal subgroup K of small index in G), and
works much faster, for index up to 100, 000 in many groups with straightforward presentations.
It too has been implemented in the MAGMA package [1].
This new method has enabled the determination of all rotary and regular maps (and hypermaps)
on orientable surfaces of genus 2 to 101, all regular maps on non-orientable surfaces of genus 2 to
202, and all arc-transitive cubic graphs on up to 2048 vertices (and thereby the accidental discovery
of largest known cubic graph of diameter 10); see [11]. Consequences of finding patterns in the
list of maps of small genus will be described in Section 7.

6 SCHUR’S THEOREM

A particularly useful (but not so well known) piece of combinatorial group theory is Schur’s theorem
on centre-by-finite groups.

Theorem 2 (Schur). If the centre Z(G) of the group G has finite index |G : Z(G)| = m in G, then
the order of every element of G = [G, G] is finite and divides m.

Closely tied to the Schur-Zassenhaus theorem, this theorem can be proved easily using the
transfer homomorphism τ : G → Z(G) (which takes g → g m for all g ∈ G), once it is noted that
ker τ contains G . See [30] for further background and details.
The author is grateful to Peter Neumann for pointing out the usefulness of Schur’s theorem in
order to obtain the following in some work with Ravi Kulkarni on families of automorphism groups
of compact Riemann surfaces:

Theorem 3 [16]. Let p, q and d be positive integers, with gcd(p, q) = 1. Then there are only
finitely many finite groups which can be generated by two elements x and y of orders p and q
respectively such that xy generates a subgroup of index at most d.

In turn, the above helps disprove the possibility that certain cyclic-by-finite groups might be
rotation groups of orientably-regular maps. For example, suppose the map M is a ‘central cover’
of the octahedral map, of type {3, 4t} for some t, with rotation group G = Auto M ∼=  x, y, z | x3 =
y4t = (xy)2 = 1, [x, y4 ] = 1. How large can t be? Here we may note that Z(G) contains
N =  y4 , with G/N ∼ = S4 , so |G : Z(G)| divides 24. Also G/G ∼ = C2 , and G = x, y−1 xy, y2 .
2
Hence by Schur’s theorem, the order of y divides 24, so t divides 12. (But furthermore, we can
use Reidemeister-Schreier theory to obtain presentations (and hence the orders) of subgroups of

8
G: the index 6 subgroup H =  y2 , (xy−1 )2  has order dividing 24, so |G| = |G : H ||H | divides
144, so t divides 6.)

7 MORE RECENT RESULTS

Some new discoveries have been made (and proved) very recently as a result of observations made
about the data produced from the computations described at the end of Section 5.
Two major breakthroughs in the study of rotary and regular maps were made possible by noticing
that there is no orientably-regular but chiral map of genus 2, 3, 4, 5, 6, 9, 13, 23, 24, 30, 36, 47,
48, 54, 60, 66, 84 or 95, and similarly that there is no regular orientable map of genus 20, 32, 38,
44, 62, 68, 74, 80 or 98 with simple underlying graph. A lot of these exceptional genera are of the
form p + 1 where p is prime—a phenomenon that was not so easy to observe until the rotary maps
of genus 2 to 100 were known—and this observation led to the following (proved in joint work
with Jozef Siráň and Tom Tucker):

Theorem 4 [22]. If M is an irreflexible (chiral) orientably-regular map of genus p + 1 where p

is prime, then

either p ≡ 1 mod 3 and M has type {6, 6},

or p ≡ 1 mod 5 and M has type {5, 10},
or p ≡ 1 mod 8 and M has type {8, 8}.

In particular, there are no such maps of genus p + 1 whenever p is a prime such that p − 1 is not
divisible by 3, 5 or 8.

Theorem 5 [22]. There is no regular map M with simple underlying graph on an orientable
surface of genus p + 1 whenever p is a prime congruent to 1 mod 6, for p > 13.

In fact, what was achieved in [22] is a complete classification of all regular and orientably-regular
maps M for which |Aut M | is coprime to the map’s Euler characteristic χ (if χ is odd) or to χ /2
(if χ is even), and that leads not only to the above two theorems, but also to a simpler proof of the
following theorem of Breda, Nedela & Siráň:

Theorem 6 [2]. There is no regular map M on a non-orientable surface of genus p + 1 whenever

p is a prime congruent to 1 mod 12, for p > 13.

Here is a sketch proof of the classification leading to these three results. First, let M be a rotary
map on an orientable surface of genus g, let G = Auto M be its group of orientation-preserving
automorphisms, and suppose |G| is coprime to g − 1. Then by the Euler-Poincaré formula, the
type {k, m} of M is restricted (by arithmetic) to one of five different families. Moreover, the group
G = Auto M is almost Sylow-cyclic, meaning that every Sylow subgroup of odd order in G is
cyclic, and every Sylow 2-subgroup of G contains a cyclic subgroup of index 2. The Suzuki-Wong
classification of non-solvable almost Sylow-cyclic groups can be used to deduce that G = Auto M
is solvable, except in the case of one of the five families. It is then possible to classify those cases
where the vertex-stabilizer and face-stabilizer intersect trivially, and use Ito’s theorem and Schur’s
transfer theory to deal with the more general case. What is remarkable is that the map M turns out
to be reflexible whenever the coprime condition is satisfied.
Another outcome concerns reflexibility of Cayley maps. Briefly, a Cayley map for a group G is
an embedding of a Cayley graph for G in a surface as a rotary map—or equivalently, a rotary map

9
which admits the action of G as a group of automorphisms acting regularly (sharply-transitively)
on vertices. From an inspection of the rotary maps of genus 2 to 100 in [11], it was noticed that for
small genus, a rotary Cayley map for a cyclic group is reflexible if and only if it is anti-balanced
(that is, if and only if the embedding of the Cayley map sees the neighbours of the identity element
ordered in a way that is reversed by their inversion), and then this was proved in general in a piece
of joint work with Jozef Siráň and Young Soo Kwon [17] just a few months before this paper was
written.

REFERENCES

[1] W. Bosma, J. Cannon and C. Playoust, The Magma Algebra System I: The User Language, J. Symbolic
Computation 24 (1997), 235–265.
[2] A. Breda, R. Nedela and J. Siráň, Classification of regular maps with negative prime Euler characteristic,
Trans. Amer. Math. Soc. 357 (2005), 4175–4190.
[3] E. Bujalance, M. Conder and A. Costa, Pseudo-real Riemann surfaces and chiral regular maps, preprint.
[4] M.D.E. Conder, Generators for alternating and symmetric groups, J. London Math. Soc. (2) 22 (1980),
75–86.
[5] M.D.E. Conder, More on generators for alternating and symmetric groups, Quarterly J. Mathematics
(Oxford) Ser. 2 32 (1981), 137–163.
[6] M.D.E. Conder, An infinite family of 5-arc-transitive cubic graphs, Ars Combinatoria 25A (1988),
95–108.
[7] M.D.E. Conder, A surprising isomorphism, Journal of Algebra 129 (1990), 494–501.
[8] M.D.E. Conder, Schreier coset graphs and their applications, RIMS Kokyuroku 794 (1992), 169–175.
[9] M.D.E. Conder, Group actions on graphs, maps and surfaces with maximum symmetry, Groups St
Andrews 2001 in Oxford, London Math. Soc. Lecture Note Series, vol. 304, Cambridge University
Press, 2003, pp. 63–91.
[10] M.D.E. Conder, On symmetries of Cayley graphs and the graphs underlying regular maps, preprint.
[11] M.D.E. Conder, Regular maps and hypermaps of Euler characteristic −1 to −200, preprint, with associ-
ated lists of computational data available at http://www.math.auckland.ac.nz/∼conder/hypermaps.html.
[12] M.D.E. Conder and P. Dobcsányi, Determination of all regular maps of small genus, J. Combinatorial
Theory Series B 81 (2001), 224–242.
[13] M.D.E. Conder and P. Dobcsányi, Trivalent symmetric graphs up to 768 vertices, J. Combinatorial
Mathematics & Combinatorial Computing 40 (2002), 41–63.
[14] M.D.E. Conder and P. Dobcsányi, Applications and adaptations of the low index subgroups procedure,
Mathematics of Computation 74 (2005), 485–497.
[15] M.D.E. Conder, I. Hubard and T. Pisanski, Constructions for chiral polytopes, to appear in J. London
Math. Society, accepted July 2007.
[16] M.D.E. Conder and R. Kulkarni, Infinite families of automorphism groups of Riemann surfaces, in:
Groups and Geometry (London Math. Soc. Lecture Note Series, vol. 173), 1992, pp. 47–56.
[17] M.D.E. Conder, Y.S. Kwon and J. Širáň, Reflexibility of regular Cayley maps for abelian groups, preprint.
[18] M.D.E. Conder and P.J. Lorimer, Automorphism groups of symmetric graphs of valency 3, Journal of
Combinatorial Theory Series B 47 (1989), 60–72.
[19] M.D.E. Conder, A. Malnič, D. Marušič and P. Potočnik, A census of semisymmetric cubic graphs on up
to 768 vertices, Journal of Algebraic Combinatorics 23 (2006), 255–294.
[20] M.D.E. Conder and D. Marušič, A tetravalent half-arc-transitive graph with nonabelian vertex stabilizer,
J. Combinatorial Theory Series B 88 (2003), 67–76.
[21] M.D.E. Conder and R. Nedela, A more detailed classification of symmetric cubic graphs, preprint.
[22] M.D.E. Conder, J. Siráň and T.W. Tucker, The genera, reflexibility and simplicity of regular maps,
preprint.
[23] M.D.E. Conder and C.G.Walker, Vertex-transitive graphs with arbitrarily large vertex-stabilizers, Journal
of Algebraic Combinatorics 8 (1998), 29–38.
[24] M.D.E. Conder and C.G.Walker, The infinitude of 7-arc-transitive graphs, Journal of Algebra 208 (1998),
619–629.
[25] H.S.M. Coxeter and W.O.J. Moser, Generators and Relations for Discrete Groups, 4th ed., Springer
Berlin (1980).

10
[26] D.Ž. Djoković and G.L. Miller, Regular groups of automorphisms of cubic graphs, J. Combin. Theory
Series B 29 (1980), 195–230.
[27] B.J. Everitt, Alternating quotients of Fuchsian groups, J. Algebra 223 (2000), 457–476.
[28] D.F. Holt, B. Eick and E.A. OBrien, Handbook of Computational Group Theory, CRC Press, 2005.
[29] P. McMullen and E. Schulte, Abstract Regular Polytopes, Encyclopedia of Mathematics & its Appli-
cations, vol. 92, Cambridge (2002).
[30] D.J.S. Robinson, A Course in the Theory of Groups, 2nd ed., Springer (1996).
[31] C.C. Sims, Computation with Finitely Presented Groups (Cambridge University Press, 1994).
[32] W.T. Tutte, A family of cubical graphs, Proc. Camb. Phil. Soc. 43 (1947), 459–474.
[33] W.T. Tutte, On the symmetry of cubic graphs, Canad. J. Math. 11 (1959), 621–624.
[34] Richard Weiss, The non-existence of 8-transitive graphs, Combinatorica 1 (1981), 309–311.
[35] Richard Weiss, Presentations for (G, s)-transitive graphs of small valency, Math. Proc. Cambridge
Philos. Soc. 101 (1987), 7–20.

11
 Applications of Group Theory to Combinatorics – Koolen, Kwak & Xu (eds)
© 2008 Taylor & Francis Group, London, ISBN 978-0-415-47184-8

Automorphism groups of Cayley digraphs

Yan-Quan Feng
Mathematics, Beijing Jiaotong University, Beijing, P.R. China

Zai-Ping Lu
Center for Combinatorics, LPMC, Nankai University, Tianjin, P.R. China

Ming-Yo Xu
Department of Mathematics, Peking University, Beijing, P.R. China

ABSTRACT: Let G be a group and S ⊂ G with 1 ∈ S. A Cayley digraph Cay(G, S) on G with

respect to S is the digraph with vertex set G such that, for x, y ∈ G , there is a directed edge from
x to y whenever yx−1 ∈ S. If S −1 = S, then Cay(G, S) can be viewed as an (undirected) graph by
identifying two directed edges (x, y) and ( y, x) with one edge {x, y}.
Let X = Cay(G, S) be a Cayley digraph. Then every element g ∈ G induces naturally an
automorphism R(g) of X by mapping each vertex x to xg. The Cayley digraph Cay(G, S) is said to
be normal if R(G) = {R(g)|g ∈ G} is a normal subgroup of the automorphism group of X . In this
paper we shall give a brief survey of recent results on automorphism groups of Cayley digraphs
concentrating on the normality of Cayley digraphs.
Keywords: Cayley digraph, normal Cayley digraph, arc-transitive graph, half-arc-transitive graph.
2000 Mathematics Subject Classification: 05C25, 20B25.

1 INTRODUCTION

Throughout this paper graphs or digraphs (directed graphs) are finite and simple unless specified
otherwise. For a (di)graph X , we denote by V (X ), E(X ) and Aut(X ) the vertex set, the edge set
and the automorphism group of X , respectively. A (di)graph is said to be vertex-transitive or edge-
transitive if Aut(X ) acts transitively on V (X ) or E(X ), respectively. Note that for an (undirected)
graph X , each edge {u, v} of X gives two ordered pairs (u, v) and (v, u), called arcs of X . Thus we
sometimes, if necessary, view a graph X as a digraph.
Let G be a group and S a subset of G such that 1 ∈ S. The Cayley digraph Cay(G, S) on G with
respect to S is defined as the directed graph with vertex set G and edge set {(g, sg) | g ∈ G, s ∈ S}.
For a Cayley digraph X = Cay(G, S), we always call | S | the valency of X for convenience. If
S is symmetric, that is, if S −1 = {s−1 | s ∈ S} is equal to S, then Cay(G, S) can be viewed as
an undirected graph by identifying two oppositely directed edges with one undirected edge. We
sometimes call a Cayley digraph Cay(G, S) a Cayley graph if S is symmetric, and say Cay(G, S) a
directed Cayley graph to emphasize S −1  = S.
Let X = Cay(G, S) be a Cayley digraph. Consider the action of G on V (X ) by right multiplica-
tion. Then every element g ∈ G induces naturally an automorphism R(g) of X by mapping each
vertex x to xg. Set R(G) = {R( g) | g ∈ G}. Then R(G) is a subgroup of Aut(X ) and R(G) ∼ = G.
Thus X is a vertex-transitive digraph. Clearly, R(G) acts regularly on vertices, that is, R(G) is
transitive on vertices and only the identity element of R(G) fixes any given vertex. Further, it is
well-known that a digraph Y is isomorphic to a Cayley digraph on some group G if and only if its
automorphism group contains a subgroup isomorphic to G, acting regularly on the vertices of Y
(see [5, Lemma 16.3]). Noting that R(G) is regular on V (X ), it implies Aut(X ) = R(G)Aut(X )1 .

13
For the case where R(G)  Aut(X ), we have the following concept, which was fist proposed by
Xu [52].

Definition 1.1. A Cayley digraph X = Cay(G, S) is said to be normal if R(G) is a normal

subgroup of Aut(X ).

It was conjectured in [52] that ‘most’ Cayley digraphs are normal. In the literatures, studying
normality or, equivalently, determining automorphism groups of Cayley digraphs itself has been
becoming an very active topic in the algebraic graph theory, which also play an important role in
the investigation of various symmetry properties of digraphs. We need more concepts to start our
survey on the works about normality of Cayley digraphs and its application to the symmetries of
digraphs.
Let X be a graph. An s-arc in X is an ordered (s + 1)-tuple (v0 , v1 , . . . , vs ) of vertices such
that vi−1 is adjacent to vi for 1 ≤ i ≤ s, and vi−1  = vi+1 for 1 ≤ i < s; in other words, it is a
directed walk of length s which never includes the reverse of an arc just crossed. A 1-arc is also
called an arc simply. The graph X is said to be s-arc-transitive if Aut(X ) is transitive on the vertex
set and on the set of all s-arcs in X ; and X is said to be s-transitive if it is s-arc-transitive but not
(s + 1)-arc-transitive. We also call a 1-arc-transitive graph an arc-transitive or symmetric graph.
A subgroup of the automorphism group of an s-arc-transitive graph X is said to be s-regular if it
acts regularly on the set of s-arcs of X . In particular, X is said to be s-regular if the automorphism
group Aut(X ) itself is s-regular. Thus, if a graph X is s-regular then Aut(X ) is transitive on s-arcs
and the only automorphism fixing an s-arc is the identity automorphism of X . Finally, the graph
X is said to be half-arc transitive if it is vertex-transitive and edge-transitive but not arc-transitive.
In this paper, we denote by Zn or Dn , respectively, the cyclic group or the dihedral group of order
n, and by Zm p the elementary abelian p-group Zp × Zp × · · · × Zp , where p is a prime and m is
  
a positive integer. m times

2 THE NORMALITY OF CAYLEY DIGRAPHS

Let X = Cay(G, S) be a Cayley digraph. Let α be an automorphism of G. Then α induces a

permutation on V (X ) naturally. It is easily shown that α induces an automorphism of the digraph
X if and only if it preserves S, that is S α = {sα | s ∈ S} = S. Furthermore, Aut(G, S) = {α ∈
Aut(G) | S α = S} is a subgroup of Aut(G), and can be viewed as a subgroup of the stabilizer of
the vertex 1 in Aut(X ). It is easy to show that NAut(X ) (R(G)) = R(G)  Aut(G, S) (see [52], for
example). Then R(G)  Aut(X ) implies Aut(X )1 = Aut(G, S), and the converse also holds. Thus
we get a basic criteria for normal Cayley digraph.

Proposition 2.1 [52, Proposition 1.5]. Let X = Cay(G, S) be a Cayley digraph on a finite group
G with respect to S. Let A = Aut(X ) and let A1 be the stabilizer of 1 in A. Then X is normal if and
only if A1 = Aut(G, S).

By Proposition 2.1, if X = Cay(G, S) is normal then Aut(X ) = R(G)  Aut(G, S), which also
can be obtained from Godsil [25]. This implies that the automorphism group of a normal Cayley
digraph is known and normal Cayley digraphs are just those which have the smallest possible full
automorphism groups.
Note that being a normal Cayley digraph is not invariant under digraph isomorphisms, and so
strictly depends upon which group the digraph is a Cayley digraph on. For example, the three-
dimensional hypercube Q3 is a Cayley graph on either the group Z32 or the group Z4 × Z2 ,
and the Cayley graph on the first group is normal, but the Cayley graph on the second group
is not.

14
 Another Random Document on
Scribd Without Any Related Topics
48: Μάτην,
adv. in vain, fruitlessly, without profit, Mat.
15.9. Mar. 7.7.
49: Μάχαιρα, ας, ἡ,
a large knife, poniard; a sword, Mat. 26.47,
51, et al.; the sword of the executioner, Ac.
12.2. Ro. 8.35. He. 11.37; hence, φορεῖν
μάχαιραν, to bear the sword, to have the
power of life and death, Ro. 13.4; meton.
war. Mat. 10.34.
50: Μάχη, ης, ἡ,
a fight, battle; in N.T., contention, strife,
dispute, controversy, 2 Co. 7.5. 2 Ti. 2.23, et
al.: from
51: Μάχομαι,
f. οῦμαι, v. έσομαι,
to fight, to quarrel, Ac. 7.26; to contend,
dispute, Jno. 6.52, et al.
52: Μεγαλαυχέω, ῶ, (μέγας & αὐχέω, to boast)
f. ήσω,
to boast, vaunt; to cause a great stir, Ja. 3.5.
53: Μεγαλεῖος, εία, εῖον, (μέγας)
magnificent, splendid; τὰ μεγαλεῖα, great
things, wonderful works, Lu. 1.49. Ac. 2.11:
whence
54: Μεγαλειότης, τητος, ἡ,
majesty, magnificence, glory, Lu. 9.43. Ac.
19.27. 2 Pe. 1.16. S.
55: Μεγαλοπρεπής, έος, οῦς, ὁ, Ἡ, (μέγας &
πρέπω)
pr. becoming a great man, magnificent,
glorious, most splendid, 2 Pe. 1.17.
56: Μεγαλύνω, (μέγας)
f. υνῶ, a.1. ἐμεγάλῡνα,
to enlarge, amplify, Mat. 23.5; to manifest in
an extraordinary degree, Lu. 1.58; to
 magnify, exalt, extol, Lu. 1.46. Ac. 5.13, et al.
57: Μεγάλως, (μέγας)
adv. greatly, very much, vehemently, Phi.
4.10.
58: Μεγαλωσύνη, ης, ἡ,
greatness, majesty, He. 1.3; 8.1; ascribed
majesty, Jude 25: (S.) from
59: Μέγας, μεγάλη, μέγα,
compar. μείζων, superl. μέγιστος,
great, large in size, Mat. 27.60. Mar. 4.32, et
al.; great, much, numerous, Mar. 5.11. He.
11.26; great, grown up, adult, He. 11.24;
great, vehement, intense, Mat. 2.10; 28.8;
great, sumptuous, Lu. 5.29; great, important,
weighty, of moment, 1 Co. 9.11; 13.13;
great, splended, magnificent, Re. 15.3;
extraordinary, wonderful, 2 Co. 11.15; great,
solemn, Jno. 7.37; 19.31; great in rank,
noble, Re. 11.18; 13.16; great in dignity,
distinguished, eminent, illustrious, powerful, 115
Mat. 5.19; 18.1, 4, et al.; great, arrogant,
boastful, Re. 13.5: whence
60: Μέγεθος, εος, τό,
greatness, vastness, Eph. 1.19.
61: Μεγιστᾶνες, ων, οἱ
great men, lords, chiefs, nobles, princes, Mar.
6.21. Re. 6.15; 18.23. L.G.
62: Μέγιστος, η, ον,
greatest; pre-eminent, 2 Pe. 1.4.
63: Μεθερμηνεύω, (μετά & ἑρμηνεύω)
f. εύσω,
to translate, interpret, Mat. 1.23. Mar. 5.41,
et al. L.G.
64: Μέθη, ης, ἡ, (μέθυ)
strong drink; drunkenness, Lu. 21.34; a
debauch in drinking, Ro. 13.13. Ga. 5.21.
65: Μεθίστημι, later also μεθιστάνω, (ᾰ) (μετά &
ἵστημι)
f. μεταστήσω, a.1. μετέστησα,
to cause a change of position; to remove,
transport, 1 Co. 13.2; to transfer, Col. 1.13;
met. to cause to change sides; by impl. to
pervert, mislead, Ac. 19.26; to remove from
office, dismiss, discard, Lu. 16.4. Ac. 13.22.
66: Μεθοδεία, ας, ἡ, (μεθοδεύω, to trace,
investigate; to handle methodically; to handle
cunningly; fr. μέθοδος, μετά & ὁδός)
artifice, wile, Ep. 4.14; 6.11. N.T.
67: Μεθόριον, ου, τό, (neut. from μεθόριος,
interjacent, μετά & ὅρος)
confine, border, Mar. 7.24.
68: Μεθύσκω, (μέθυ, strong drink)
f. μεθύσω, a.1. pass. ἐμεθύσθην,
to inebriate, make drunk; pass. to be
intoxicated, to be drunk, Lu. 12.45. 1 Th. 5.7,
et al.; to drink freely, Jno. 2.10.
69: Μέθῠσος, ου, ὁ, ἡ, (μέθυ)
drunken; a drunkard, 1 Co. 5.11; 6.10.
70: Μεθύω, (μέθυ)
to be intoxicated, be drunk, Mat. 24.49, et al.
(ῠ).
71: Μειζότερος, α, ον,
greater, 3 Jno. 4: double comparat. from
72: Μείζων, ονος, ὁ, ἡ, τό, -ον,
greater: comparat. of μέγας.
73: Μέλαν, ᾰνος, τό, (neut. fr. μέλας)
ink, 2 Co. 3.3. 2 Jno. 12. 3 Jno. 13.
74: Μέλας, αινα, αν,
black, Mat. 5.36. Re. 6.5, 12.
75: Μέλει,
f. μελήσει, imperf. ἔμελε, imperat. μελέτω,
 impers. verb, there is a care, it concerns,
Mat. 22.16. Ac. 18.17. 1 Co. 9.9, et al.:
whence
76: Μελετάω, ῶ,
f. ήσω, a.1. ἐμελέτησα,
to care for; to bestow careful thought upon,
to give painful attention to, be earnest in, 1
Ti. 4.15; to devise, Ac. 4.25; absol. to study
beforehand, premeditate, Mar. 13.11.
77: Μέλι, ῐτος, τό,
honey, Mat. 3.4. Mar. 1.6. Re. 10.9, 10.
78: Μελίσσιος, ιου, ὁ, ἡ, τόν, -ον, (μέλισσα, a bee,
μέλι)
of bees, made by bees, Lu. 24.42.
79: Μέλλω,
f. ήσω, imperf. ἐμελλον, At. ἤμελλον,
to be about to, be on the point of, Mat. 2.13.
Jno. 4.47; it serves to express in general a
settled futurity, Mat. 11.14. Lu. 9.31. Jno.
11.51, et al.; to intend, Lu. 10.1, et al.;
particip. μέλλων, ουσα, ον, future as
distinguished from past and present, Mat.
12.32. Lu. 13.9, et al.; to be always, as it
were, about to do, to delay, linger, Ac. 22.16.
80: Μέλος, εος, τό
a member, limb, any part of the body, Mat.
5.29, 30. Ro. 12.4. 1 Co. 6.15; 12.12, et al.
81: Μεμβράνα, ης, ἡ, (Lat. membrana )
parchment, vellum, 2 Ti. 4.13.
82: Μέμφομαι,
f. ψομαι, a.1. ἐμεμψάμην,
to find fault with, blame, censure; to intimate
dissatisfaction with, He. 8.8; absol. to find
fault, Ro. 9.19.
83: Μεμψίμοιρος, ου, ὁ, ἡ, (μέμψις, a finding
fault, fr. μέμφομαι, & μοῖρα, a portion, lot)
 finding fault or being discontented with one's
lot, querulous; a discontented, querulous
person, a repiner, Jude 16.
84: Μέν,
a particle serving to intimate that the term or
clause with which it is used, stands
distinguished from another, usually in the
sequal, and then mostly with δέ
correspondent, Mat. 3.11; 9.37. Ac. 1.1; ὁ
μὲν,—ὁ δὲ, this—that, the one—the other,
Phi. 1.16, 17; one—another, οἱ μὲν—οἱ δὲ,
some—others, Mat. 22.5, 6; ὅς μὲν—ὅς δὲ,
one—another, pl. some—others, Mat. 13.8;
21.35; ἄλλος μὲν—ἄλλος δὲ, one—another, 1
Co. 15.39; ὧδε μὲν—ἐκεῖ δὲ, here—there,
He. 7.8; τοῦτο μὲν—τοῦτο δὲ, partly—partly,
He. 10.33, et al. freq.
85: Μενοῦν, v. μὲν οὖν,
see οὖν.
86: Μενοῦνγε, (μέν, οὖν, γε)
a combination of particles serving to take up 116
what has just preceded with either addition
or abatedment, like the Latin imo; yea
indeed, yea truly, yea rather, Lu. 11.28. Ro.
9.20; 10.18. Phi. 3.8. N.T.
87: Μέντοι, (μέν & τοι)
conj. truly, certainly, sure, Ju. 8;
nevertheless, however, Jno. 4.27, et al.
88: Μένω,
f. μενῶ, p. μεμένηκα, a.1. ἔμεινα,
to stay, Mat. 26.38. Ac. 27.31; to continue, 1
Co. 7. 11. 2 Ti. 2.13; to dwell, lodge, sojourn,
Jno. 1.39. Ac. 9.43, et al.; to remain, Jno.
9.41; to rest, settle, Jno. 1.32, 33; 3.36; to
last, endure, Mat. 11.23. Jno. 6.27. 1 Co.
3.14; to survive, 1 Co. 15.6; to be existent, 1
 Co. 13.13; to continue unchanged, Ro. 9.11;
to be permanent, Jno. 15.16. 2 Co. 3.11. He.
10.34; 13.14. 1 Pe. 1.23; to perservere, be
constant, be stedfast, 1 Ti. 2.15. 2 Ti. 3.14;
to abide, to be in close and settled union,
Jno. 6.56; 14.10; 15.4, et al.; to indwell, Jno.
5.38. 1 Jno. 2.14; trans. to wait for, Ac. 20.5,
23.
89: Μερίζω, (μέρις)
f. ίσω,
to divide; to divide out, distribute, Mar. 6.41;
to assign, bestow, Ro. 12.3. 1 Co. 7.17. 2 Co.
10.13. He. 7.2; mid. to share, Lu. 12.13;
pass. to be subdivided, to admit distinctions,
1 Co. 1.13; to be servered by discord, be at
variance, Mat. 12.35, et al.; to differ, 1 Co.
7.34.
90: Μέριμνα, ης, ἡ, (μερίζειν τὸν νοῦν, dividing
the mind)
care, Mat. 13.22. Lu. 8.14, et al.; anxious
interest, 2 Co. 11.28: whence
91: Μεριμνάω, ῶ,
f. ήσω, a.1. ἐμερίμνησα,
to be anxious, or solicitous, Phi. 4.6; to
expend careful thought, Mat. 6.27; to
concern one's self, Mat. 6.25, et al.; to have
the thoughts occupied with, 1 Co. 7.32, 33,
34; to feel an interest in, Phi. 2.20.
92: Μερίς, ίδος, ἡ,
a part; a division of a country, district, region,
tract, Ac. 16.12; met. share, participation,
Ac. 8.21. Col. 1.12; fellowship, consort,
connection, 2 Co. 6.15; a part assigned, lot,
Lu. 10.42.
93: Μερισμός, οῦ, ὁ, (μερίζω)
 a dividing, act of dividing, He. 4.12;
distribution, gifts distributed, He. 2.4.
94: Μεριστής, οῦ, ὁ, (fr. same)
a divider; an apportioner, arbitrator, Lu.
12.14. N.T.
95: Μέρος, εος, τό,
a part, portion, division, of a whole, Lu.
11.36; 15.12. Ac. 5.2. Eph. 4.16, et al.; a
piece, fragment, Lu. 24.42. Jno. 19.23; a
party, faction, Ac. 23.9; allotted portion, lot,
destiny, Mat. 24.51. Lu. 12.46; a calling,
craft, Ac. 19.27; a partner's portion,
partnership, fellowship, Jno. 13.8; pl. μέρη, a
local quarter, district, region, Mat. 2.22;
16.13. Ac. 19.1. Eph. 4.9, et al.; side of a
ship, Jno. 21.6; ἐν μέρει, in respect, on the
score, 2 Co. 3.10; 9.3. Col. 2.16. 1 Pe. 4.16;
μέρος τι, partly, in some part, 1 Co. 11.18;
ἀνὰ μέρος, alternately, one after another, 1
Co. 14.27; ἀπὸ μέρους, partly, in some part
or measure, 2 Co. 1.14; ἐκ μέρους,
individually, 1 Co. 12.27; partly, imperfectly, 1
Co. 13.9; κατὰ μέρος, particularly, in detail,
He. 9.5.
96: Μεσημβρία, ας, ἡ, (μέσος & ἡμέρα)
mid-day, noon, Ac. 22.6; meton. the south,
Ac. 8.26.
97: Μεσίασ,
see Μεσσίας.
98: Μεσῑτεύω,
f. εύσω, a.1. ἐμεσίτευσα,
to perform offfices between two parties; to
intervene, interpose, He. 6.17; (L.G.) from
99: Μεσίτης, ου, ὁ, (μέσος)
one that acts between two parties; a
mediator, one who interposes to reconcile
 two adverse parties, 1 Ti. 2.5; an
internuncius, one who is the medium of
communication between two parties, Ga.
3.19, 20. He. 8.6, et al. (ῑ). L.G.
100: Μεσονύκτιον, ίου, τό, (μέσος & νύξ)
midnight, Lu. 11.5, et al.
101: Μέσος, η, ον,
mid, middle, Mat. 25.6. Ac. 26.13; τὸ μέσον,
the middle, the midst, Mat. 14.24; ἀνὰ
μέσον, in the midst; fr. the Heb. in, among,
Mat. 13.25; between, 1 Co. 6.5; διὰ μέσου,
through the midst of, Lu. 4.30; εἰς τὸ μέσον,
into, or in the midst, Mar. 3.3. Lu. 6.8; ἐκ
μέσου, from the midst, out of the way, Col.
2.14. 2 Th. 2.7; fr. the Heb from, from
among, Mat. 13.49; ἐν τῷ μέσῳ, in the
midst, Mat. 10.16; in the midst, in public,
publicly, Mat. 14.6; ἐν μέσῳ, in the midst of,
among, Mat. 18.20; κατὰ μέσον τῆς νυκτὸς, 117
about midnight, Ac. 27.27, et al.
102: Μεσότοιχον, ου, τό, (μέσος & τοῖχος)
a middle wall; a partition wall, a barrier, Ep.
2.14. N.T.
103: Μεσουράνημα, ατος, τό, (μέσος& οὐρανὸς)
the mid-heaven, mid-air, Re. 8.13, et al. L.G.
104: Μεσόω, ῶ, (μέσος)
f. ώσω,
to be in the middle or midst; to be advanced
midway, Jno. 7.14.
105: Μεσσίας, ου, ὁ, (Heb. ‫ משיח‬, fr. ‫ משח‬, to
anoint)
the Messiah, the Anointed One, i.q. ὁ
Χριστός, Jno. 1.42; 4.25.
106: Μεστός, ή, όν,
 full, full of, filled with, Jno. 19.29, et al.;
replete, Ro. 1.29; 15.14, et al.: whence
107: Μεστόω, ῶ,
f. ώσω,
to fill; pass. to be filled, be full, Ac. 2.13.
108: Μετά
prep., with a genitive, with, together with,
Mat. 16.27; 12.41; 26.55; with, on the same
side or party with, in aid of, Mat. 12.30;
20.20; with, by means of, Ac. 13.17; with of
conflict, Re. 11.7; with, among, Lu. 24.5;
with, to, towards, Lu. 1.58, 72;
with an accusative,after, of place, behind, He.
9.3; of time, after, Mat. 17.1; 24.29;
followed by an infin. with the neut. article,
after, after that, Mat. 26.32. Lu. 22.20.
109: Μεταβαίνω, (μετά & βαίνω)
f. βήσομαι, p. μεταβέβηκα, a.2. μετέβην,
to go or pass from one place to another Jno.
5.24; to pass away, be removed, Mat. 17.20;
to go away, depart, Mat. 8.34; et al.
110: Μεταβάλλω, (μετά & βάλλω)
to change; mid. to change one's mind, Ac.
28.6.
111: Μετάγω, (μετά & ἄγω)
f. ξω,
to lead or move from one place to another;
to change direction, turn about, Ja. 3.3, 4.
112: Μεταδίδωμι, (μετά & δίδωμι)
f. δώσω,
to give a part, to share, Lu. 3.11; to impart,
bestow, Ro. 1.11; 12.8, et al.
113: Μετάθεσις, εως, ἡ, (μετατίθημι)
a removal, translation, He. 11.5; a
transmutation, change by the abolition of one
 thing and the substitution of another, He.
7.12.
114: Μεταίρω, (μετά & αἴρω)
f. αρῶ, a.1. μετῆρα,
to remove, transfer; in N.T., intrans., to go
away, depart, Mat. 13.53.
115: Μετακαλέω, ῶ, (μετά & καλέω)
f. έσω,
to call from one place into another; mid. to
call or send for, invite to come to one's self,
Ac. 7.14, et al.
116: Μετακῑνέω, ῶ, (μετά & κινέω)
f. ήσω,
to move away, remove; pass. met. to stir
away from, to swerve, Col. 1.23.
117: Μεταλαμβάνω, (μετά & λαμβάνω)
f. λήψομαι,
to partake of, share in, Ac. 2.46. 2 Ti. 2.6, et
al.; to get, obtain, find, Ac. 24.25: whence
118: Μετάληψις, εως, ἡ,
a partaking of, a being partaken of, 1 Ti. 4.3.
119: Μεταλλάσσω, (μετά & ἀλλάσσω)
f. ξω,
to exchange, change for or into, transmute,
Ro. 1.25, 26.
120: Μεταμέλομαι, (μετά & μέλομαι)
f. ήσομαι, a.1 μετεμελήθην,
to change one's judgment on past points of
conduct; to change one's mind and purpose,
He. 7.21; to repent, regret, Mat. 21.29, 32;
27.3. 2 Co. 7.8.
121: Μεταμορφόω, ῶ, (μετά & μορφόω)
f. ώσω,
to change the external form, transfigure;
mid. to change one's form, be transfigured,
 Mat. 17.2. Mar. 9.2; to undergo a spiritual
transformation, Ro. 12.2. 2 Co. 3.18.
122: Μετανοέω, ῶ, (μετά & νοέω)
f. ήσω,
to undergo a change in frame of mind and
feeling, to repent, Lu. 17.3, 4, et al.; to make
a change of principle and practice, to reform,
Mat. 3.2, et al.: whence
123: Μετάνοια, ας, ἡ,
a change of mode of thought and feeling,
repentance, Mat. 3.8. Ac. 20.21. 2 Ti. 2.25,
et al.; practical reformation, Lu. 15.7, et al.;
reversal of the past, He. 12.17.
124: Μεταξύ, (μετά)
adv. between, Mat. 23.35. Lu. 11.51; 16.26.
Ac. 15.9, ἐν τῷ μεταξύ, sc. χρόνω, in the
mean time, mean while, Jno. 4.31; in N.T., ὁ
μεταξύ, following, succeeding, Ac. 13.42.
125: Μεταπέμπω, (μετά & πέμπω)
f. ψω,
to send after; mid. to send after or for any
one, invite to come to one's self, Ac. 10.5, et
al.
126: Μεταστρέφω, (μετά & στρέφω)
f. ψω, a.2. pass. μεταστράφην,
to turn about; convert into something else, 118
change, Ac. 2.20. Ja. 4.9; by impl. to pervert,
Ga. 1.7.
127: Μετασχηματίζω, (μετά & σχηματίζω, to
fashion, σχῆμα)
f. ίσω, a.1. μετεσχημάτισα,
to remodel, transfigure, Phi. 3.21; mid. to
transform one's self, 2 Co. 11.13, 14, 15; to
make an imaginary transference of
circumstances from the parties really
 concerned in them to others, to transfer in
imagination, 1 Co. 4.6.
128: Μετατίθημι, (μετά & τίθημι)
f. θήσω, a.1. μετέθηκα, a.1. pass. μετετέθην,
to transport, Ac. 7.16; to transfer, He. 7.12;
to translate out of the world, He. 11.5; met.
to transfer to other purposes, to pervert,
Jude 4; mid. to transfer one's self, to change
over, Ga. 1.6.
129: Μετέπειτα, (μετά & ἔπειτα)
adv. afterwards, He. 12.17.
130: Μετέχω, (μετά & ἔχω)
f. μεθέξω, p. μετέσχηκα, a.2. μετέσχον,
to share in, partake, 1 Co. 9.10, 12; 10.17,
21, et al.; to be a member of, He. 7.13.
131: Μετεωρίζω, (μετέωρος, raised from the
ground)
f. ίσω,
to raise aloft; met. to unsettle in mind; pass.
to be excited with anxiety, be in anxious
suspense, Lu. 12.29.
132: Μετοικεσία, ας, ἡ, (μετοικέω, to change one's
abode, μετά & οἰκέω)
change of abode or country, migration, Mat.
1.11, 12, 17. L.G.
133: Μετοικίζω, (μετά & οἰκίζω, to fix in
habitation)
f. ίσω,
to cause to change an abode, cause to
emigrate, Ac. 7.4.
134: Μετοχή, ῆς, ἡ, (μετέχω)
a sharing, partaking; communion, fellowship,
2 Co. 6.14.
135: Μέτοχος, ου, ὁ, (fr. same)
a partaker, He. 3.1, 14; 12.8; an associate,
partner, fellow, Lu. 5.7. He. 1.9.
136: Μετρέω, ῶ, (μέτρον)
f. ήσω, a.1. ἐμέτρησα,
to mete, measure, Mat. 7.2. Re. 11.1, 2, et
al.; met. to estimate, 2 Co. 10.12: whence
137: Μετρητής, οῦ, ὁ,
pr. a measurer; also, metretes, Lat. metreta,
equivalent to the Attic ἀμφορεύς, i.e. three-
fourths of the Attic μέδιμνος, or Hebrew ‫בת‬,
and therefore equal to about nine gallons,
Jno. 2.6.
138: Μετριοπᾰθέω, ῶ, (μέτριος & πάθος)
f. ήσω,
to moderate one's passions, to be gentle,
compassionate, He. 5.2. L.G.
139: Μετρίως, (μέτριος, μέτρον)
adv. moderately; slightly; οὐ μετρίως, no
little, not a little, much, greatly, Ac. 20.12.
140: Μέτρον, ου, τό,
measure, Mat. 7.2. Mar. 4.24. Lu. 6.38. Re.
21.17, et al.; measure, standard, Eph. 4.13;
extent, compass, 2 Co. 10.13; allottted
measure, specific portion, Ro. 12.3. Eph. 4.7,
16; ἐκ μέτρου, by measure, with definite
limitation, Jno. 3.34.
141: Μέτωπον, ου, τό, (μετά & ὤψ)
forehead, front, Re. 7.3; 9.4, et al.
142: Μέχρι, & μέχρις before a vowel,
adv. of place, unto, even to, Ro. 15.19; of
time, until, till, Mat. 11.23; 13.30, et al.
143: Μή,
a particle of negation, not; for the particulars
of its usage, especially as distinguished from
that of οὐ, see the grammars; as a
conjunction, least, that not, Mat. 5.29, 30;
18.10; 24.6. Mar. 13.36; μή, οr μήτι, or
 μήποτε, prefixed to an interrogrative clause is
a mark of tone, since it expresses an
intimation either of the reality of the matters
respecting which the question is asked, Mat.
12.23, et al.; or the contrary, Jno. 4.12, et al.
144: Μήγε, (μή & γε)
a strenthened form for μή, Mat. 6.1; 9.17, et
al.
145: Μηδαμῶς, (μηδαμός, i.q. μηδείς)
adv. by no means, Ac. 10.14; 11.8.
146: Μηδέ,
conj. neither and repeated, neither—nor, Mat.
6.25; 7.6; 10.9, 10; not even, not so much
as, Mar. 2.2, et al.
147: Μηδείς, μηδεμίᾰ, μηδέν, (μηδέ & εἷς)
not one, none, no one, Mat. 8.4, et al.
148: Μηδέποτε, (μηδέ & ποτε)
not at any time, never, 2 Ti. 3.7.
149: Μηδέπω, (μηδέ & πω)
not yet, not as yet, He. 11.7.
150: Μηκέτι, (μή & ἔτι)
no more, no longer, Mar. 1.45; 2.2, et al.
151: Μῆκος, εος, τό,
length, Ep. 3.18. Re. 21.16: whence
152: Μηκύνω,
f. υνῶ,
to lengthen, prolong; mid. to grow up, as 119
plants, Mar. 4.27.
153: Μηλωτή, ῆς, ἡ, (μῆλον, a sheep)
a sheepskin, He. 11.37.
154: Μήν, μηνός, ὁ,
a month, Lu. 1.24, 26, 36, 53, et al.; in N.T.,
the new moon, the day of the new moon,
Ga. 4.10.
155: Μήν
 a particle occuring in the N.T. only in the
combination ἧ μήν. See ἧ.
156: Μηνύω,
f. ύσω, p. μεμήνυκα, a.1. ἐμήνυσα,
to disclose what is secret, Jno. 11.57. Ac.
23.30. 1 Co. 10.28; to declare, indicate, Lu.
20.37.
157: Μήποτε, (μή & ποτε)
has the same signification and usage as μή;
which see; He. 9.17. Mat. 4.6. Mat. 13.15;
also, whether, Lu. 3.15.
158: Μήπω, (μή & πω)
adv. not yet, not as yet, Ro. 9.11. He. 9.8.
159: Μήπως, (μή & πως)
conj. lest in any way or means, that in no
way, Ac. 27.29. Ro. 11.21. 11 Co. 8.9; 9.27,
et al.; whether perhaps, 1 Th. 3.5.
160: Μηρός, οῦ, ὁ,
the thigh, Re. 19.16.
161: Μήτε, (μή & τε)
conj. neither, μήτε—μήτε, v. μὴ—μήτε, v.
μηδὲ—μήτε, neither—nor, Mat. 5.34, 35, 36.
Ac. 23.8. 2 Th. 2.2; in N.T., also equivalent to
μηδέ, not even, not so much as, Mar. 3.20.
162: Μήτηρ, τέρος, τρός, ἡ,
a mother, Mat. 1.18; 12.49, 59, et al. freq.; a
parent city, Ga. 4.26. Re. 17.5.
163: Μήτι, (μή & τι)
has the same use as μή in the form εἰ μήτι,
Lu. 9.13, et al.; also when prefixed to an
interrogative clause, Mat. 7.16. Jno. 4.29.
See μή.
164: Μήτιγε, (μήτι & γε)
strengthened for μήτι, surely then, much
more then, 1 Co. 6.3.
165: Μήτρα, ας, ἡ, (μήτηρ)
 the womb, Lu. 2.23. Ro. 4.19.
166: Μητραλοίας, v. -λῴας, ου, ὁ, (μήτι & ἀλοιάω,
poet. for ἀλοάω, to smite)
a striker of his mother, matricide, 1 Ti. 1.9.
167: Μία,
see in εἷς.
168: Μιαίνω,
f. ανῶ, a.1. ἐμίηνα & ἐμίᾱνα, p. μεμίαγκα, p.
pass. μεμίασμαι, a.1. pass. ἐμιάνθην,
pr. to tinge, dye, stain; to pollute, defile,
ceremonially, Jno. 18.28; to corrupt, deprave,
Tit. 1.15. He. 12.15. Jude 8: whence
169: Μίασμα, ατος, τό,
pollution, moral defilement, 2 Pe. 2.10.
170: Μιασμός, οῦ, ὁ,
pollution, defiling, 2 Pe. 2.10. L.G.
171: Μίγμα, or μῖγμα, ατος, τό,
a mixture, Jno. 19.39: from
172: Μίγνυμι & νύω,
f μίξω, a.1. ἔμιξα, p. pass. μέμιγμαι,
to mix, mingle, Mat. 27.34. Lu. 13.1. Re. 8.7.
173: Μῑκρός, ό, όν,
little, small, in size, quantity, &c. Mat. 13.32;
small, little in age, young, not adult, Mar.
15.40; little, short in time, Jno. 7.33; μικρόν,
sc. χρόνον, a little while, a short time, Jno.
13.33; μετὰ μικρόν, after a little while, a little
while afterwards, Mat. 26.73; little in number,
Lu. 12.32; small, little in dignity, low, humble,
Mat. 10.42; 11.11; μικρόν, as an adv., little, a
little, Mat. 26.39, et al.
174: Μίλιον, ίου, τό, (Lat. miliarium)
a Roman mile, which contained mille
passuum, 1000 paces, or 8 stadia, i.e. about
1680 English yards, Mat. 5.41. L.G.
175: Μῑμέομαι, οῦμαι, (μῖμος, an imitator)
 to imitate, follow as an example, strive to
resemble, 2 Th. 3.7, 9, He. 13.7. 3 Jno. 11:
whence
176: Μιμητής, οῦ, ὁ,
an imitator, follower, 1 Co. 4.16. Eph. 5.1, et
al.
177: Μιμνήσκομαι, (mid. of μιμνήσκω, to put in
mind, remind)
a.1. ἐμνήσθην, f. μνησθήσομαι, p. μέμνημαι,
with pr. sig.,
to remember, recollect, call to mind, Mat.
26.75. Lu. 1.54, 72; 16.25; in N.T., in a
passive sense, to be called to mind, be borne
in mind, Ac. 10.31. Re. 16.19, et al.
178: Μῑσέω, ῶ (μῖσος, hatred)
f. ήσω, p. μεμίσηκα, a.1. ἐμίσησα,
to hate, regard with ill-will, Mat. 5.43, 44;
10.22; to detest, abhor, Jno. 3.20. Ro. 7.15;
in N.T., to regard with less affection, love
less, esteem less, Mat. 6.24. Lu. 14.26.
179: Μισθαποδοσία, ας, ἡ,
pr. the discharge of wages; requital; reward,
He. 10.35; 11.26; punishment, He. 2.2: from
180: Μισθαποδότης, ου, ὁ, (μισθός, ἀποδίδωμι)
a bestower of remuneration, recompenser,
rewarder, He. 11.6. N.T.
181: Μίσθιος, ία, ιον,
hired; as subst. a hired servant, hireling, Lu. 120
15.17, 19: (L.G.) from
182: Μισθός, οῦ, ὁ
hire, wages, Mat. 20.8. Ja. 5.4, et al.;
reward, Mat. 5.12, 46; 6.1, 2, 5, 16, et al.;
punishment, 2 Pe. 2.13, et al.: whence
183: Μισθόω, ῶ,
f. ώσω,
 to hire out, let out to hire; mid. to hire, Mat.
20.1, 7: whence
184: Μίσθωμα, ατος, τό,
hire, rent; in N.T., a hired dwelling, Ac. 28.30.
185: Μισθωτός, οῦ, τό,
a hireling, Mar. 1.20. Jno. 10.12, 13.
186: Μνᾶ, ᾶς, ἡ,
Lat. mina; a weight equiv. to 100 drachmæ;
also a sum, equiv. to 100 drachmæ, and the
sixtieth part of a talent, worth about four
pound sterling.
187: Μνεία, ας, ἡ, (μιμνήσκομαι)
remembrance, recollection, Ph. 1.3. 1 Th.
3.6. 2 Ti. 1.3; mention; μείαν ποιείσθαι, to
make mention, Ro. 1.9. Eph. 1.16. 1 Th. 1.2.
Philem. 4.
188: Μνῆμα, ατος, τό, (μιμνήσκω)
pr. a memorial, monument; a tomb,
sepulchre, Mar. 5.5, et al.
189: Μνημεῖον, ου, τό, (fr. same)
the same, Mat. 8.28; 23.29, et al.
190: Μνήμη, ης, ἡ, (fr. same)
remembrance, recollection; mention; μνήμην
ποιεῖσθαι, to make mention, 2 Pe. 1.15:
whence
191: Μνημονεύω,
f. εύσω, a.1. ἐμνημόνευσα,
to remember, recollect, call to mind, Mat.
16.9. Lu. 17.32. Ac. 20.31, et al.; to be
mindful of, to fix the thoughts upon, He.
11.15; to make mention, mention, speak of,
He. 11.22.
192: Μνημόσῠνον, ου, τό, (fr. same)
a record, memorial, Ac. 10.4; honourable
remembrance, Mat. 26.13. Mar. 14.9.
193: Μνηστεύω,
 f. εύσω, a.1. pass. ἐμνηστεύθην,
to ask in marriage; to betroth; pass. to be
betrothed, affianced, Mat. 1.18. Lu. 1.27;
2.5.
194: Μογιλάλος, ου, ὁ, ἡ, (μόγις & λαλέω)
having an impediment in one's speech,
speaking with difficulty, a stammerer, Mar.
7.32. (ᾰ). S.
195: Μόγις, (μόγος, labour, toil)
adv. with difficulty, scarcely, hardly, Lu. 9.39.
196: Μόδιος, ου, ὁ, (Lat. modius)
a modius, a Roman measure for things dry,
containing 16 sextarii, and equivalent to
about a peck; in N.T., a corn measure, Mat.
5.15. Mar. 4.21. Lu. 11.33.
197: Μοιχᾰλίς, ίδος, ἡ, (equiv. to μοιχάς, fem. of
μοιχός)
an adulteress, Ro. 7.3. Ja. 4.4; by meton. an
adulterous mien, lustful significance, 2 Pe.
2.14; from the Heb., spiritually adulterous,
faithless, ungodly, Mat. 12.39; 16.4. Mar.
8.38. L.G.
198: Μοιχάομαι, ῶμαι, (mid. of μοιχάω, to defile a
married woman, fr. μοιχός)
f. ήσομαι,
to commit or be guilty of adultery, Mat. 5.32,
et al.
199: Μοιχεία, ας, ἡ, (μοιχός)
adultery, Mat. 15.19. Mar. 7.21, et al.
200: Μοιχεύω,
f. εύσω, a.1. ἐμοίχευσα,
trans. to commit adultery with, debauch,
Mat. 5.28; absol. and mid. to commit
adultery, Mat. 5.27. Jno. 8.4, et al.; to
commit spiritual adultery, be guilty of
idolatry, Re. 2.22: et al.
201: Μοιχός, οῦ, ὁ,
an adulterer, Lu. 18.11. 1 Co. 6.9. He. 13.4.
Ja. 4.4.
202: Μόλις, (μόλος, labour)
adv. with difficulty, scarcely, hardly, Ac.
14.18; 27.7, 8, 16. Ro. 5.7. 1 Pe. 4.18.
203: Μολύνω,
f. υνῶ, a.1. ἐμόλῡνα, p. pass. μεμόλυσμαι,
a.1. ἐμολύνθην,
pr. to stain, sully; to defile, contaminate
morally, 1 Co. 8.7. Re. 14.4; to soil, Re. 3.4:
whence
204: Μολυσμός, οῦ, ὁ,
pollution, 2 Co. 7.1. L.G.
205: Μομφή, ῆς, ἡ, (μέμφομαι)
a complaint, cause or ground of complaint,
Col. 3.13.
206: Μονή, ῆς, ἡ, (μένω)
a stay in any place; an abode, dwelling,
mansion, Jno. 14.2, 23.
207: Μονογενής, έος, οῦς, ὁ, ἡ, (μόνος & γένος)
only begotten, only born, Lu. 7.12; 8.42;
9.38. He. 11.17; by impl. most dear, most
beloved, Jno. 1.14, 18; 3.16, 18. 1 Jno. 4.9.
208: Μόνον,
adv. only Mat. 5.47; 8.8; οὐ μόνον—ἀλλὰ καὶ,
not only—but also, Mat. 21.21. Jno. 5.18; μὴ
μόνον—ἀλλὰ, not only—but, Ph. 2.12, et al.:
from
209: Μόνος, η, ον,
without accompaniment, alone, Mat. 14.23; 121
18.15. Lu. 10.40, et al.; singly existent, sole,
only, Jno. 17.3, et al.; lone, solitary, Jno.
8.29; 16.32; alone in respect of restriction,
only, Mat. 4.4; 12.4, et al.; alone in respect
of circumstances, only, Lu. 24.18; not
 multiplied by reproduction, lone, barren, Jno.
12.24.
210: Μονόφθαλμος, ου, ὁ, ἡ, (μόνος & ὀφθαλμός)
one-eyed; deprived of an eye, Mat. 18.9.
Mar. 9.47.
211: Μονόω, ῶ, (μόνος)
f. ώσω, p. pass. μεμόνωμαι,
to leave alone; pass. to be left alone, be
lone, 1 Ti. 5.5.
212: Μορφή, ῆς, ἡ,
form, Mar. 16.12. Phi. 2.6, 7: whence
213: Μορφόω, ῶ,
f. ώσω, a.1. pass. ἐμορφώθην,
to give shape to, mould, fashion, Ga. 4.19:
whence
214: Μόρφωσις, εως, ἡ,
pr. a shaping, moulding; in N.T., external
form, appearance, 2 Ti. 3.5; a settled form,
prescribed system, Ro. 2.20.
215: Μοσχοποιέω, ῶ, (μόσχος & ποιέω)
f. ήσω, a.1. ἐμοσχοποίησα,
to form an image of a calf, Ac. 7.41. N.T.
216: Μόσχος, ου, ὁ, ἡ,
pr. a tender branch, shoot; a young animal; a
calf, young bullock, Lu. 15.23, 27, 30. He.
9.12, 19. Re. 4.7.
217: Μουσικός, ή, όν, (μοῦσα, a muse, song,
music)
pr. devoted to the arts of the Muses; a
musician; in N.T., perhaps, a singer, Re.
18.22.
218: Μόχθος, ου, ὁ,
wearisome labour, toil, travail, 2 Co. 11.27. 1
Th. 2.9. 2 Th. 3.8.
219: Μυελός, οῦ, ὁ,
marrow, He. 4.12.
220: Μυέω, ῶ, (μύω, to shut the mouth )
f. ήσω, p. pass. μεμύημαι,
to initiate, instruct in the sacred mysteries; in
N.T. pass., to be disciplined in a practical
lesson, to learn a lesson, Phi. 4.12.
221: Μῦθος, ου, ὁ,
a word, speech, a tale; a fable, figment, 1 Ti.
1.4, et al.
222: Μυκάομαι, ῶμαι,
to low, bellow, as a bull; also, to roar, as a
lion, Re. 10.33.
223: Μυκτηρίζω, (μυκτήρ, the nose)
f. ίσω,
to contract the nose in contempt and
derision, toss up the nose; to mock, deride,
Ga. 6.7.
224: Μυλικός, ή, όν, (μύλη, a mill)
of a mill, belonging to a mill, Mar. 9.42.
225: Μύλος, ου, ὁ, (fr. same)
a mill-stone, Mat. 18.6, et al.: whence
226: Μυλών, ῶνος, ὁ,
a mill-house, a place where the grinding of
corn was performed, Mat. 24.41.
227: Μυριάς, άδος, ἡ, (μυρίος, innumerable)
a myriad, ten thousand, Ac. 19.19;
indefintely, a vast multitude, Lu. 12.1. Ac.
21.20, et al.
228: Μυρίζω, (μύρον)
f. ίσω,
to anoint, Mar. 14.8.
229: Μυρίοι, αι, α, (μυρίος, innumerable)
indefinitely, a great number, 1 Co. 4.15;
14.19; specifically, μύριοι, a myriad, ten
thousand, Mat. 18.24.
230: Μύρον, ου, τό,
 pr. aromatic juice which distils from trees;
ointment, unguent, usually perfumed, Mat.
26.7, 12. Mar. 14.3, 4, et al.
231: Μυστήριον, ίου, τό, (μύστης, an initiated
person, μυέω)
a matter to the knowledge of which initiation
is necessary; a secret which would remain
such but for revelation, Mat. 13.11. Ro.
11.25. Col. 1.26, et al.; a concealed power or
principle, 2 Th. 2.7; a hidden meaning of a
symbol, Re. 1.20; 17.7.
232: Μυωπάζω, (μύω, to shut, close, & ὤψ)
f. άσω,
pr. to close the eyes, contract the eyelids,
wink; to be nearsighted, dimsighted,
purblind, 2 Pe. 1.9.
233: Μώλωψ, ωπος, ὁ,
the mark of a blow; a stripe, a wound, 1 Pe.
2.24.
234: Μωμάομαι, ῶμαι,
f. ήσομαι, a.1. pass. ἐμωμήθην,
to find fault with, censure, blame, 2 Co. 8.20;
passively, 2 Co. 6.3: from
235: Μῶμος, ου, ὁ,
blame, ridicule; a disgrace to society, a stain,
2 Pe. 2.13.
236: Μωραίνω, (μωρός)
f. ανῶ, a.1. ἐμώρᾱνα,
to be foolish, play the fool; in N.T., trans. to
make foolish, convict of folly, 1 Co. 1.20;
pass. to be convicted of folly, to incur the
character of folly, Ro. 1.22; to be rendered
insipid, Mat. 5.13. Lu. 14.34.
237: Μωρία, ας, ἡ, (fr. same)
foolishness, 1 Co. 1.18, 21, 23, et al.
238: Μωρολογία, ας, ἡ, (μωρός & λόγος)
 foolish talk, Ep. 5.4. 122
239: Μωρός, ά, όν,
foolish, Mat. 7.26; 23.17, 19. 2 Ti. 2.23, et
al.; fr. the Heb. a fool, a wicked, impious
man, Mat. 5.22.

Ν, ν, Νῦ

1: Ναζαρηνός, οῦ, ὁ, v. Ναζωραῖος, ου, ὀ

a Nazarene, an inhabitant of Ναζαρέθ,
Nazareth, Mat. 2.23. Jno. 1.47; et al.
2: Ναί,
a particle, used to strengthen an affirmation,
verily, Re. 22.20; to make an affirmation, or
express an assent, yea, yes, Mat. 5.37. Ac.
5.8, et al.
3: Ναός, οῦ, ὁ (ναίω, to dwell)
pr. a dwelling; the dwelling of a deity, a
temple, Mat. 26.61. Ac. 7.48, et al.; used
figuratively of individuals, Jno. 2.19. 1 Co.
3.16, et al.; spc. the cell of a temple; hence,
the Holy Place of the Temple of Jerusalem,
Mat. 23.35. Lu. 1.9, et al.; a model of a
temple, a shrine, Ac. 19.24.
4: Νάρδος, ου, ὁ, (Heb. ‫) נרד‬
spikenard, andropogon nardus of Linn., a
species of aromatic plant with grassy leaves
and a fibrous root, of which the best and
strongest grows in India; in N.T., oil of
spikenard, an oil extracted from the plant,
which was highly prized and used as an
ointment either pure or mixed with other
substances, Mar. 14.3. Jno. 12.3.
5: Ναυᾱγέω, ῶ, (ναῦς & ἄγνυμι, to break)
f. ήσω, a.1. ἐναυάγησα,
 to make shipwreck, be shipwrecked, 2 Co.
11.25. 1 Ti. 1.19.
6: Ναύκληρος, ου, ὁ, (ναῦς & κλῆρος)
the master or owner of a ship, Ac. 27.11.
7: Ναῦς, νεώς, ἡ, (νέω, to swim)
a ship, vessel, Ac. 27.41: whence
8: Ναύτης, ου, ὁ,
a shipman, sailor, seaman, Ac. 27.27, 30. Re.
18.17.
9: Νεᾱνίας, ου, ὁ, (νεάν, idem, fr. νέος)
a young man, youth, Ac. 20.9; 23.17, 18, 22,
used of one who is in the prime and vigour of
life, Ac. 7.58.
10: Νεᾱνίσκος, ου, ὁ, (fr. same)
a young man, youth, Mar. 14.51; 16.5, et al.;
used of one in the prime of life, Mat. 19.20,
22; νεαωίσκοι, soldiers, Mar. 14.51.
11: Νεκρός, ά, όν, (νέκυς, a dead body)
dead, without life, Mat. 11.5; 22.31; met.
νεκρός τινι, dead to a thing, no longer
devoted to, or under the influence of a thing,
Ro. 6.11; in the sense of vain, fruitless,
powerless, inefficacious, Ja. 2.17, 20, 26;
morally or spiritually dead, sinful, vicious,
impious, Ro. 6.13. Ep. 5.14; obnoxious to
death, mortal, Ro. 8.10; met. and including
the idea of future punishment and misery,
Ep. 2.1, 5. Col. 2.13; causing death and
misery, fatal, having a destructive power, He.
6.1; 9.14, et al.: whence
12: Νεκρόω, ῶ,
f. ώσω, a.1. ἐνέκρωσα,
pr. to put to death, kill; in N.T. met. to
deaden, mortify, Col. 3.5; pass. to be
rendered impotent, effete, Ro. 4.19. He.
11.12: (L.G.) whence
13: Νέκρωσις, εως, ἡ,
pr. a putting to death; dying, abandonment
to death, 2 Co. 4.10; deadness, impotency,
Ro. 4.19. L.G.
14: Νέος, α, ον,
recent, new fresh, Mat. 9.17. 1 Cor. 5.7. Col.
3.13. He. 12.24; young, youthful, Tit. 2.4, et
al.: whence
15: Νεοσσός, οῦ, ὁ,
the young of birds, a young bird, youngling,
chick, Lu. 2.25.
16: Νεότης, ητος, ἡ (νέος)
youth, Mat. 19.20. Ac. 26.4, et al.
17: Νεόφῠτος, ου, ὁ, ἡ, (νέος & φύω)
newly or recently planted; met. a neophyte,
one newly implanted into the Cchristian
Church, a new convert, 1 Ti. 3.6. S.
18: Νεύω,
f. νεύσω, a.1. ἔνευσα,
to nod; to intimate by a nod or significant
gesture, Jno. 13.24. Ac. 24.10.
19: Νεφέλη, ης, ἡ,
a cloud, Mat. 17.5; 24.30; 26.64, et al.
20: Νέφος, εος, τό,
a cloud; trop. a cloud, a throng of persons,
He. 12.1.
21: Νεφρός, οῦ, ὁ,
a kidney; pl. νεφροί, the kidneys, reins; fr.
the Heb. put for the inmost mind, the most
secret thoughts, desires, and affections, Re.
2.23.
22: Νεωκόρος, ου, ὁ, ἡ, (ναός, At. νεώς & κορέω,
to sweep clean)
pr. one who sweeps or cleanses a temple; 123
generally, one who has the charge of a
temple, ædituus; in N.T., a devotee city, as
 having specially dedicated a temple to some
deity, Ac. 19.35.
23: Νεωτερικός, ή, όν,
juvenile, natural to youth, youthful, 2 Ti.
2.22. (L.G.) from
24: Νεώτερος, α, ον, (campar. of νέος)
younger, more youthful, Lu. 15.12, 13, et al.
25: Νή,
a particle used in affirmative oaths,by, 1 Co.
15.31.
26: Νήθω, (νέω, idem)
f. νήσω,
to spin, Mat. 6.28. Lu. 12.27.
27: Νηπιάζω,
f. άσω,
to be childlike, 1 Co. 14.20: from
28: Νήπιος, ίου, ὁ, (νή & ἔπος)
pr. not speaking, infans; an infant, babe,
child, Mat. 21.16. 1 Cor. 13.11; one below
the age of manhood, a minor, Ga. 4.1; met. a
babe in knowledge, unlearned, simple, Mat.
11.25. Ro. 2.20.
29: Νησίον, ου, τό,
a small island, Ac. 27.16: dimin. of
30: Νῆσος, ου, ἡ, (νέω, to swim)
an island, Ac. 13.6; 27.26, et al.
31: Νηστεία, ας, ἡ,
fasting, want of food, 2 Co. 6.5; 11.27; a fast
religious abstenence from food, Mat. 17.21.
Lu. 2.37, et al.; spc. the annual public fast of
the Jews, the great day of atonement,
occurring in the month Tisri, corresponding
to the new moon of October, Ac. 27.9: from
32: Νηστεύω,
f. εύσω, a.1. ἐνήστευσα,
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

ebookname.com