Available identifiers
zbMath Open dukes.markMaRDI QIDQ259177
List of research outcomes
| Publication | Date of Publication | Type |
|---|
| Difference ascent sequences | 2023-11-26 | Paper |
| A bump statistic on permutations resulting from the Robinson-Schensted correspondence | 2023-11-20 | Paper |
| Characterizing traces of processes defined by precedence and response constraints: an order theory approach | 2023-11-20 | Paper |
| An Ising model having permutation spin motivated by a permutation complexity measure | 2023-09-08 | Paper |
| Counting tournament score sequences | 2023-06-27 | Paper |
| Weak ascent sequences and related combinatorial structures | 2022-12-01 | Paper |
| Parallelogram polyominoes and rectangular EW-tableaux: Correspondences through the Sandpile model | 2022-07-26 | Paper |
| A maxdrop statistic for standard Young tableaux | 2022-03-17 | Paper |
| Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire | 2021-08-05 | Paper |
| The sandpile model on the complete split graph, Motzkin words, and tiered parking functions | 2021-02-22 | Paper |
| Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations | 2020-03-23 | Paper |
| The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations | 2019-08-30 | Paper |
| Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees | 2019-08-16 | Paper |
| Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations | 2019-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5377389 | 2019-05-24 | Paper |
| New equivalences for pattern avoiding involutions | 2018-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176569 | 2018-07-23 | Paper |
| Decomposing recurrent states of the Abelian sandpile model | 2018-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4591294 | 2017-11-14 | Paper |
| Decomposing recurrent states of the abelian sandpile model | 2017-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959955 | 2017-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2800765 | 2016-04-18 | Paper |
| Webs and posets | 2016-04-07 | Paper |
| Web matrices: structural properties and generating combinatorial identities | 2016-03-11 | Paper |
| Two operators on sandpile configurations, the sandpile model on the complete bipartite graph, and a cyclic lemma | 2015-12-23 | Paper |
| Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture | 2014-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5746162 | 2014-02-18 | Paper |
| Statistics on parallelogram polyominoes and a \(q,t\)-analogue of the Narayana numbers | 2014-01-31 | Paper |
| Web worlds, web-colouring matrices, and web-mixing matrices | 2013-11-29 | Paper |
| Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial | 2013-04-15 | Paper |
| On the inverse image of pattern classes under bubble sort | 2012-07-16 | Paper |
| Permutations sortable by \(n - 4\) passes through a stack | 2012-01-24 | Paper |
| A direct encoding of Stoimenow's matchings as ascent sequences | 2011-08-31 | Paper |
| Enumerating \((2 + 2)\)-free posets by indistinguishable elements | 2011-08-23 | Paper |
| Composition matrices, \((2+2)\)-free posets and their specializations | 2011-06-01 | Paper |
| Partition and composition matrices | 2011-05-03 | Paper |
| Descent polynomials for permutations with bounded drop size | 2010-10-18 | Paper |
| (2+2)-free posets, ascent sequences and pattern avoiding permutations | 2010-08-11 | Paper |
| Ascent sequences and upper triangular matrices containing non-negative integers | 2010-06-16 | Paper |
| The area above the Dyck path of a permutation | 2010-05-21 | Paper |
| Symmetric Schröder paths and restricted involutions | 2009-12-09 | Paper |
Research outcomes over time
Doctoral students
No records found.
Known relations from the MaRDI Knowledge Graph
This page was built for person: Mark Dukes
