Transitive large sets of disjoint decompositions and group sequencings

نویسندگان

  • Gil Kaplan
  • Arieh Lev
  • Yehuda Roditty
چکیده

Let n¿ 3 be an integer, and let k denote either n or n − 1. A large set of disjoint decompositions of K∗ n (Kn) into cycles of length k (denoted by k-LSD), is a partition of the set of all cycles of length k in K∗ n (Kn) into disjoint decompositions of K ∗ n (Kn) (i.e., any two decompositions have no k-cycle in common). Such a large set is transitive, if there exists a permutation group on the vertices of K∗ n (Kn), which acts transitively on the decompositions in the large set. In this paper, we study the connection between group sequencings and the existence of transitive k-LSDs. We show that if there exists a sequenceable group of order n − 1, then there exists a transitive n-LSD of K∗ n . Corresponding results are derived for the undirected case. We study also the connection between R-sequencings of groups and the existence of a transitive (n − 1)-LSD of K∗ n . We derive necessary and su7cient conditions for the existence of a transitive k-LSD whose corresponding decompositions admit a regular group of automorphisms. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharply $(n-2)$-transitive Sets of Permutations

Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...

متن کامل

On transitive soft sets over semihypergroups

The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and  $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.

متن کامل

Product constructions for transitive decompositions of graphs

A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition is a decomposition which is highly symmetrical, in the sense that the subgraphs are preserved and transitively permuted by a group of automorphisms of the graph. This paper describes some ‘product’ constructions for transitive decompositions of graphs, and shows how these may be used...

متن کامل

A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems

In what follows, an ordered pair will always be an ordered pair (x, y), where x # y. A transitive triple is a collection of three ordered pairs of the form (6, Y), (Y, z), (x, z)}, which we will always denote by (x, y, z). A transitive triple system (TTS(u)) is a pair (X, B), where X is a set containing v elements and B is a collection of transitive triples of elements of X such that every orde...

متن کامل

Sets with a Category Action

Let C be a small category and Set the category of sets. We define a C-set to be a functor Ω : C → Set. Thus Ω is simply a diagram of sets, the diagram having the same shape as C: for each object x of C there is specified a set Ω(x) and for each morphism α : x → y there is a mapping of sets Ω(α) : Ω(x) → Ω(y). If C happens to be a group (a category with one object and morphism set G) then a C-se...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 254  شماره 

صفحات  -

تاریخ انتشار 2002