AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement b1, b2…,bn of its elements such that b1, b1b2,…, b1b2⋯ b1 is also an arrangement of the elements of G. This definition can be extended to the case when G is countably infinite by requiring the existence of a sequence b1, b2,…, containing each element of G exactly once, such that the sequence b1,b1b2,… also contains each element of G exactly once. With this definition every countably-infinite group is sequenceable
AbstractA sequencing in a finite group G is a list of all elements of G such that the partial produc...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
Given a sequence ${\bf g}: g_0,\ldots, g_{m}$, in a finite group $G$ with $g_0=1_G$, let ${\bf \bar ...
AbstractA finite group (G, ·) is said to be sequenceable if its elements can be arranged in a sequen...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
AbstractThis paper is concerned with finiteness conditions for finitely generated semigroups. First,...
AbstractA group of order n is said to be R-sequenceable if the nonidentify elements of the group can...
In this paper we introduce a method of sequencing the elements of a finite group that gives rise to ...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
AbstractA sequencing in a finite group G is a list of all elements of G such that the partial produc...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...
AbstractA finite group G having n elements is said to be sequenceable if there exists an arrangement...
A finite group is called Pn-sequenceable if its nonidentity elements can be listed x1 , x2 , ..., xk...
Given a sequence ${\bf g}: g_0,\ldots, g_{m}$, in a finite group $G$ with $g_0=1_G$, let ${\bf \bar ...
AbstractA finite group (G, ·) is said to be sequenceable if its elements can be arranged in a sequen...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
AbstractThis paper is inspired by the paper Some Canonical Sequences of Integers by Bernstein and Sl...
AbstractThis paper is concerned with finiteness conditions for finitely generated semigroups. First,...
AbstractA group of order n is said to be R-sequenceable if the nonidentify elements of the group can...
In this paper we introduce a method of sequencing the elements of a finite group that gives rise to ...
AbstractThe paper contains results about hamiltonian circuits and paths in Cayley graphs of finite g...
AbstractA sequencing in a finite group G is a list of all elements of G such that the partial produc...
AbstractIn this paper we introduce a method of sequencing the elements of a finite group that gives ...
In 1980, about 20 years after sequenceable groups were introduced by Gordon to construct row-complet...