![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mark Shattuck
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j46]Toufik Mansour, Mark Shattuck:
Counting occurrences of subword patterns in non-crossing partitions. Art Discret. Appl. Math. 6(3): 3 (2023) - [j45]Toufik Mansour, Mark Shattuck:
Counting inversion sequences by parity successions and runs. Discret. Appl. Math. 330: 24-39 (2023) - 2022
- [j44]Vít Jelínek
, Toufik Mansour
, José Luis Ramírez
, Mark Shattuck:
Avoiding a pair of patterns in multisets and compositions. Adv. Appl. Math. 133: 102286 (2022) - [j43]Toufik Mansour
, Reza Rastegar, Mark Shattuck:
Subregularity in infinitely labeled generating trees of restricted permutations. Adv. Appl. Math. 140: 102393 (2022) - [j42]Toufik Mansour
, Mark Shattuck:
On avoiding 1233. Art Discret. Appl. Math. 5(1) (2022) - [j41]Toufik Mansour, Mark Shattuck:
On a question of Li concerning an uncounted class of circular permutations. Australas. J Comb. 83: 176-195 (2022) - [j40]Toufik Mansour
, Mark Shattuck:
Further enumeration results concerning a recent equivalence of restricted inversion sequences. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - 2021
- [i1]Vít Jelínek, Toufik Mansour, José Luis Ramírez, Mark Shattuck:
Avoiding a pair of patterns in multisets and compositions. CoRR abs/2111.06185 (2021) - 2020
- [j39]Aubrey Blecher
, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour
, Mark Shattuck:
Counting Permutations by the Number of Vertical Edges in Their Bargraphs. J. Autom. Lang. Comb. 25(4): 279-290 (2020)
2010 – 2019
- 2019
- [j38]Jarib R. Acosta, Yadira Caicedo, Juan P. Poveda, José Luis Ramírez, Mark Shattuck:
Some New Restricted n-Color Composition Functions. J. Integer Seq. 22(6): 19.6.4 (2019) - 2018
- [j37]Toufik Mansour
, Mark Shattuck:
Impulse parameter and a new equivalence between 123- and 132-avoiding permutations. Discret. Math. Algorithms Appl. 10(4): 1850054:1-1850054:24 (2018) - 2017
- [j36]Mark Shattuck:
Recounting the number of peaks and valleys in compositions of integers. Ars Comb. 132: 323-329 (2017) - [j35]Toufik Mansour
, Mark Shattuck:
Nine classes of permutations enumerated by binomial transform of Fine's sequence. Discret. Appl. Math. 226: 94-105 (2017) - [j34]David Callan, Toufik Mansour, Mark Shattuck:
Wilf classification of triples of 4-letter patterns I. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j33]David Callan, Toufik Mansour, Mark Shattuck:
Wilf classification of triples of 4-letter patterns II. Discret. Math. Theor. Comput. Sci. 19(1) (2017) - [j32]Mark Shattuck:
Identities for Generalized Whitney and Stirling Numbers. J. Integer Seq. 20(10): 17.10.4 (2017) - [j31]Toufik Mansour
, Mark Shattuck:
A polynomial generalization of some associated sequences related to set partitions. Period. Math. Hung. 75(2): 398-412 (2017) - 2016
- [j30]Toufik Mansour
, Mark Shattuck:
Counting permutations by the number of successions within cycles. Discret. Math. 339(4): 1368-1376 (2016) - [j29]Toufik Mansour
, Mark Shattuck:
A statistic related to trees and words on a finite alphabet. Discret. Math. Algorithms Appl. 8(2): 1650031:1-1650031:13 (2016) - [j28]José Luis Ramírez, Mark Shattuck:
A (p, q)-Analogue of the r-Whitney-Lah Numbers. J. Integer Seq. 19(5): 16.5.6 (2016) - 2015
- [j27]Toufik Mansour
, Mark Shattuck:
Some results on the avoidance of vincular patterns by multisets. Discret. Appl. Math. 181: 201-208 (2015) - [j26]Toufik Mansour
, Mark Shattuck, Stephan G. Wagner:
Counting subwords in flattened partitions of sets. Discret. Math. 338(11): 1989-2005 (2015) - [j25]Toufik Mansour
, Mark Shattuck:
On avoidance of patterns of the form σ-τ by words over a finite alphabet. Discret. Math. Theor. Comput. Sci. 17(2): 181-202 (2015) - 2014
- [j24]Toufik Mansour
, Mark Shattuck:
Some enumerative results related to ascent sequences. Discret. Math. 315-316: 29-41 (2014) - [j23]Toufik Mansour
, Mark Shattuck, Mark C. Wilson:
Congruence successions in compositions. Discret. Math. Theor. Comput. Sci. 16(1): 327-338 (2014) - [j22]Mark Shattuck:
Combinatorial Proofs of Some Formulas for Triangular Tilings. J. Integer Seq. 17(5): 14.5.5 (2014) - [j21]Carl G. Wagner, Mark Shattuck:
An Impossibility Theorem for Allocation Aggregation. J. Philos. Log. 43(6): 1173-1186 (2014) - 2013
- [j20]Vít Jelínek
, Toufik Mansour
, Mark Shattuck:
On multiple pattern avoiding set partitions. Adv. Appl. Math. 50(2): 292-326 (2013) - [j19]Toufik Mansour
, Mark Shattuck:
Polynomials whose coefficients are generalized Tribonacci numbers. Appl. Math. Comput. 219(15): 8366-8374 (2013) - [j18]Toufik Mansour
, Mark Shattuck:
A combinatorial approach to a general two-term recurrence. Discret. Appl. Math. 161(13-14): 2084-2094 (2013) - [j17]Toufik Mansour
, Mark Shattuck:
Counting humps and peaks in generalized Motzkin paths. Discret. Appl. Math. 161(13-14): 2213-2216 (2013) - 2012
- [j16]Toufik Mansour, Mark Shattuck:
Set partitions as geometric words. Australas. J Comb. 53: 31-40 (2012) - [j15]Toufik Mansour
, Matthias Schork, Mark Shattuck:
On the Stirling numbers associated with the meromorphic Weyl algebra. Appl. Math. Lett. 25(11): 1767-1771 (2012) - [j14]Toufik Mansour
, Matthias Schork, Mark Shattuck:
Catalan numbers and pattern restricted set partitions. Discret. Math. 312(20): 2979-2991 (2012) - [j13]Toufik Mansour
, Shashikant Mulay
, Mark Shattuck:
A general two-term recurrence and its solution. Eur. J. Comb. 33(1): 20-26 (2012) - [j12]Toufik Mansour, Mark Shattuck:
Avoiding Type (1, 2) or (2, 1) Patterns in a Partition of a Set. Integers 12: A20 (2012) - [j11]Mark Shattuck:
Convolution Identities for Stirling Numbers of the First Kind Via Involution. Integers 12: A59 (2012) - 2011
- [j10]Toufik Mansour
, Matthias Schork, Mark Shattuck:
On a New Family of Generalized Stirling and Bell Numbers. Electron. J. Comb. 18(1) (2011) - [j9]Toufik Mansour, Mark Shattuck:
Pattern-Avoiding Set Partitions and Catalan Numbers. Electron. J. Comb. 18(2): 34 (2011) - [j8]Alex Eustis, Mark Shattuck:
Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers. Integers 11: A23 (2011) - [j7]Toufik Mansour, Mark Shattuck:
A Recurrence Related to the Bell Numbers. Integers 11: A67 (2011) - [j6]Johannes Hatzl, Toufik Mansour
, Mark Shattuck:
Maximizing a Sum Related to Image Segmentation Evaluation. J. Math. Model. Algorithms 10(2): 193-203 (2011) - 2010
- [j5]Toufik Mansour, Mark Shattuck, Sherry H. F. Yan:
Counting Subwords in a Partition of a Set. Electron. J. Comb. 17(1) (2010) - [j4]Mark Shattuck:
Recounting the Number of Rises, Levels, and Descents in Finite Set Partitions. Integers 10: A13 (2010)
2000 – 2009
- 2009
- [j3]Mark Shattuck:
Recounting Relations for Set Partitions with Restrictions. Ars Comb. 91 (2009) - 2006
- [j2]Mark A. Shattuck, Carl G. Wagner:
A New Statistic on Linear and Circular r-Mino Arrangements. Electron. J. Comb. 13(1) (2006) - 2005
- [j1]Mark A. Shattuck, Carl G. Wagner:
Parity Theorems for Statistics on Domino Arrangements. Electron. J. Comb. 12 (2005)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint