Atomic Latin squares based on cyclotomic orthomorphisms.
Atoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under . This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding.
Atoms and partial orders of infinite languages
We determine minimal elements, i.e., atoms, in certain partial orders of factor closed languages under ⊆. This is in analogy to structural Ramsey theory which determines minimal structures in partial orders under embedding.
Atoms of cyclic connectivity in cubic graphs
Augmented rook boards and general product formulas.
Automata-based representations for infinite graphs
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last...
Automata-based Representations for Infinite Graphs
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and...
Automatic enumeration of regular objects.
Automorphic subsets of the -dimensional cube.
Automorphism Groups of Algebraic Number Fields.
Automorphism groups of Cayley digraphs of .
Automorphism groups of certain unstable graphs
Automorphism groups of complements of points
Automorphism Groups of Designs.
Automorphism groups of wreath product digraphs.
Automorphismen von polyedrischen Graphen.
Automorphismen von -Summen von Graphen
Automorphisms and enumeration of switching classes of tournaments.
Automorphisms of Certain Tree.
Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm
2000 Mathematics Subject Classification: 17A50, 05C05.In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).