Alexander Burstein

Orcid: 0000-0001-9454-8066

According to our database1, Alexander Burstein authored at least 15 papers between 2002 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On (Shape-)Wilf-Equivalence of Certain Sets of (Partially Ordered) Patterns.
Electron. J. Comb., 2025

2023
Distribution of sets of descent tops and descent bottoms on restricted permutations.
Discret. Math. Theor. Comput. Sci., 2023

2021
Enumeration of Dumont permutations avoiding certain four-letter patterns.
Discret. Math. Theor. Comput. Sci., 2021

Pattern statistics in faro words and permutations.
Discret. Math., 2021

2016
Egge triples and unbalanced Wilf equivalence.
Australas. J Comb., 2016

2011
The Möbius function of separable and decomposable permutations.
J. Comb. Theory A, 2011

A Short Proof for the Number of Permutations Containing Pattern 321 Exactly Once.
Electron. J. Comb., 2011

2010
Packing sets of patterns.
Eur. J. Comb., 2010

2006
Restricted Dumont permutations, Dyck paths, and noncrossing partitions.
Discret. Math., 2006

A geometric form for the extended patience sorting algorithm.
Adv. Appl. Math., 2006

2005
On Unavoidable Sets of Word Patterns.
SIAM J. Discret. Math., 2005

2003
Counting occurrences of some subword patterns.
Discret. Math. Theor. Comput. Sci., 2003

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

Words Restricted by Patterns with at Most 2 Distinct Letters.
Electron. J. Comb., 2002

Packing Patterns into Words.
Electron. J. Comb., 2002


  Loading...