The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068)

scientific article; zbMATH DE number 7694441

Language	Label	Description	Also known as
English	The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group	scientific article; zbMATH DE number 7694441

Statements

instance of

scholarly article

0 references

title

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (English)

0 references

author

Einar Steingrímsson

0 references

published in

Enumerative Combinatorics and Applications

0 references

publication date

12 June 2023

0 references

zbMATH Keywords

combinatorics

0 references

permutation patterns

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An Elementary Proof of Bevan's Theorem on the Growth of Grid Classes of Permutations

0 references

On the inverse image of pattern classes under bubble sort

0 references

Distribution modulo 1 and the lexicographic world

0 references

Generalized permutation patterns and a classification of the Mahonian statistics

0 references

Growth rates of geometric grid classes of permutations

0 references

Growth rates of permutation grid classes, tours on graphs, and the spectral radius

0 references

Permutations avoiding 1324 and patterns in Łukasiewicz paths

0 references

Independence of permutation limits at infinitely many scales

0 references

A structural characterisation of $\mathrm{Av}(1324)$ and new bounds on its growth rate

0 references

Permutations, Moments, Measures

0 references

(2+2)-free posets, ascent sequences and pattern avoiding permutations

0 references

Counterexamples to the Neggers-Stanley conjecture

0 references

On operators on polynomials preserving real-rootedness and the Neggers-Stanley conjecture

0 references

Sign-graded posets, unimodality of {$W$}-polynomials and the {C}harney-{D}avis conjecture

0 references

On linear transformations preserving the Pólya frequency property

0 references

Mesh patterns and the expansion of permutation statistics as sums of permutation patterns

0 references

A connection between palindromic and factor complexity using return words

0 references

A new characteristic property of rich words

0 references

The Möbius function of separable and decomposable permutations

0 references

AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY

0 references

Counting independent sets in Riordan graphs

0 references

Riordan graphs I: structural properties

0 references

Riordan graphs. II: Spectral properties

0 references

Descent polynomials for permutations with bounded drop size

0 references

Generalized pattern avoidance

0 references

A direct encoding of Stoimenow's matchings as ascent sequences

0 references

Partition and composition matrices

0 references

Permutations sortable by $n - 4$ passes through a stack

0 references

A permutation group determined by an ordered set

0 references

Decomposing labeled interval orders as pairs of permutations

0 references

Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

0 references

Classification of bijections between 321- and 132-avoiding permutations

0 references

An involution on bicubic maps and \beta(0,1)-trees

0 references

Decompositions and statistics for $\beta $(1,0)-trees and nonseparable permutations

0 references

An involution on $\beta (1,0)$-trees

0 references

Sorting and preimages of pattern classes

0 references

$n!$ matchings, $n!$ posets

0 references

Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations

0 references

Q3408831

0 references

New Euler-Mahonian statistics on permutations and words

0 references

1324-avoiding permutations revisited

0 references

Revstack sort, zigzag patterns, descent polynomials of $t$-revstack sortable permutations, and Steingrímsson's sorting conjecture

0 references

Composition matrices, $(2+2)$-free posets and their specializations

0 references

Enumerating $(2 + 2)$-free posets by indistinguishable elements

0 references

Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a $q,t$-Narayana polynomial

0 references

Ascent sequences and upper triangular matrices containing non-negative integers

0 references

Decomposing recurrent states of the Abelian sandpile model

0 references

The abelian sandpile model on Ferrers graphs -- a classification of recurrent configurations

0 references

Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees

0 references

Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials

0 references

A spectral approach to consecutive pattern-avoiding permutations

0 references

Enumerative properties of Ferrers graphs

0 references

Crucial words and the complexity of some extremal problems for sets of prohibited words

0 references

Structure of $K$-interval exchange transformations: induction, trajectories, and distance theorems

0 references

Eigenvalues and simplicity of interval exchange transformations

0 references

Crucial Words for Abelian Powers

0 references

Q5396747

0 references

Episturmian words: a survey

0 references

Palindromic richness

0 references

Directive words of episturmian words: equivalences and normalization

0 references

Semi-transitive orientations and word-representable graphs

0 references

Encoding labelled $p$-Riordan graphs by words and pattern-avoiding permutations

0 references

Euler–Mahonian Statistics on Ordered Set Partitions

0 references

Multi-avoidance of generalised patterns

0 references

Q4820793

0 references

Partially ordered generalized patterns

0 references

Patterns in permutations and words.

0 references

A comprehensive introduction to the theory of word-representable graphs

0 references

On the number of self-dual rooted maps

0 references

Words and graphs

0 references

Partially ordered generalized patterns and $k$-ary words

0 references

The problem of the pawns

0 references

0 references

0 references

0 references

0 references

On representable graphs

0 references

Enumerating $(\mathbf 2+\mathbf 2)$-free posets by the number of minimal elements and other statistics

0 references

Restricted non-separable planar maps and some pattern avoiding permutations

0 references

Word problem of the Perkins semigroup via directed acyclic graphs.

0 references

Enumerative $g$-theorems for the Veronese construction for formal power series and graded algebras

0 references

On the topology of the permutation pattern poset

0 references

Balance and abelian complexity of the Tribonacci word

0 references

Abelian complexity of minimal subshifts

0 references

EW-tableaux, Le-tableaux, tree-like tableaux and the abelian sandpile model

0 references

On the Möbius function of permutations with one descent

0 references

Intervals of permutations with a fixed number of descents are shellable

0 references

A formula for the Möbius function of the permutation poset based on a topological decomposition

0 references

On the Möbius function and topology of general pattern posets

0 references

The poset of mesh patterns

0 references

The coloring ideal and coloring complex of a graph

0 references

Statistics on ordered partitions of sets

0 references

Permutation tableaux and permutation patterns

0 references

Describing West-3-stack-sortable permutations with permutation patterns

0 references

Pattern avoidance in permutations: Linear and cyclic orders

0 references

Identifiers

zbMATH Open document ID

1512.05002

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

10.54550/ECA2023V3S1H1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6097068