The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
From MaRDI portal
Publication:6097068
DOI10.54550/eca2023v3s1h1zbMath1512.05002MaRDI QIDQ6097068
Publication date: 12 June 2023
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An involution on \(\beta (1,0)\)-trees
- Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture
- On the Möbius function of permutations with one descent
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- On the inverse image of pattern classes under bubble sort
- Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns
- A spectral approach to consecutive pattern-avoiding permutations
- Decomposing labeled interval orders as pairs of permutations
- Growth rates of geometric grid classes of permutations
- Intervals of permutations with a fixed number of descents are shellable
- Partition and composition matrices
- Composition matrices, \((2+2)\)-free posets and their specializations
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Crucial words and the complexity of some extremal problems for sets of prohibited words
- Structure of \(K\)-interval exchange transformations: induction, trajectories, and distance theorems
- Patterns in permutations and words.
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- The Möbius function of separable and decomposable permutations
- Permutations sortable by \(n - 4\) passes through a stack
- New Euler-Mahonian statistics on permutations and words
- Descent polynomials for permutations with bounded drop size
- Describing West-3-stack-sortable permutations with permutation patterns
- Permutation tableaux and permutation patterns
- Words and graphs
- Semi-transitive orientations and word-representable graphs
- Word problem of the Perkins semigroup via directed acyclic graphs.
- Ascent sequences and upper triangular matrices containing non-negative integers
- Balance and abelian complexity of the Tribonacci word
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Palindromic richness
- Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
- A permutation group determined by an ordered set
- Partially ordered generalized patterns and \(k\)-ary words
- Pattern avoidance in permutations: Linear and cyclic orders
- Generalized permutation patterns and a classification of the Mahonian statistics
- EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model
- On the Möbius function and topology of general pattern posets
- Decomposing recurrent states of the Abelian sandpile model
- Enumerative \(g\)-theorems for the Veronese construction for formal power series and graded algebras
- Enumerative properties of Ferrers graphs
- On operators on polynomials preserving real-rootedness and the Neggers-Stanley conjecture
- Sign-graded posets, unimodality of {\(W\)}-polynomials and the {C}harney-{D}avis conjecture
- Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials
- Multi-avoidance of generalised patterns
- Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
- The problem of the pawns
- Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a \(q,t\)-Narayana polynomial
- Independence of permutation limits at infinitely many scales
- The poset of mesh patterns
- Statistics on ordered partitions of sets
- A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate
- Counting independent sets in Riordan graphs
- A new characteristic property of rich words
- Riordan graphs I: structural properties
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees
- The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations
- On the topology of the permutation pattern poset
- A connection between palindromic and factor complexity using return words
- A formula for the Möbius function of the permutation poset based on a topological decomposition
- A comprehensive introduction to the theory of word-representable graphs
- 1324-avoiding permutations revisited
- Riordan graphs. II: Spectral properties
- Restricted non-separable planar maps and some pattern avoiding permutations
- On the number of self-dual rooted maps
- Partially ordered generalized patterns
- Classification of bijections between 321- and 132-avoiding permutations
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Permutations avoiding 1324 and patterns in Łukasiewicz paths
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Distribution modulo 1 and the lexicographic world
- Abelian complexity of minimal subshifts
- $n!$ matchings, $n!$ posets
- A direct encoding of Stoimenow's matchings as ascent sequences
- Euler–Mahonian Statistics on Ordered Set Partitions
- Directive words of episturmian words: equivalences and normalization
- Crucial Words for Abelian Powers
- Counterexamples to the Neggers-Stanley conjecture
- Permutations, Moments, Measures
- Eigenvalues and simplicity of interval exchange transformations
- An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations
- An involution on bicubic maps and \beta(0,1)-trees
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- Episturmian words: a survey
- Sorting and preimages of pattern classes
- On linear transformations preserving the Pólya frequency property
- On representable graphs
- The coloring ideal and coloring complex of a graph
- Generalized pattern avoidance