Search Results for:
inleder
19 March, 2021

The Complexity of Mental Integer Addition

 in: Journal of Numerical Cognition, Volume 6 (1).  AbstractAn important paradigm in modeling the complexity of mathematical tasks relies on computational complexity theory, in which complexity is measur

Type of publication: Journal articles |
Read more
11 July, 2019

Full Subgraphs

Journal of Graph theory 88, no 3, p.411-427. Abstract Let be a graph of density p on n vertices. Following Erdős, Łuczak, and Spencer, an m‐vertex subgraph H of G is called fullif H has minimum degree at lea. Let denote the order of a largest of G. If is a nonnegative integer, define

Type of publication: Journal articles | Markström, Klas , , Victor Falgas-Ravry & Jaques Verstraete
Read more
11 September, 2020

Speed and Concentration of the Covering Time for Structured Coupon Collectors

Journal of Applied Probability Abstract Let V be an n-set, and let X be a random variable taking values in the power-set of V. Suppose we are given a sequence of random coupons , where the are independe

Type of publication: Journal articles | Markström, Klas , , Falgas-Ravry, Victor & Larsson, Joel
Read more
01 January, 2011

A Weighted Configuration Model and Inhomogeneous Epidemics

2011. Journal of Statistics Physics 145:1368-1384. AbstractA random graph model with prescribed degree distribution and degree dependent edge weights is introduced. Each vertex is independently equipped

Type of publication: Journal articles |
Read more
11 July, 2019

Restricted completion of sparse partial Latin squares.

Combinatorics, Probability and Computing, 1-21. doi:10.1017/S096354831800055X, Cambridge University Press. Abstract An n × n partial Latin square P is called α-dense if each row and column has at most αnnon-emp times in . An × array where each cell contains a subset of {1,…, } is a (, ) -array if each symbol occurs at most times in each row and column and each cell contains a set of size at most . Combining the notions of completing partial Latin squares and avoiding arrays, we prove that there are constants , > 0 such that, for every positive integer , if is an -dense × partial Latin square, is an × -array, and no cell of contains a symbol that appears in the corresponding cell of , then there is a completion of that avoids ; that is, there is a Latin square that agrees with on every non-empty cell of , and, for each , satisfying 1 ≤ , ≤ , the symbol in position (, ) in does not appear in the corresponding cell of .

Type of publication: Journal articles | Markström, Klas , , L. Andrén & C. Casselgren
Read more
05 October, 2021
Modern Vikings in the East

Modern Vikings in the East. Sweden’s Role in 1990’s Russian Economic Reforms: Institutions, Elite Networks, and Informal Practices

What role did Swedish institutions, experts, and elites play in the economic and political development in post-Soviet Russia, with corruption, tax evasion and the emergence of the oligarchy as a result?

Read more