|
Wilson Operation
In topological graph theory, the Wilson operations are a group of six transformations on graph embeddings. They are generated by two involutions on embeddings, surface duality and Petrie duality, and have the group structure of the symmetric group on three elements. They are named for Stephen E. Wilson, who published them for regular maps in 1979; they were extended to all cellular graph embeddings (embeddings all of whose faces are topological disks) by . The operations are: identity, duality, Petrie duality, Petrie dual of dual, dual of Petrie dual, and dual of Petrie dual of dual or equivalently Petrie dual of dual of Petrie dual. Together they constitute the group S3. These operations are characterized algebraically as the only outer automorphisms of certain group-theoretic representations of embedded graphs. Via their action on dessins d'enfants, they can be used to study the absolute Galois group of the rational numbers. One can also define corresponding operations on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
A Hexad Of Regular Maps
A, or a, is the first letter and the first vowel of the Latin alphabet, used in the modern English alphabet, the alphabets of other western European languages and others worldwide. Its name in English is ''a'' (pronounced ), plural ''aes''. It is similar in shape to the Ancient Greek letter alpha, from which it derives. The uppercase version consists of the two slanting sides of a triangle, crossed in the middle by a horizontal bar. The lowercase version can be written in two forms: the double-storey a and single-storey ɑ. The latter is commonly used in handwriting and fonts based on it, especially fonts intended to be read by children, and is also found in italic type. In English grammar, " a", and its variant " an", are indefinite articles. History The earliest certain ancestor of "A" is aleph (also written 'aleph), the first letter of the Phoenician alphabet, which consisted entirely of consonants (for that reason, it is also called an abjad to distinguish it fro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Group Of Order 6
In mathematics, D3 (sometimes alternatively denoted by D6) is the dihedral group of degree 3, or, in other words, the dihedral group of order 6. It is isomorphic to the symmetric group S3 of degree 3. It is also the smallest possible non-abelian group.. For the identification of D3 with S3, and the observation that this group is the smallest possible non-abelian group, sep. 49 This page illustrates many group concepts using this group as example. Symmetry groups The dihedral group D3 is the symmetry group of an equilateral triangle, that is, it is the set of all transformations such as reflection, rotation, and combinations of these, that leave the shape and position of this triangle fixed. In the case of D3, every possible permutation of the triangle's vertices constitutes such a transformation, so that the group of these symmetries is isomorphic to the symmetric group S3 of all permutations of three distinct elements. This is not the case for dihedral groups of highe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Combinatorial Theory
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTA Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic, |
Transactions Of The American Mathematical Society
The ''Transactions of the American Mathematical Society'' is a monthly peer-reviewed scientific journal of mathematics published by the American Mathematical Society. It was established in 1900. As a requirement, all articles must be more than 15 printed pages. See also * ''Bulletin of the American Mathematical Society'' * '' Journal of the American Mathematical Society'' * '' Memoirs of the American Mathematical Society'' * '' Notices of the American Mathematical Society'' * '' Proceedings of the American Mathematical Society'' External links * ''Transactions of the American Mathematical Society''on JSTOR JSTOR (; short for ''Journal Storage'') is a digital library founded in 1995 in New York City. Originally containing digitized back issues of academic journals, it now encompasses books and other primary sources as well as current issues of j ... American Mathematical Society academic journals Mathematics journals Publications established in 1900 {{math-journa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rational Number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (e.g. ). The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface , or blackboard bold \mathbb. A rational number is a real number. The real numbers that are rational are those whose decimal expansion either terminates after a finite number of digits (example: ), or eventually begins to repeat the same finite sequence of digits over and over (example: ). This statement is true not only in base 10, but also in every other integer base, such as the binary and hexadecimal ones (see ). A real number that is not rational is called irrational. Irrational numbers include , , , and . Since the set of rational numbers is countable, and the set of real numbers is u ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Absolute Galois Group
In mathematics, the absolute Galois group ''GK'' of a field ''K'' is the Galois group of ''K''sep over ''K'', where ''K''sep is a separable closure of ''K''. Alternatively it is the group of all automorphisms of the algebraic closure of ''K'' that fix ''K''. The absolute Galois group is well-defined up to inner automorphism. It is a profinite group. (When ''K'' is a perfect field, ''K''sep is the same as an algebraic closure ''K''alg of ''K''. This holds e.g. for ''K'' of characteristic zero, or ''K'' a finite field.) Examples * The absolute Galois group of an algebraically closed field is trivial. * The absolute Galois group of the real numbers is a cyclic group of two elements (complex conjugation and the identity map), since C is the separable closure of R and ''C:Rnbsp;= 2. * The absolute Galois group of a finite field ''K'' is isomorphic to the group :: \hat = \varprojlim \mathbf/n\mathbf. (For the notation, see Inverse limit.) :The Frobenius automorphis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dessin D'enfant
In mathematics, a dessin d'enfant is a type of graph embedding used to study Riemann surfaces and to provide combinatorial invariants for the action of the absolute Galois group of the rational numbers. The name of these embeddings is French for a "child's drawing"; its plural is either ''dessins d'enfant'', "child's drawings", or ''dessins d'enfants'', "children's drawings". A dessin d'enfant is a graph, with its vertices colored alternately black and white, embedded in an oriented surface that, in many cases, is simply a plane. For the coloring to exist, the graph must be bipartite. The faces of the embedding are required be topological disks. The surface and the embedding may be described combinatorially using a rotation system, a cyclic order of the edges surrounding each vertex of the graph that describes the order in which the edges would be crossed by a path that travels clockwise on the surface in a small loop around the vertex. Any dessin can provide the surface it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Outer Automorphism
In mathematics, the outer automorphism group of a group, , is the quotient, , where is the automorphism group of and ) is the subgroup consisting of inner automorphisms. The outer automorphism group is usually denoted . If is trivial and has a trivial center, then is said to be complete. An automorphism of a group which is not inner is called an outer automorphism. The cosets of with respect to outer automorphisms are then the elements of ; this is an instance of the fact that quotients of groups are not, in general, (isomorphic to) subgroups. If the inner automorphism group is trivial (when a group is abelian), the automorphism group and outer automorphism group are naturally identified; that is, the outer automorphism group does act on the group. For example, for the alternating group, , the outer automorphism group is usually the group of order 2, with exceptions noted below. Considering as a subgroup of the symmetric group, , conjugation by any odd permutation is an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Map (graph Theory)
In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold (such as a sphere, torus, or real projective plane) into topological disks such that every flag (an incident vertex-edge-face triple) can be transformed into any other flag by a symmetry of the decomposition. Regular maps are, in a sense, topological generalizations of Platonic solids. The theory of maps and their classification is related to the theory of Riemann surfaces, hyperbolic geometry, and Galois theory. Regular maps are classified according to either: the genus and orientability of the supporting surface, the underlying graph, or the automorphism group. Overview Regular maps are typically defined and studied in three ways: topologically, group-theoretically, and graph-theoretically. Topological approach Topologically, a map is a 2-cell decomposition of a compact connected 2-manifold. The genus g, of a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topological Graph Theory
In mathematics, topological graph theory is a branch of graph theory. It studies the embedding of graphs in surfaces, spatial embeddings of graphs, and graphs as topological spaces. It also studies immersions of graphs. Embedding a graph in a surface means that we want to draw the graph on a surface, a sphere for example, without two edges intersecting. A basic embedding problem often presented as a mathematical puzzle is the three utilities problem. Other applications can be found in printing electronic circuits where the aim is to print (embed) a circuit (the graph) on a circuit board (the surface) without two connections crossing each other and resulting in a short circuit. Graphs as topological spaces To an undirected graph we may associate an abstract simplicial complex ''C'' with a single-element set per vertex and a two-element set per edge. The geometric realization , ''C'', of the complex consists of a copy of the unit interval ,1per edge, with the endpoints o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetric Group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group \mathrm_n defined over a finite set of n symbols consists of the permutations that can be performed on the n symbols. Since there are n! (n factorial) such permutation operations, the order (number of elements) of the symmetric group \mathrm_n is n!. Although symmetric groups can be defined on infinite sets, this article focuses on the finite symmetric groups: their applications, their elements, their conjugacy classes, a finite presentation, their subgroups, their automorphism groups, and their representation theory. For the remainder of this article, "symmetric group" will mean a symmetric group on a finite set. The symmetric group is important to diverse areas of mathematics such as Galois theory, invariant theory, the represen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Petrie Dual
In topological graph theory, the Petrie dual of an embedded graph (on a 2-manifold with all faces disks) is another embedded graph that has the Petrie polygons of the first embedding as its faces. The Petrie dual is also called the Petrial, and the Petrie dual of an embedded graph G may be denoted G^\pi. It can be obtained from a signed rotation system or ribbon graph representation of the embedding by twisting every edge of the embedding. Properties Like the usual dual graph, repeating the Petrie dual operation twice returns to the original surface embedding. Unlike the usual dual graph (which is an embedding of a generally different graph in the same surface) the Petrie dual is an embedding of the same graph in a generally different surface. Surface duality and Petrie duality are two of the six Wilson operations, and together generate the group of these operations. Regular polyhedra Applying the Petrie dual to a regular polyhedron produces a regular map. The number of skew ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
