2 citations · 3 across the 7 of their papers we have counts for
7 papers
On the sign-imbalance of skew partition shapes
Jonas Sjostrand
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is t…
Optimal stopping in a two-sided secretary problem
Kimmo Eriksson, Jonas Sjostrand, Pontus Strimling
In the "secretary problem", well-known in the theory of optimal stopping, an employer is about to interview a maximum of N secretaries about which she has no prior information. Cho…
Note on the lamp lighting problem
Henrik Eriksson, Kimmo Eriksson, Jonas Sjostrand
We answer some questions concerning the so called sigma-game of Sutner. It is played on a graph where each vertex has a lamp, the light of which is toggled by pressing any vertex w…
Exact expectations for random graphs and assignments
Henrik Eriksson, Kimmo Eriksson, Jonas Sjostrand
For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and…
Expected number of inversions after a sequence of random adjacent transpositions
Henrik Eriksson, Kimmo Eriksson, Jonas Sjostrand
In the evolution of a genome, the gene sequence is sometimes rearranged, for example by transposition of two adjacent gene blocks. In biocombinatorics, one tries to reconstruct the…
Conjectures on three-dimensional stable matching
Kimmo Eriksson, Jonas Sjostrand, Pontus Strimling
We consider stable three-dimensional matchings of three categories of agents, such as women, men and dogs. This was suggested long ago by Knuth (1976), but very little seems to hav…