74 research outputs found
Simple eigenvalues of cubic vertex-transitive graphs
If is an eigenvector for eigenvalue of a graph and
is an automorphism of , then is also an eigenvector for
. Thus it is rather exceptional for an eigenvalue of a
vertex-transitive graph to be simple. We study cubic vertex-transitive graphs
with a non-trivial simple eigenvalue, and discover remarkable connections to
arc-transitivity, regular maps and Chebyshev polynomials.Comment: 22 p
AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES
Automorphism groups survey similarities on mathematical systems, which appear nearly in all mathematical branches, such as those of algebra, combinatorics, geometry, · · · and theoretical physics, theoretical chemistry, etc.. In geometry, configurations with high symmetry born symmetrical patterns, a kind of beautiful pictures in aesthetics. Naturally, automorphism groups enable one to distinguish systems by similarity. More automorphisms simply more symmetries of that system. This fact has established the fundamental role of automorphism groups in modern sciences. So it is important for graduate students knowing automorphism groups with applications
Twistwise Flow Equivalence and Beyond...
An expository account of recent progress on twistwise flow equivalence. There is a new result in the appendix. (Appendix joint with Mike Boyle.
Recommended from our members
Highly symmetric embeddings of graphs on surfaces
This thesis considers highly symmetric maps, that is embeddings of graphs in surfaces such that the automorphism group is “large”. This may be when the automorphism group of the map acts regularly on the flag-set of the map, as for the fully regular maps studied in Part I. In contrast, Part II focusses on a class of maps where the automorphism group has (up to) two orbits on the flag-set and may not be edge-transitive.
Part I is dedicated to advancing the understanding of fully regular maps with external symmetries. Chapter 2 proves that for arbitrary valency greater than three, a fully regular map with Trinity symmetry exists, extending the previously-known existence of such a map for every even valency. Chapter 3 addresses a group of operators which acts on fully regular maps whose automorphism group is isomorphic to SL(2, 2^α). The group of operators, which depends on the value of α and is defined more precisely in Chapter 3, includes the dual and Petrie operators as well as the allowable hole operators. One approach is by exploring the orbits of this group as it acts on the space of all maps with automorphism group isomorphic to SL(2, 2^α) for the given α. A detailed investigation is presented for the group of operators acting on the set consisting of all maps with automorphism group A5 which is isomorphic to SL(2, 4).
In Part II, the focus is on edge-biregular maps. These maps can be identified with group presentations which have a particular form, namely they are generated by four involutions which partition into two distinct sets each consisting of a pair of commuting involutions. Edge-biregular maps correspond to the most symmetric examples of maps with bipartite medial graph. By the definition, each edge-biregular map inherits a two-colouring on the edges, and so long as the map is not degenerate in some way, both the valency and the face length are even. In Chapter 4 these maps are introduced, foundations are laid and degeneracies are addressed. Chapter 5 is a partial classification covering edge-biregular maps whose colour-preserving automorphism group is dihedral, and/or whose surface has Euler characteristic which is either non-negative or negative and prime. The context for Chapter 6 is edge-biregular maps whose underlying group is symmetric or alternating. A genuinely edge-biregular map is an edge-biregular map which (when disregarding the colouring of edges) is not a fully regular map. The chapter includes a proof that, with the exception of some small cases, a genuinely edge-biregular map of every feasible type exists such that the colour preserving automorphism group is symmetric or alternating.</br
Random hypergraphs for hashing-based data structures
This thesis concerns dictionaries and related data structures that rely on providing several random possibilities for storing each key. Imagine information on a set S of m = |S| keys should be stored in n memory locations, indexed by [n] = {1,…,n}. Each object x [ELEMENT OF] S is assigned a small set e(x) [SUBSET OF OR EQUAL TO] [n] of locations by a random hash function, independent of other objects. Information on x must then be stored in the locations from e(x) only. It is possible that too many objects compete for the same locations, in particular if the load c = m/n is high. Successfully storing all information may then be impossible. For most distributions of e(x), however, success or failure can be predicted very reliably, since the success probability is close to 1 for loads c less than a certain load threshold c^* and close to 0 for loads greater than this load threshold. We mainly consider two types of data structures: • A cuckoo hash table is a dictionary data structure where each key x [ELEMENT OF] S is stored together with an associated value f(x) in one of the memory locations with an index from e(x). The distribution of e(x) is controlled by the hashing scheme. We analyse three known hashing schemes, and determine their exact load thresholds. The schemes are unaligned blocks, double hashing and a scheme for dynamically growing key sets. • A retrieval data structure also stores a value f(x) for each x [ELEMENT OF] S. This time, the values stored in the memory locations from e(x) must satisfy a linear equation that characterises the value f(x). The resulting data structure is extremely compact, but unusual. It cannot answer questions of the form “is y [ELEMENT OF] S?”. Given a key y it returns a value z. If y [ELEMENT OF] S, then z = f(y) is guaranteed, otherwise z may be an arbitrary value. We consider two new hashing schemes, where the elements of e(x) are contained in one or two contiguous blocks. This yields good access times on a word RAM and high cache efficiency. An important question is whether these types of data structures can be constructed in linear time. The success probability of a natural linear time greedy algorithm exhibits, once again, threshold behaviour with respect to the load c. We identify a hashing scheme that leads to a particularly high threshold value in this regard. In the mathematical model, the memory locations [n] correspond to vertices, and the sets e(x) for x [ELEMENT OF] S correspond to hyperedges. Three properties of the resulting hypergraphs turn out to be important: peelability, solvability and orientability. Therefore, large parts of this thesis examine how hyperedge distribution and load affects the probabilities with which these properties hold and derive corresponding thresholds. Translated back into the world of data structures, we achieve low access times, high memory efficiency and low construction times. We complement and support the theoretical results by experiments.Diese Arbeit behandelt Wörterbücher und verwandte Datenstrukturen, die darauf aufbauen, mehrere zufällige Möglichkeiten zur Speicherung jedes Schlüssels vorzusehen. Man stelle sich vor, Information über eine Menge S von m = |S| Schlüsseln soll in n Speicherplätzen abgelegt werden, die durch [n] = {1,…,n} indiziert sind. Jeder Schlüssel x [ELEMENT OF] S bekommt eine kleine Menge e(x) [SUBSET OF OR EQUAL TO] [n] von Speicherplätzen durch eine zufällige Hashfunktion unabhängig von anderen Schlüsseln zugewiesen. Die Information über x darf nun ausschließlich in den Plätzen aus e(x) untergebracht werden. Es kann hierbei passieren, dass zu viele Schlüssel um dieselben Speicherplätze konkurrieren, insbesondere bei hoher Auslastung c = m/n. Eine erfolgreiche Speicherung der Gesamtinformation ist dann eventuell unmöglich. Für die meisten Verteilungen von e(x) lässt sich Erfolg oder Misserfolg allerdings sehr zuverlässig vorhersagen, da für Auslastung c unterhalb eines gewissen Auslastungsschwellwertes c* die Erfolgswahrscheinlichkeit nahezu 1 ist und für c jenseits dieses Auslastungsschwellwertes nahezu 0 ist. Hauptsächlich werden wir zwei Arten von Datenstrukturen betrachten: • Eine Kuckucks-Hashtabelle ist eine Wörterbuchdatenstruktur, bei der jeder Schlüssel x [ELEMENT OF] S zusammen mit einem assoziierten Wert f(x) in einem der Speicherplätze mit Index aus e(x) gespeichert wird. Die Verteilung von e(x) wird hierbei vom Hashing-Schema festgelegt. Wir analysieren drei bekannte Hashing-Schemata und bestimmen erstmals deren exakte Auslastungsschwellwerte im obigen Sinne. Die Schemata sind unausgerichtete Blöcke, Doppel-Hashing sowie ein Schema für dynamisch wachsenden Schlüsselmengen. • Auch eine Retrieval-Datenstruktur speichert einen Wert f(x) für alle x [ELEMENT OF] S. Diesmal sollen die Werte in den Speicherplätzen aus e(x) eine lineare Gleichung erfüllen, die den Wert f(x) charakterisiert. Die entstehende Datenstruktur ist extrem platzsparend, aber ungewöhnlich: Sie ist ungeeignet um Fragen der Form „ist y [ELEMENT OF] S?“ zu beantworten. Bei Anfrage eines Schlüssels y wird ein Ergebnis z zurückgegeben. Falls y [ELEMENT OF] S ist, so ist z = f(y) garantiert, andernfalls darf z ein beliebiger Wert sein. Wir betrachten zwei neue Hashing-Schemata, bei denen die Elemente von e(x) in einem oder in zwei zusammenhängenden Blöcken liegen. So werden gute Zugriffszeiten auf Word-RAMs und eine hohe Cache-Effizienz erzielt. Eine wichtige Frage ist, ob Datenstrukturen obiger Art in Linearzeit konstruiert werden können. Die Erfolgswahrscheinlichkeit eines naheliegenden Greedy-Algorithmus weist abermals ein Schwellwertverhalten in Bezug auf die Auslastung c auf. Wir identifizieren ein Hashing-Schema, das diesbezüglich einen besonders hohen Schwellwert mit sich bringt. In der mathematischen Modellierung werden die Speicherpositionen [n] als Knoten und die Mengen e(x) für x [ELEMENT OF] S als Hyperkanten aufgefasst. Drei Eigenschaften der entstehenden Hypergraphen stellen sich dann als zentral heraus: Schälbarkeit, Lösbarkeit und Orientierbarkeit. Weite Teile dieser Arbeit beschäftigen sich daher mit den Wahrscheinlichkeiten für das Vorliegen dieser Eigenschaften abhängig von Hashing Schema und Auslastung, sowie mit entsprechenden Schwellwerten. Eine Rückübersetzung der Ergebnisse liefert dann Datenstrukturen mit geringen Anfragezeiten, hoher Speichereffizienz und geringen Konstruktionszeiten. Die theoretischen Überlegungen werden dabei durch experimentelle Ergebnisse ergänzt und gestützt
Three-manifolds, Foliations and Circles, I
This paper investigates certain foliations of three-manifolds that are
hybrids of fibrations over the circle with foliated circle bundles over
surfaces: a 3-manifold slithers around the circle when its universal cover
fibers over the circle so that deck transformations are bundle automorphisms.
Examples include hyperbolic 3-manifolds of every possible homological type. We
show that all such foliations admit transverse pseudo-Anosov flows, and that in
the universal cover of the hyperbolic cases, the leaves limit to sphere-filling
Peano curves. The skew R-covered Anosov foliations of Sergio Fenley are
examples. We hope later to use this structure for geometrization of slithered
3-manifolds.Comment: 60 pages, 10 figure
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and koviera, together with results of Itô, Hall, Huppert and Wielandt on factorisable groups and on finite solvable groups. <br/
- …