14 citations · 18 across the 4 of their papers we have counts for
4 papers
Avoiding 2-binomial squares and cubes
M. Rao, M. Rigo, P. Salimov
Two finite words are 2-binomially equivalent if, for all words of length at most 2, the number of occurrences of as a (scattered) subword of is equal to the numbe…
Restricted non-separable planar maps and some pattern avoiding permutations
Sergey Kitaev, Pavel Salimov, Christopher Severs +1
Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps are in bijection with West-2-stack-sortable permutations…
On the Representability of Line Graphs
Sergey Kitaev, Pavel Salimov, Christopher Severs +1
A graph G=(V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x,y) is in E for each x not equal to y. The m…
Infinite permutations of lowest maximal pattern complexity
S. V. Avgustinovich, A. E. Frid, T. Kamae +1
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some…