Sciweavers

DM
2007
83views more  DM 2007»
13 years 3 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
JDA
2008
67views more  JDA 2008»
13 years 3 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...
DM
2006
79views more  DM 2006»
13 years 3 months ago
Restricted even permutations and Chebyshev polynomials
We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In sever...
Toufik Mansour
COMBINATORICS
2006
100views more  COMBINATORICS 2006»
13 years 3 months ago
Grid Classes and the Fibonacci Dichotomy for Restricted Permutations
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof...
Sophie Huczynska, Vincent Vatter
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
13 years 3 months ago
Bounding the Number of Edges in Permutation Graphs
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...
Peter Keevash, Po-Shen Loh, Benny Sudakov
COMBINATORICS
2006
83views more  COMBINATORICS 2006»
13 years 3 months ago
A Permutation Regularity Lemma
We introduce a permutation analogue of the celebrated Szemer
Joshua N. Cooper
EOR
2008
85views more  EOR 2008»
13 years 3 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
EJC
2010
13 years 3 months ago
Packing sets of patterns
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we ...
Alexander Burstein, Peter Hästö
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
13 years 3 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
ICASSP
2010
IEEE
13 years 3 months ago
On the robustness of the multidimensional state coherence transform for solving the permutation problem of frequency-domain ICA
A common problem in frequency domain independent component analysis (ICA) is the so called permutation problem which arises due to the independent demixing in each frequency bin. ...
Benedikt Loesch, Francesco Nesta, Bin Yang