Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Alexander Burstein"'
Autor:
Alexander Burstein, Opel Jones
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 2, Permutation..., Iss Special issues (2021)
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
Externí odkaz:
https://doaj.org/article/beae7a97fd0a4e9899ee9c3486c18bcf
Autor:
Alexander Burstein, Niklas Eriksen
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AJ,..., Iss Proceedings (2008)
We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between $1$-hinge and $0$-hinge tableaux. We also consider certain alignment and crossing statistics on permutat
Externí odkaz:
https://doaj.org/article/8b4341fbe3e9481c8f0bff9170228d73
Autor:
Alexander Burstein, Toufik Mansour
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 6, Iss 1 (2003)
We find generating functions the number of strings (words) containing a specified number of occurrences of certain types of order-isomorphic classes of substrings called subword patterns. In particular, we find generating functions for the number of
Externí odkaz:
https://doaj.org/article/34d25a94b03a4a8199eb4ed11dbbcf3a
Autor:
Miklós Bóna, Alexander Burstein
Publikováno v:
Annals of Combinatorics. 26:393-404
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f3661887ae34fcebb1220b1d90ae1be
https://doi.org/10.1007/s00026-021-00549-0
https://doi.org/10.1007/s00026-021-00549-0
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, 2021, 344 (8), ⟨10.1016/j.disc.2021.112464⟩
Discrete Mathematics, Elsevier, 2021, 344 (8), ⟨10.1016/j.disc.2021.112464⟩
We study the distribution and the popularity of some patterns in $k$-ary faro words, i.e. words over the alphabet $\{1, 2, \ldots, k\}$ obtained by interlacing the letters of two nondecreasing words of lengths differing by at most one. We present a b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c64a2aac81a49f231648c9a61ec099e
http://arxiv.org/abs/2010.06270
http://arxiv.org/abs/2010.06270
Autor:
Opel Jones, Alexander Burstein
In this paper, we enumerate Dumont permutations of the fourth kind avoiding or containing certain permutations of length 4. We also conjecture a Wilf-equivalence of two 4-letter patterns on Dumont permutations of the first kind.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c74b30dab9535af134919f3c0c02aa20
Autor:
Alexander Burstein, Peter Hästö
Publikováno v:
European Journal of Combinatorics. 31(1):241-253
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this question ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5b42e2ddc5311fdbe8721150c9a9046
Autor:
Alexander Burstein
Publikováno v:
Annals of Combinatorics. 9:269-280
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder numbers, and othe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bcc3ce51f59c3e07a90da88033c4b99
https://doi.org/10.1007/s00026-005-0256-4
https://doi.org/10.1007/s00026-005-0256-4
Autor:
Sergey Kitaev, Alexander Burstein
Publikováno v:
SIAM Journal on Discrete Mathematics. 19:371-381
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern overlaps intr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc05096e6476167c3011730441d4a505
https://doi.org/10.1137/s0895480104445678
https://doi.org/10.1137/s0895480104445678
Publikováno v:
Discrete Mathematics. 249(1-3):31-39
In this paper, we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: for t⩽1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e16998d25c8ff98f21fbb420de59ea8