Search Results - "Burstein, Alexander"

On unavoidable sets of word patterns.

Authors: Burstein, Alexander Kitaev, Sergey

Source: SIAM Journal on Discrete Mathematics; 2005, Vol. 19 Issue 2, p371-381, 11p

Permutations with Exactly One Copy of a Monotone Pattern of Length k, and a Generalization.

Authors: Bóna, Miklós Burstein, Alexander

Source: Annals of Combinatorics. Jun2022, Vol. 26 Issue 2, p393-404. 12p.

On Some Properties of Permutation Tableaux.

Authors: Burstein, Alexander¹ aburstein@howard.edu

Source: Annals of Combinatorics. 2007, Vol. 11 Issue 3/4, p355-368. 14p.

Restricted Dumont Permutations.

Authors: Burstein, Alexander¹ burstein@orion.math.iastate.edu

Source: Annals of Combinatorics. 2005, Vol. 9 Issue 3, p269-280. 12p.

Counting occurrences of some subword patterns.

Authors: Burstein, Alexander Mansour, Toufik

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). Dec2003, Vol. 6 Issue 2, p1-11. 11p.

Subjects: Computational mathematics, Mathematical functions, Isomorphism (Mathematics), Combinatorics, Mathematical analysis

Words Restricted by 3-Letter Generalized Multipermutation Patterns.

Authors: Burstein, Alexander Mansour, Toufik

Source: Annals of Combinatorics. 2003, Vol. 7 Issue 1, p1. 14p.

A geometric form for the extended patience sorting algorithm

Authors: Burstein, Alexander Lankham, Isaiah

Source: Advances in Applied Mathematics. Feb2006, Vol. 36 Issue 2, p106-117. 12p.

Subjects: Algorithms, Combinatorial probabilities, Configurations (Geometry), Permutations, Lattice paths

The Möbius function of separable and decomposable permutations ^☆ [☆] Jelínek and Steingrímsson were supported by grant No. 090038012 from the Icelandic Research Fund. Jelínek was also supported by grant Z130-N13 from the Austrian Science Foundation (FWF). Jelínková was supported by project 1M0021620838 of the Czech Ministry of Education.

Authors: Burstein, Alexander Jelínek, Vít Jelínková, Eva et al.

Source: Journal of Combinatorial Theory - Series A. Nov2011, Vol. 118 Issue 8, p2346-2364. 19p.

Subjects: Permutations, Mathematical formulas, Möbius function, Partially ordered sets, Embeddings (Mathematics), Mathematical decomposition, Combinatorics

The Möbius function of separable and decomposable permutations ☆ [☆] Jelínek and Steingrímsson were supported by grant No. 090038012 from the Icelandic Research Fund. Jelínek was also supported by grant Z130-N13 from the Austrian Science Foundation (FWF). Jelínková was supported by project 1M0021620838 of the Czech Ministry of Education.

Authors: Burstein, Alexander Jelínek, Vít Jelínková, Eva et al.

Source: Journal of Combinatorial Theory - Series A; Nov2011, Vol. 118 Issue 8, p2346-2364, 19p

Packing sets of patterns

Authors: Burstein, Alexander Hästö, Peter

Source: European Journal of Combinatorics. Jan2010, Vol. 31 Issue 1, p241-253. 13p.

Restricted Dumont permutations, Dyck paths, and noncrossing partitions

Authors: Burstein, Alexander Elizalde, Sergi Mansour, Toufik

Source: Discrete Mathematics; Nov2006, Vol. 306 Issue 22, p2851-2869, 19p

A lattice path approach to counting partitions with minimum rank t

Authors: Burstein, Alexander Corteel, Sylvie Postnikov, Alexander et al.

Source: Discrete Mathematics; Apr2002, Vol. 249 Issue 1-3, p31, 9p

Pattern statistics in faro words and permutations.

Authors: Baril, Jean-Luc Burstein, Alexander Kirgizov, Sergey

Source: Discrete Mathematics; Aug2021, Vol. 344 Issue 8, pN.PAG-N.PAG, 1p