output
20022005
most citedSurface-enhanced Raman scattering and fluorescence near metal nanoparticles

316 citations

Showing math.COShow all

6 papers · 1 filter

math.CO2005

Permutation Tableaux and Permutation Patterns

Einar Steingrimsson, Lauren K. Williams

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguish…

math.CO2003

Finite automata and pattern avoidance in words

Petter Brändén, Toufik Mansour

We say that a word on a totally ordered alphabet avoids the word if there are no subsequences in order-equivalent to . In this paper we suggest a new approach to the…

math.CO2003

The problem of the pawns

S. Kitaev, T. Mansour

In this paper we study the number of ways to place nonattacking pawns on an chessboard. We find an upper bound for and analyse its asymptotic behavi…

math.CO2002

Restricted 132-alternating permutations and Chebyshev polynomials

T. Mansour

A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alt…

math.CO2002

Partially Ordered generalized patterns and k-ary words

S. Kitaev, T. Mansour

Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by…

math.CO20026 cited

There are no iterated morphisms that define the Arshon sequence and the -sequence

Sergey Kitaev

Berstel proved that the Arshon sequence cannot be obtained by iteration of a morphism. An alternative proof of this fact is given here. The -sequence was constructed by Evdokimo…