Name
Abstract | ||
|---|---|---|
Starting from a Theorem by Hall, we define the identity transform of a permutation pi as C (pi) = (0+pi(0), 1+pi(1), ..., (n-1)+pi(n-1)), and we define the set C-n = {(C (pi) : pi is an element of S-n}, where S-n is the set of permutations of the elements of the cyclic group Z(n). In the first part of this paper we study the set C-n : we show some closure properties of this set, and then provide some of its combinatorial and algebraic characterizations and connections with other combinatorial structures. In the second part of the paper, we use some of the combinatorial properties we have determined to provide a different algorithm for the proof of Hall's Theorem. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3233/FI-2015-1271 | FUNDAMENTA INFORMATICAE |
Field | DocType | Volume |
Identity transform,Discrete mathematics,Set theory,Combinatorics,Algebraic number,Cyclic group,Permutation,Combinatorial analysis,Mathematics,Computational complexity theory | Journal | 141 |
Issue | ISSN | Citations |
2-3 | 0169-2968 | 0 |
PageRank | References | Authors |
0.34 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Frosini | 1 | 101 | 20.44 |
| D. Battaglino | 2 | 5 | 2.15 |
| Simone Rinaldi | 3 | 174 | 24.93 |
| Samanta Socci | 4 | 2 | 1.40 |