6 citations · 6 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008
Enumeration of derangements with descents in prescribed positions
Niklas Eriksen, Ragnar Freij, Johan Wastlund
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result,…
math.CO2004
Completing a k-1 assignment
Svante Linusson, Johan Waestlund
We consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We gi…
math.CO2003★ 6 cited
A Proof of Parisi's Conjecture on the Random Assignment Problem
Svante Linusson, Johan Waestlund
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is m…