Avoiding maximal parabolic subgroups of S_k

We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.

Gespeichert in:

Autor*in:	Toufik Mansour [verfasserIn] Alek Vainshtein [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2000

Schlagwörter:	permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]

Übergeordnetes Werk:	In: Discrete Mathematics & Theoretical Computer Science - Discrete Mathematics & Theoretical Computer Science, 2004, (2000)
Übergeordnetes Werk:	year:2000

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.46298/dmtcs.276

Katalog-ID:	DOAJ097145688

Internformat


LEADER	01000naa a22002652 4500
001	DOAJ097145688
003	DE-627
005	20240413173356.0
007	cr uuu---uuuuu
008	240413s2000 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.46298/dmtcs.276 \|2 doi
035			\|a (DE-627)DOAJ097145688
035			\|a (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a QA1-939
100	0		\|a Toufik Mansour \|e verfasserin \|4 aut
245	1	0	\|a Avoiding maximal parabolic subgroups of S_k
264		1	\|c 2000
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.
650		4	\|a permutations
650		4	\|a forbidden patterns
650		4	\|a parabolic subgroups
650		4	\|a laguerre polynomials
650		4	\|a rook polynomials
650		4	\|a [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
653		0	\|a Mathematics
700	0		\|a Alek Vainshtein \|e verfasserin \|4 aut
773	0	8	\|i In \|t Discrete Mathematics & Theoretical Computer Science \|d Discrete Mathematics & Theoretical Computer Science, 2004 \|g (2000) \|w (DE-627)239019105 \|w (DE-600)1412155-4 \|x 13658050 \|7 nnns
773	1	8	\|g year:2000
856	4	0	\|u https://doi.org/10.46298/dmtcs.276 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e \|z kostenfrei
856	4	0	\|u https://dmtcs.episciences.org/276/pdf \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/1365-8050 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|j 2000

Indexfelder

author_variant	t m tm a v av
matchkey_str	article:13658050:2000----::viigaiaprblcu
hierarchy_sort_str	2000
callnumber-subject-code	QA
publishDate	2000
allfields	10.46298/dmtcs.276 doi (DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e DE-627 ger DE-627 rakwb eng QA1-939 Toufik Mansour verfasserin aut Avoiding maximal parabolic subgroups of S_k 2000 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board. permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics Alek Vainshtein verfasserin aut In Discrete Mathematics & Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science, 2004 (2000) (DE-627)239019105 (DE-600)1412155-4 13658050 nnns year:2000 https://doi.org/10.46298/dmtcs.276 kostenfrei https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e kostenfrei https://dmtcs.episciences.org/276/pdf kostenfrei https://doaj.org/toc/1365-8050 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2000
spelling	10.46298/dmtcs.276 doi (DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e DE-627 ger DE-627 rakwb eng QA1-939 Toufik Mansour verfasserin aut Avoiding maximal parabolic subgroups of S_k 2000 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board. permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics Alek Vainshtein verfasserin aut In Discrete Mathematics & Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science, 2004 (2000) (DE-627)239019105 (DE-600)1412155-4 13658050 nnns year:2000 https://doi.org/10.46298/dmtcs.276 kostenfrei https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e kostenfrei https://dmtcs.episciences.org/276/pdf kostenfrei https://doaj.org/toc/1365-8050 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2000
allfields_unstemmed	10.46298/dmtcs.276 doi (DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e DE-627 ger DE-627 rakwb eng QA1-939 Toufik Mansour verfasserin aut Avoiding maximal parabolic subgroups of S_k 2000 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board. permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics Alek Vainshtein verfasserin aut In Discrete Mathematics & Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science, 2004 (2000) (DE-627)239019105 (DE-600)1412155-4 13658050 nnns year:2000 https://doi.org/10.46298/dmtcs.276 kostenfrei https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e kostenfrei https://dmtcs.episciences.org/276/pdf kostenfrei https://doaj.org/toc/1365-8050 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2000
allfieldsGer	10.46298/dmtcs.276 doi (DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e DE-627 ger DE-627 rakwb eng QA1-939 Toufik Mansour verfasserin aut Avoiding maximal parabolic subgroups of S_k 2000 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board. permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics Alek Vainshtein verfasserin aut In Discrete Mathematics & Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science, 2004 (2000) (DE-627)239019105 (DE-600)1412155-4 13658050 nnns year:2000 https://doi.org/10.46298/dmtcs.276 kostenfrei https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e kostenfrei https://dmtcs.episciences.org/276/pdf kostenfrei https://doaj.org/toc/1365-8050 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2000
allfieldsSound	10.46298/dmtcs.276 doi (DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e DE-627 ger DE-627 rakwb eng QA1-939 Toufik Mansour verfasserin aut Avoiding maximal parabolic subgroups of S_k 2000 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board. permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics Alek Vainshtein verfasserin aut In Discrete Mathematics & Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science, 2004 (2000) (DE-627)239019105 (DE-600)1412155-4 13658050 nnns year:2000 https://doi.org/10.46298/dmtcs.276 kostenfrei https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e kostenfrei https://dmtcs.episciences.org/276/pdf kostenfrei https://doaj.org/toc/1365-8050 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 2000
language	English
source	In Discrete Mathematics & Theoretical Computer Science (2000) year:2000
sourceStr	In Discrete Mathematics & Theoretical Computer Science (2000) year:2000
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Mathematics
isfreeaccess_bool	true
container_title	Discrete Mathematics & Theoretical Computer Science
authorswithroles_txt_mv	Toufik Mansour @@aut@@ Alek Vainshtein @@aut@@
publishDateDaySort_date	2000-01-01T00:00:00Z
hierarchy_top_id	239019105
id	DOAJ097145688
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ097145688</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413173356.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240413s2000 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.46298/dmtcs.276</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ097145688</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJab60b11f7efe4111b327c1ad9041569e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Toufik Mansour</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Avoiding maximal parabolic subgroups of S_k</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">permutations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">forbidden patterns</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">parabolic subgroups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">laguerre polynomials</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rook polynomials</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Alek Vainshtein</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Discrete Mathematics & Theoretical Computer Science</subfield><subfield code="d">Discrete Mathematics & Theoretical Computer Science, 2004</subfield><subfield code="g">(2000)</subfield><subfield code="w">(DE-627)239019105</subfield><subfield code="w">(DE-600)1412155-4</subfield><subfield code="x">13658050</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2000</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.46298/dmtcs.276</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dmtcs.episciences.org/276/pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1365-8050</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2000</subfield></datafield></record></collection>
callnumber-first	Q - Science
author	Toufik Mansour
spellingShingle	Toufik Mansour misc QA1-939 misc permutations misc forbidden patterns misc parabolic subgroups misc laguerre polynomials misc rook polynomials misc [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] misc Mathematics Avoiding maximal parabolic subgroups of S_k
authorStr	Toufik Mansour
ppnlink_with_tag_str_mv	@@773@@(DE-627)239019105
format	electronic Article
delete_txt_mv	keep
author_role	aut aut
collection	DOAJ
remote_str	true
callnumber-label	QA1-939
illustrated	Not Illustrated
issn	13658050
topic_title	QA1-939 Avoiding maximal parabolic subgroups of S_k permutations forbidden patterns parabolic subgroups laguerre polynomials rook polynomials [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
topic	misc QA1-939 misc permutations misc forbidden patterns misc parabolic subgroups misc laguerre polynomials misc rook polynomials misc [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] misc Mathematics
topic_unstemmed	misc QA1-939 misc permutations misc forbidden patterns misc parabolic subgroups misc laguerre polynomials misc rook polynomials misc [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] misc Mathematics
topic_browse	misc QA1-939 misc permutations misc forbidden patterns misc parabolic subgroups misc laguerre polynomials misc rook polynomials misc [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] misc Mathematics
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Discrete Mathematics & Theoretical Computer Science
hierarchy_parent_id	239019105
hierarchy_top_title	Discrete Mathematics & Theoretical Computer Science
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)239019105 (DE-600)1412155-4
title	Avoiding maximal parabolic subgroups of S_k
ctrlnum	(DE-627)DOAJ097145688 (DE-599)DOAJab60b11f7efe4111b327c1ad9041569e
title_full	Avoiding maximal parabolic subgroups of S_k
author_sort	Toufik Mansour
journal	Discrete Mathematics & Theoretical Computer Science
journalStr	Discrete Mathematics & Theoretical Computer Science
callnumber-first-code	Q
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2000
contenttype_str_mv	txt
author_browse	Toufik Mansour Alek Vainshtein
class	QA1-939
format_se	Elektronische Aufsätze
author-letter	Toufik Mansour
doi_str_mv	10.46298/dmtcs.276
author2-role	verfasserin
title_sort	avoiding maximal parabolic subgroups of s_k
callnumber	QA1-939
title_auth	Avoiding maximal parabolic subgroups of S_k
abstract	We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.
abstractGer	We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.
abstract_unstemmed	We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	Avoiding maximal parabolic subgroups of S_k
url	https://doi.org/10.46298/dmtcs.276 https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e https://dmtcs.episciences.org/276/pdf https://doaj.org/toc/1365-8050
remote_bool	true
author2	Alek Vainshtein
author2Str	Alek Vainshtein
ppnlink	239019105
callnumber-subject	QA - Mathematics
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.46298/dmtcs.276
callnumber-a	QA1-939
up_date	2024-07-03T23:58:53.706Z
_version_	1803604337578999808
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ097145688</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240413173356.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">240413s2000 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.46298/dmtcs.276</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ097145688</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJab60b11f7efe4111b327c1ad9041569e</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA1-939</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Toufik Mansour</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Avoiding maximal parabolic subgroups of S_k</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">permutations</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">forbidden patterns</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">parabolic subgroups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">laguerre polynomials</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">rook polynomials</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Mathematics</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Alek Vainshtein</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Discrete Mathematics & Theoretical Computer Science</subfield><subfield code="d">Discrete Mathematics & Theoretical Computer Science, 2004</subfield><subfield code="g">(2000)</subfield><subfield code="w">(DE-627)239019105</subfield><subfield code="w">(DE-600)1412155-4</subfield><subfield code="x">13658050</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">year:2000</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.46298/dmtcs.276</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/ab60b11f7efe4111b327c1ad9041569e</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dmtcs.episciences.org/276/pdf</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/1365-8050</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="j">2000</subfield></datafield></record></collection>
score	7.400943

Nicht das Richtige dabei?

Schreiben Sie uns!

Avoiding maximal parabolic subgroups of S_k

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?