Extremal problems on permutations under cyclic equivalence

P. Erdős, N. Linial, S. Moran

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

How much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → Z which give a measure of complexity to permutations we are interested in finding F(n) = max min f(σ), where the max is over σ ε{lunate} Sn and the min is over π which are cyclically equivalent to σ. The measures of complexity considered are the number of inversions and the diameter of the permutation. The effect of allowing a reflection as well as rotations is also considered.

Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalDiscrete Mathematics
Volume64
Issue number1
DOIs
Publication statusPublished - 1987

Fingerprint

Extremal Problems
Permutation
Equivalence
Min-max
Inversion

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Extremal problems on permutations under cyclic equivalence. / Erdős, P.; Linial, N.; Moran, S.

In: Discrete Mathematics, Vol. 64, No. 1, 1987, p. 1-11.

Research output: Contribution to journalArticle

Erdős, P. ; Linial, N. ; Moran, S. / Extremal problems on permutations under cyclic equivalence. In: Discrete Mathematics. 1987 ; Vol. 64, No. 1. pp. 1-11.
@article{578b049d06b04ae19eaf86fdd8cf33bc,
title = "Extremal problems on permutations under cyclic equivalence",
abstract = "How much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → Z which give a measure of complexity to permutations we are interested in finding F(n) = max min f(σ), where the max is over σ ε{lunate} Sn and the min is over π which are cyclically equivalent to σ. The measures of complexity considered are the number of inversions and the diameter of the permutation. The effect of allowing a reflection as well as rotations is also considered.",
author = "P. Erdős and N. Linial and S. Moran",
year = "1987",
doi = "10.1016/0012-365X(87)90235-4",
language = "English",
volume = "64",
pages = "1--11",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Extremal problems on permutations under cyclic equivalence

AU - Erdős, P.

AU - Linial, N.

AU - Moran, S.

PY - 1987

Y1 - 1987

N2 - How much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → Z which give a measure of complexity to permutations we are interested in finding F(n) = max min f(σ), where the max is over σ ε{lunate} Sn and the min is over π which are cyclically equivalent to σ. The measures of complexity considered are the number of inversions and the diameter of the permutation. The effect of allowing a reflection as well as rotations is also considered.

AB - How much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → Z which give a measure of complexity to permutations we are interested in finding F(n) = max min f(σ), where the max is over σ ε{lunate} Sn and the min is over π which are cyclically equivalent to σ. The measures of complexity considered are the number of inversions and the diameter of the permutation. The effect of allowing a reflection as well as rotations is also considered.

UR - http://www.scopus.com/inward/record.url?scp=45949121643&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=45949121643&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(87)90235-4

DO - 10.1016/0012-365X(87)90235-4

M3 - Article

VL - 64

SP - 1

EP - 11

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -