Morris, "Auto- morphism Groups of Circulant Digraphs with Applications to Semi- group Theory", under review.J. Arau´jo, W. Bentz, E. Dobson, J. Konieczny and J. Morris. Automorphism groups of circulant digraphs with applications to semigroup theory. to appear in Combinatorica ....
Die vorliegende Arbeit beschäftigt sich mit der Untersuchung von Klassen K abelscher Gruppen, die den beiden folgenden Bedingungen genügen:...
Mathematics - Group Theory03C1520B2705D1043A07We investigate correspondences between extreme amenability and amenability of automorphism groups of Fra\"iss\\'e-Hrushovski generic structures that are obtained from smooth classes, and their Ramsey type properties of their smooth classes, similar to Ke...
Starting with Frucht’s theorem on graphs [7], there have been many papers proving that any finite group is isomorphic to the full automorphism group of some specific type of combinatorial object. Babai surveyed this topic [3], and in [3, p. 8] stated that in [1] he had proved that...
Google Scholar 8. R.G Stanton Interconnections of related BIBDS J. Combin. Theory, 6 (1969), pp. 387-391 View PDFView articleView in ScopusGoogle Scholar Cited by (1) On (v, k, λ) graphs and designs with trivial automorphism group 1989, Journal of Combinatorial Theory, Series ACopyrig...
In addition to this, if the conjecture is not true, it also seems to be interesting to describe obstructions in algebraic way with the combinatorial group theory, the representation theory, and so on. 2 Preliminaries In this section, after fixing notation and conventions, we recall the Andrea...
The automorphism groups of a graph characterize its symmetries, and are therefore very useful in determining certain of its properties. The group of graph automorphisms of a graph may be computed in the Wolfram Language using GraphAutomorphismGroup[g], the elements of which may then be extracted...
It is an open problem in mathematics whether the automorphism group of K x1, . . . ,xn ! is the tame automorphism group for n>2. Remark 1: The linear transformation .o slashed.i can be either the identity map or a permutation. Obviously, the order of the variables x1, . . . ,...
3. The Derivation Algebra of W In this section, we consider the derivation algebra of W. Let G be a commutative group, g =g∈G g g a G-graded Lie algebra. A g-module V is called G-graded, if V =g∈G V g∈G , g g V h ⊆ V g+h , ∀ g, h ∈ G. ...
Let k greater than or equal to 3 be a fixed positive integer and (G,s) be a pair, where s is a 2-(r, k, 1) design and G is a group of automorphisms of s such that G is solvable and block-transitive on s. If r > (k(3 4) + 1)((p k k - 1)), then r is a po...