Extremal problems on permutations under cyclic equivalence

P. Erdös; N. Linial; S. Moran

doi:10.1016/0012-365X(87)90235-4

Extremal problems on permutations under cyclic equivalence

P. Erdös^*
, N. Linial
, S. Moran

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

How much can a permutation be simplified by means of cyclic rotations? For functions f:S_n → 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} S_n 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 language	English
Pages (from-to)	1-11
Number of pages	11
Journal	Discrete Mathematics
Volume	64
Issue number	1
DOIs	https://doi.org/10.1016/0012-365X(87)90235-4
State	Published - Mar 1987

Access to Document

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

Cite this

@article{503de194690a4880bef0acf2c61a25b2,

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{\"o}s and N. Linial and S. Moran",

year = "1987",

month = mar,

doi = "10.1016/0012-365X(87)90235-4",

language = "אנגלית",

volume = "64",

pages = "1--11",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Extremal problems on permutations under cyclic equivalence

AU - Erdös, P.

AU - Linial, N.

AU - Moran, S.

PY - 1987/3

Y1 - 1987/3

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 - https://www.scopus.com/pages/publications/45949121643

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

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

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:45949121643

SN - 0012-365X

VL - 64

SP - 1

EP - 11

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Extremal problems on permutations under cyclic equivalence

Abstract

Access to Document

Other files and links

Fingerprint

Cite this