On an open problem of Green and Losonczy: Exact enumeration of freely braided permutations

Toufik Mansour

On an open problem of Green and Losonczy: Exact enumeration of freely braided permutations

Department of Mathematics

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

Abstract

Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number braided permutations in S_n is given by 1-3x-2x²+(1+x) √1-4x/1-4x-x²+(1-x²)√1-4x.

Original language	English
Pages (from-to)	461-470
Number of pages	10
Journal	Discrete Mathematics and Theoretical Computer Science
Volume	6
Issue number	2
State	Published - 2004

Keywords

Freely braided permutations
Generating functions
Restricted permutations

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Discrete Mathematics and Combinatorics

Cite this

@article{3ecaabcd55fd4f24a89162818bd68db0,

title = "On an open problem of Green and Losonczy: Exact enumeration of freely braided permutations",

abstract = "Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number braided permutations in Sn is given by 1-3x-2x2+(1+x) √1-4x/1-4x-x2+(1-x2)√1-4x.",

keywords = "Freely braided permutations, Generating functions, Restricted permutations",

author = "Toufik Mansour",

year = "2004",

language = "English",

volume = "6",

pages = "461--470",

journal = "Discrete Mathematics and Theoretical Computer Science",

issn = "1365-8050",

publisher = "Maison de l'informatique et des mathematiques discretes",

number = "2",

}

TY - JOUR

T1 - On an open problem of Green and Losonczy

T2 - Exact enumeration of freely braided permutations

AU - Mansour, Toufik

PY - 2004

Y1 - 2004

N2 - Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number braided permutations in Sn is given by 1-3x-2x2+(1+x) √1-4x/1-4x-x2+(1-x2)√1-4x.

AB - Recently, Green and Losonczy [5, 6] introduced freely braided permutations as a special class of restricted permutations that has arisen in the study of Schubert varieties. They suggest as an open problem to enumerate the number braided permutations in Sn is given by 1-3x-2x2+(1+x) √1-4x/1-4x-x2+(1-x2)√1-4x.

KW - Freely braided permutations

KW - Generating functions

KW - Restricted permutations

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

M3 - Article

AN - SCOPUS:33747890159

SN - 1365-8050

VL - 6

SP - 461

EP - 470

JO - Discrete Mathematics and Theoretical Computer Science

JF - Discrete Mathematics and Theoretical Computer Science

IS - 2

ER -

On an open problem of Green and Losonczy: Exact enumeration of freely braided permutations

Abstract

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this