Asymptotics of some convolutional recurrences.
Asymptotics of the average height of 2-watermelons with a wall.
Asymptotics of the number of -words with an -descent.
Asymptotics of Young diagrams and Hook numbers.
Asymptotische Abschätzung einer Anzahlfunktion in endlichen Relationssystemen.
Atomic compactness and elementary equivalence
Atomic compactness for reflexive graphs
A first order structure with universe M is atomic compact if every system of atomic formulas with parameters in M is satisfiable in provided each of its finite subsystems is. We consider atomic compactness for the class of reflexive (symmetric) graphs. In particular, we investigate the extent to which “sparse” graphs (i.e. graphs with “few” vertices of “high” degree) are compact with respect to systems of atomic formulas with “few” unknowns, on the one hand, and are pure restrictions of their...
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