Mark Shattuck

According to our database1, Mark Shattuck authored at least 38 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Some New Restricted n-Color Composition Functions.
J. Integer Seq., 2019

2018
Impulse parameter and a new equivalence between 123- and 132-avoiding permutations.
Discret. Math. Algorithms Appl., 2018

2017
A polynomial generalization of some associated sequences related to set partitions.
Period. Math. Hung., 2017

Identities for Generalized Whitney and Stirling Numbers.
J. Integer Seq., 2017

Wilf classification of triples of 4-letter patterns II.
Discret. Math. Theor. Comput. Sci., 2017

Wilf classification of triples of 4-letter patterns I.
Discret. Math. Theor. Comput. Sci., 2017

Nine classes of permutations enumerated by binomial transform of Fine's sequence.
Discret. Appl. Math., 2017

Recounting the number of peaks and valleys in compositions of integers.
Ars Comb., 2017

2016
A (p, q)-Analogue of the r-Whitney-Lah Numbers.
J. Integer Seq., 2016

A statistic related to trees and words on a finite alphabet.
Discret. Math. Algorithms Appl., 2016

Counting permutations by the number of successions within cycles.
Discret. Math., 2016

2015
On avoidance of patterns of the form σ-τ by words over a finite alphabet.
Discret. Math. Theor. Comput. Sci., 2015

Counting subwords in flattened partitions of sets.
Discret. Math., 2015

Some results on the avoidance of vincular patterns by multisets.
Discret. Appl. Math., 2015

2014
An Impossibility Theorem for Allocation Aggregation.
J. Philos. Log., 2014

Combinatorial Proofs of Some Formulas for Triangular Tilings.
J. Integer Seq., 2014

Congruence successions in compositions.
Discret. Math. Theor. Comput. Sci., 2014

Some enumerative results related to ascent sequences.
Discret. Math., 2014

2013
Counting humps and peaks in generalized Motzkin paths.
Discret. Appl. Math., 2013

A combinatorial approach to a general two-term recurrence.
Discret. Appl. Math., 2013

Polynomials whose coefficients are generalized Tribonacci numbers.
Appl. Math. Comput., 2013

On multiple pattern avoiding set partitions.
Adv. Appl. Math., 2013

2012
Convolution Identities for Stirling Numbers of the First Kind Via Involution.
Integers, 2012

Avoiding Type (1, 2) or (2, 1) Patterns in a Partition of a Set.
Integers, 2012

A general two-term recurrence and its solution.
Eur. J. Comb., 2012

Catalan numbers and pattern restricted set partitions.
Discret. Math., 2012

On the Stirling numbers associated with the meromorphic Weyl algebra.
Appl. Math. Lett., 2012

Set partitions as geometric words.
Australas. J Comb., 2012

2011
Maximizing a Sum Related to Image Segmentation Evaluation.
J. Math. Model. Algorithms, 2011

A Recurrence Related to the Bell Numbers.
Integers, 2011

Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers.
Integers, 2011

On a New Family of Generalized Stirling and Bell Numbers.
Electron. J. Comb., 2011

Pattern-Avoiding Set Partitions and Catalan Numbers.
Electron. J. Comb., 2011

2010
Recounting the Number of Rises, Levels, and Descents in Finite Set Partitions.
Integers, 2010

Counting Subwords in a Partition of a Set.
Electron. J. Comb., 2010

2009
Recounting Relations for Set Partitions with Restrictions.
Ars Comb., 2009

2006
A New Statistic on Linear and Circular r-Mino Arrangements.
Electron. J. Comb., 2006

2005
Parity Theorems for Statistics on Domino Arrangements.
Electron. J. Comb., 2005


  Loading...