- Research Article
15
- 10.1016/j.disc.2009.04.017
On the extendability of Bi-Cayley graphs of finite abelian groups
- May 08, 2009
- Discrete Mathematics
- Yanfeng Luo + 1 more +1
On the extendability of Bi-Cayley graphs of finite abelian groups
In other words a finite group is simply a finite set of elements with a binary operation in which there exists a unique two-sided identity with respect to the operation, each element has a unique twosided inverse with respect to the operation, and the operation is associative. (This definition is "stronger" than necessary, but is standard.) We shall refer to the operation as multiplication and write a * b as ab. Since we are concerned with finite groups, the problem is: Given a multiplication table for a finite set, is it a group table? All of the conditions of a group with the exception of the associative property can be determined by simply looking at the multiplication table. We have a binary operation if only elements of the given set appear in the body of the table. The identity exists if and only if the marginal row and column are replicated within the table by some element. And every element has an inverse if and only if the identity element appears in each row and column exactly once. Therefore, if we observe that the other properties are satisfied, in order to determine if we have a group, we must show that it is associative. In order to test all possibilities, if the set has n elements, then 4n3 multiplications have to be made since there are n3 equations of the form (ab)c =
On the extendability of Bi-Cayley graphs of finite abelian groups
On the extendability of Bi-Cayley graphs of finite abelian groups
A HALES–JEWETT TYPE PROPERTY OF FINITE SOLVABLE GROUPS
A conjecture of Leader, Russell and Walters in Euclidean Ramsey theory says that a finite set is Ramsey if and only if it is congruent to a subset of a set whose symmetry group acts transitively. As they have shown the ``if" direction of their conjecture follows if all finite groups have a Hales--Jewett type property. In this paper, we show that this property is satisfied in the case of finite solvable groups. Our result can be used to recover the work of Kříž in Euclidean Ramsey theory.
Read moreEvaluate All The Order of Every Element in The Higher Even, Odd, and Prime Order of Group for Composition
This paper aims to treat a study on the order of every element in the higher even, odd and prime order of group for composition. In fact, express order of a group and order of an element of a group in real numbers. Here we discuss the higher order of groups in different types of order, which will give us practical knowledge to see the applications of the composition. In order to find out the order of an element am∈G in which an= e= identity element, then find the least common multiple (i.e.(LCM))= λ) of m and n. The least common multiple of two numbers is the "smallest non-zero common number," which is a multiple of both the numbers. So O(am )= λ/m. Also, if G is a finite group, n is a positive integer, and a∈G then the order of the products na. When G is a finite group, every element must have finite order, but the converse is false. There are infinite groups where each element has finite order. Finally, find out the order of every element of a group in different types of the higher even, odd and prime order of group for composition.
Read moreOn a Certain Class of Metabelian Groups
1. In studying the structure of abstract groups, one is often confronted with the seemingly trivial question: when do we consider a group (or class of groups) as known? The question has many aspects, and is usually a very complex one. Of course, the group is formally known as soon as its multiplication table is determined; but in most cases, little further information can be obtained from the multiplication table itself on the structural elements of the group, such as subgroups, normal subgroups, automorphisms, etc. If one is however, interested in the classification of groups belonging to a certain class, then the problem is concentrated on the enumeration of groups having some common property, and the structural elements of the individual groups are of a secondary importance. In this case, the problem can be formulated in the following way: Find some finite algebraical procedure, depending on some integral or more general algebraical parameters, which enables us to construct, in an abstract or symbolic way, each group belonging to the class under consideration. A group is of course constructed if its elements are known, and the groupproduct of any two elements can be calculated by means of the defining procedure. It is desirable that the parameters, called invariants of the group, should be characteristic of the group in the sense that no two distinct systems of operations should define the same group. A classical example for such an interpretation of the structure problem is furnished by the fundamental theorem of finite Abelian groups. In this paper we are concerned with the enumeration of certain finite metabelian groups. (Metabelian is a group with Abelian commutator subgroup.) The problem in all its generality is a very difficult one, and far from being solved in the above sense. However, special classes of metabelian groups are accessible to investigation, and such investigations have an interest in so far as they clear more aspects of the general problem. In studying the structure of metabelian groups, the method of group extensions is often found to be the most natural tool. As an extensive use will be made of this method in this paper, I want to formulate it in such a way as it seems most suitable for the case discussed here. A similar but formally different formulation was given by A. Scholz1. See also W. Magnus2. Let ( be a finite metabelian group, additively written, 2t an Abelian normal subgroup of (M such that the quotient group e = (5/Wt is Abelian. Elements
Read moreChapter 1 - The Basic Framework
Chapter 1 - The Basic Framework
The graph of atomic divisors and recognition of finite simple groups
The graph of atomic divisors and recognition of finite simple groups
Composition of oriented binary quadratic form-classes over commutative rings
Composition of oriented binary quadratic form-classes over commutative rings
Some results of the non-coprime graph of a generalized quaternion group for some n
In recent years, the graph used as a representation of a finite group. One kind of graph that represents a finite group is the non-coprime graph. The non-coprime graph of a finite group is simple graph where vertices are all elements of that group without identity element and two distinct vertices are adjacent if and only if its order is not coprime. In this research, we will discuss the non-coprime graph of a generalized quaternion group and its properties. The method that is used is to study literature and analyze it by finding patterns in various examples. The results of this research are the form of the graph, degree of each vertex, radius, diameter, girth, and total of cycles contained in the graph when n = 2k and n an odd prime number.
Read moreInduction from Elementary Abelian Subgroups
Induction from Elementary Abelian Subgroups
Simulations of Cayley graphs of dihedral group
Let Γ be a finite group with identity element e and let S ⊆ Γ − {e} which is inverse-closed, i.e., S = S−1 := {s−1 : s ∈ S}. An undirected Cayley graph on a group Γ with connection set S, denoted by Cay(Γ, S), is a graph with vertex set Γ and edges xy for all pairs x,y ∈ Γ such that xy−1 ∈ S. The dihedral group of order 2n, denoted by D2n, is a group generated by two elements a and b subject to the three relations: an = e, b2 = e, and bab−1 = a−1. In this paper, we investigate the Cayley graphs of the dihedral group for some connection sets S satisfying |S| = 1, 2, 3 by doing simulations using Wolfram Mathematica.
Read moreOn association schemes of finite exponent
On association schemes of finite exponent
Cellular automata and finite groups
For a finite group $G$ and a finite set $A$, we study various algebraic aspects of cellular automata over the configuration space $A^G$. In this situation, the set $\text{CA}(G;A)$ of all cellular automata over $A^G$ is a finite monoid whose basic algebraic properties had remained unknown. First, we investigate the structure of the group of units $\text{ICA}(G;A)$ of $\text{CA}(G;A)$. We obtain a decomposition of $\text{ICA}(G;A)$ into a direct product of wreath products of groups that depends on the numbers $\alpha_{[H]}$ of periodic configurations for conjugacy classes $[H]$ of subgroups of $G$. We show how the numbers $\alpha_{[H]}$ may be computed using the M\"obius function of the subgroup lattice of $G$, and we use this to improve the lower bound recently found by Gao, Jackson and Seward on the number of aperiodic configurations of $A^G$. Furthermore, we study generating sets of $\text{CA}(G;A)$; in particular, we prove that $\text{CA}(G;A)$ cannot be generated by cellular automata with small memory set, and, when all subgroups of $G$ are normal, we determine the relative rank of $\text{ICA}(G;A)$ on $\text{CA}(G;A)$, i.e. the minimal size of a set $V \subseteq \text{CA}(G;A)$ such that $\text{CA}(G;A) = \langle \text{ICA}(G;A) \cup V \rangle$.
Read moreGromov hyperbolic groups and the Macaev norm
Let Γ be a Gromov hyperbolic group with a finite set A of generators. We prove that h top (Σ(∞)) ≤ k - ∞ (λ A )≤ gr(r, A), where gr(r, A) is the growth entropy, h top (Σ(∞)) is the Coornaert-Papadopoulos topological entropy of the subshift Σ (∞) associated with (Γ, A), and k - ∞ (λ A ) is Voiculescu's numerical invariant, which is an obstruction to the existence of quasicentral approximate units relative to the Macaev norm for a tuple of unitary operators λ A = (λ a ) a∈A in the left regular representation of r. We also prove that these three quantities are equal for a hyperbolic group splitting over a finite group.
Read moreGroups of binary relations
It was shown in [3] that every finite group is the maximal subgroup of a semigroupBx of all binary relations on some finite set X. This result is extended here to arbitrary groups.
Read moreTransitive actions of finite abelian groups of sup-norm isometries
Transitive actions of finite abelian groups of sup-norm isometries