Alexander Burstein

According to our database, Alexander Burstein authored at least 13 papers between 2002 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2021

Enumeration of Dumont permutations avoiding certain four-letter patterns.

Alexander Burstein, Opel Jones

Discret. Math. Theor. Comput. Sci., 2021

Pattern statistics in faro words and permutations.

Jean-Luc Baril, Alexander Burstein, Sergey Kirgizov

Discret. Math., 2021

2016

Egge triples and unbalanced Wilf equivalence.

Jonathan Bloom, Alexander Burstein

Australas. J Comb., 2016

2011

The Möbius function of separable and decomposable permutations.

Alexander Burstein, Vít Jelínek, Eva Jelínková, Einar Steingrímsson

J. Comb. Theory, Ser. A, 2011

A Short Proof for the Number of Permutations Containing Pattern 321 Exactly Once.

Alexander Burstein

Electron. J. Comb., 2011

2010

Packing sets of patterns.

Alexander Burstein, Peter A. Hästö

Eur. J. Comb., 2010

2006

Restricted Dumont permutations, Dyck paths, and noncrossing partitions.

Alexander Burstein, Sergi Elizalde, Toufik Mansour

Discret. Math., 2006

A geometric form for the extended patience sorting algorithm.

Alexander Burstein, Isaiah Lankham

Adv. Appl. Math., 2006

2005

On Unavoidable Sets of Word Patterns.

Alexander Burstein, Sergey Kitaev

SIAM J. Discret. Math., 2005

2003

Counting occurrences of some subword patterns.

Alexander Burstein, Toufik Mansour

Discret. Math. Theor. Comput. Sci., 2003

2002

A lattice path approach to counting partitions with minimum rank <i>t</i>.

Alexander Burstein, Sylvie Corteel, Alexander Postnikov, Carla D. Savage

Discret. Math., 2002

Words Restricted by Patterns with at Most 2 Distinct Letters.

Alexander Burstein, Toufik Mansour

Electron. J. Comb., 2002

Packing Patterns into Words.

Alexander Burstein, Peter A. Hästö, Toufik Mansour

Electron. J. Comb., 2002