Carla D. Savage, Bme Mireille Bousquet-mélou, Kimmo Eriksson, Lecture Hall, Bme Mireille Bousquet-mélou, Kimmo Eriksson, ...
combinatorics of ℓ-sequences,
Words with intervening neighbours in infinite Coxeter groups are reduced (2008)
Eriksson, Henrik, Eriksson, Kimmo
Consider a graph with vertex set S. A word in the alphabet S has the intervening neighbours property if any two occurrences of the same letter are separated by all its graph neighbours. For a Coxeter...
The numbers game and Dynkin diagram classification results (2008)
Donnelly, Robert G., Eriksson, Kimmo
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the...
Statistical and Combinatorial Aspects of Comparative Genomics* (2008)
ABSTRACT. This document presents a survey of the statistical and combinatorial aspects of four areas of comparative genomics: gene order based measures of evolutionary distances between species,...
Are Anders Björner, Henrik Eriksson, Kimmo Eriksson, Olle Heden, Johan Karl, Lars Svensson, ...
representations. 2. Subspace arrangements: Arrangements (hyperplanes and the general case); Intersection lattice (in particular partitions with forbidden block sizes); “k-equal ” arrangements of...
Instability of matchings in decentralized (2008)
Kimmo Eriksson, Olle Häggström, Kimmo Eriksson, Olle Häggström
(will be inserted by the editor)
Instability of matchings in decentralized (2008)
Kimmo Eriksson, Olle Häggström, Kimmo Eriksson, Olle Häggström
(will be inserted by the editor)
A stratification of Fl(n)^d indexed by permutation arrays (2008)
Kimmo Eriksson, Svante Linusson
this paper. Combinatorially, we define a class of hyper-cubic (shape n
A Decomposition Of ... Indexed By Permutation Arrays (2007)
Kimmo Eriksson, Svante Linusson
. We study a decomposition of F`(n) d\Gamma1 , where F`(n) denotes the flag manifold over C n . The strata are defined by the dimensions of intersections of one space from each flag, so for d equals...
Kimmo Eriksson, Svante Linusson
of several flags and a generalization of permutation matrices to higher dimensions
Mireille Bousquet-m Elou, Kimmo Eriksson
For n 1, let Ln be the set of lecture hall partitions of length n, that is, the set of n-tuples of integers = ( 1; : : : ; n) satisfying 0 1
Lecture hall partitions 2 (2007)
For a non-decreasing integer sequence a = (a 1; : : : ; an) we define L a to be the set of n-tuples of integers = ( 1; : : : ; n) satisfying 0 1
Mireille Bousquet-m Elou, Kimmo Eriksson
For n 1, let Ln be the set of lecture hall partitions of length n, that is, the set of n-tuples of integers = ( 1; : : : ; n) satisfying 0 1
Doron Zeilberger, David Bressoud, Gaurav Bhatnagar, Anders Bjorner, Jonathan Borwein, Francesco Brenti, ...
Two stones build two houses. Three build six houses. Four build four and twenty houses. Five build hundred and twenty houses. Six build Seven hundreds and twenty houses. Seven build five thousands...
Deception and price in a market with asymmetric information (2007)
In markets with asymmetric information, only sellers have knowledge about the quality of goods. Sellers may of course make a declaration of the quality, but unless there are sanctions imposed on...
Expected number of inversions after a sequence of random adjacent transpositions (2004)
Eriksson, Henrik, Eriksson, Kimmo, Sjostrand, Jonas
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 these rearrangement...
Exact expectations for random graphs and assignments (2004)
Eriksson, Henrik, Eriksson, Kimmo, Sjostrand, Jonas
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 the expected...
Note on the lamp lighting problem (2004)
Eriksson, Henrik, Eriksson, Kimmo, Sjostrand, Jonas
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 with an edge...
Optimal stopping in a two-sided secretary problem (2004)
Eriksson, Kimmo, Sjostrand, Jonas, Strimling, Pontus
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. Chow et al. proved...
Conjectures on three-dimensional stable matching (2004)
Eriksson, Kimmo, Sjostrand, Jonas, Strimling, Pontus
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 have been published on...
Dense packing of patterns in a permutation (2002)
Henrik Eriksson, Kimmo Eriksson, Svante Linusson, Johan, W Ästlund
Abstract. We study the length Lk of the shortest permutation containing all patterns of length k. We establish the bounds e −2 k 2 < Lk ≤ (2/3 + o(1))k 2. We also prove that as k → ∞,...
Diagonal checker-jumping and Eulerian numbers for colorsigned permutations, Electron (2001)
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particular, we prove an...
Diagonal checker-jumping and Eulerian numbers for colorsigned permutations, Electron (2001)
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particular, we prove an...
Daniel A. Dalevi, Niklas Eriksen, Kimmo Eriksson, Siv G. E. Andersson
Abstract. We have studied the relative contribution of inversions, transpositions, deletions, and nucleotide substitutions to the evolution of Chlamydia trachomatis and Chlamydia pneumoniae. The...
Stable matching in a common generalization of the marriage and assignment models (1998)
Eriksson, Kimmo, Karlander, Johan
In the theory of two-sided matching markets there are two well-known models: the marriage model (where no money is involved) and the assignment model (where payments are involved). Roth and Sotomayor...
Affine Weyl groups as infinite permutations (1998)
Henrik Eriksson, Kimmo Eriksson
We present a unified theory for permutation models of all the infinite families of finite and affine Weyl groups, including interpretations of the length function and the weak order. We also give new...
Affine Weyl groups as infinite permutations (1998)
Henrik Eriksson, Kimmo Eriksson
We present a unified theory for permutation models of all the infinite families of finite and affine Weyl groups, including interpretations of the length function and the weak order. We also give new...
Lecture hall partitions (1997)
We prove a finite version of the well-known theorem that says that the number of partitions of an integer N into distinct parts is equal to the number of partitions of N into odd parts. Our version...
Combinatorics of Fulton's essential set (1996)
Kimmo Eriksson, Svante Linusson
Abstract. Fulton introduced the essential set of a permutation, together with a rank function. In this paper we study some combinatorial aspects of the essential set: We present an algorithm that...
Combinatorics of Fulton's essential set (1996)
Kimmo Eriksson, Svante Linusson
Abstract. Fulton introduced the essential set of a permutation, together with a rank function. In this paper we study some combinatorial aspects of the essential set: We present an algorithm that...
The size of Fulton's essential set (1995)
Kimmo Eriksson And, Kimmo Eriksson, Svante Linusson
The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the...
Proof Of The Alternating Sign Matrix Conjecture (1995)
Doron Zeilberger, Gert Almkvist, Noga Alon, George Andrews, Dror Bar-natan, Francois Bergeron, ...
: The number of n n matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved...
The size of Fulton's essential set (1995)
Kimmo Eriksson, Svante Linusson
The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the...
The size of Fulton's essential set (1995)
Kimmo Eriksson, Svante Linusson
The essential set of a permutation was defined by Fulton as the set of southeast corners of the diagram of the permutation. In this paper we determine explicit formulas for the average size of the...
Statistical and Combinatorial Aspects of Comparative Genomics
This document presents a survey of the statistical and combinatorial aspects of four areas of comparative genomics: gene order based measures of evolutionary distances between species, construction...
Hierarchical Assignments: Stability and Fairness
Eriksson, Kimmo, Karlander, Johan, Öller, Lars-Erik
We study a simple model of the job market, where workers are assigned to employers. We specify conditions under which the market is hierarchical in a natural sense. For such hierarchies, we can state...
Hierarchical Assignments: Stability and Fairness
Eriksson, Kimmo, Karlander, Johan, Öller, Lars-Erik
We study a simple assigning workers to employers, where each pair of a worker and an employer has a potential joint productivity, and the complete information about the market is contained in the...
Deception and price in a market with asymmetric information
In markets with asymmetric information, only sellers have knowledge about the quality of goods. Sellers may of course make a declaration of the quality, but unless there are sanctions imposed on...
ON TWO THEOREMS OF QUINZII AND RENT CONTROLLED HOUSING ALLOCATION IN SWEDEN
KIMMO ERIKSSON, JONAS SJÃSTRAND
The Swedish rent control system creates a white market for swapping rental contracts and a black market for selling rental contracts. Empirical data suggests that in this black-and-white market some...
Stable outcomes of the roommate game with transferable utility
Johan Karlander, Kimmo Eriksson
We consider the TU version of Gale and Shapley's roommate game. We find several results that are analogous to known results for the NTU game, such as a characterization of stable outcomes by...
Instability of matchings in decentralized markets with various preference structures
Kimmo Eriksson, Olle Häggström
Stable matching, Blocking pair, Instability, Preference structure, Decentralized market, Maximin matching,
Asymmetric equilibria in dynamic two-sided matching markets with independent preferences
Kimmo Eriksson, Jonas Sjöstrand, Pontus Strimling
Mutual mate choice, Strategic mating, Independent preferences, Equilibrium, Multiple equilibria, Asymmetric equilibria, Primary: 06A07, Secondary: 05E10,
Repeated learning makes cultural evolution unique
Strimling, Pontus, Enquist, Magnus, Eriksson, Kimmo
Although genetic information is acquired only once, cultural information can be both abandoned and reacquired during an individual's lifetime. Therefore, cultural evolution will be determined not...