Ändra sökning
Avgränsa sökresultatet
1 - 18 av 18
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aas, Erik
    et al.
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    A product formula for the TASEP on a ring2016Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 48, nr 2, s. 247-259Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    For a random permutation sampled from the stationary distributionof the TASEP on a ring, we show that, conditioned on the event that the rstentries are strictly larger than the last entries, the order of the rst entries isindependent of the order of the last entries. The proof uses multi-line queues asdened by Ferrari and Martin, and the theorem has an enumerative combinatorialinterpretation in that setting.As an application we prove a conjecture of Lam and Williams concerningSchubert factors of the stationary probability of certain states.Finally, we present a conjecture for the case where the small and large entriesare not separated.

  • 2. Enquist, Magnus
    et al.
    Strimling, Pontus
    Eriksson, Kimmo
    Laland, Kevin
    Sjöstrand, Jonas
    Mälardalens högskola.
    One cultural parent makes no culture2010Ingår i: Animal Behaviour, ISSN 0003-3472, E-ISSN 1095-8282, Vol. 79, nr 6, s. 1135-1162Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The ability to acquire knowledge and skills from others is widespread in animals and is commonly thought to be responsible for the behavioural traditions observed in many species. However, in spite of the extensive literature on theoretical analyses and empirical studies of social learning, little attention has been given to whether individuals acquire knowledge from a single individual or multiple models. Researchers commonly refer to instances of sons learning from fathers, or daughters from mothers, while theoreticians have constructed models of uniparental transmission, with little consideration of whether such restricted modes of transmission are actually feasible. We used mathematical models to demonstrate that the conditions under which learning from a single cultural parent can lead to stable culture are surprisingly restricted (the same reasoning applies to a single social-learning event). Conversely, we demonstrate how learning from more than one cultural parent can establish culture, and find that cultural traits will reach a nonzero equilibrium in the population provided the product of the fidelity of social learning and the number of cultural parents exceeds 1. We discuss the implications of the analysis for interpreting various findings in the animal social-learning literature, as well as the unique features of human culture.

  • 3. Eriksen, Niklas
    et al.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Equidistributed Statistics on Matchings and Permutations2014Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 21, nr 4, artikel-id P4.43Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We show that the bistatistic of right nestings and right crossings in matchings without left nestings is equidistributed with the number of occurrences of two certain patterns in permutations, and furthermore that this equidistribution holds when refined to positions of these statistics in matchings and permutations. For this distribution we obtain a non-commutative generating function which specializes to Zagier's generating function for the Fishburn numbers after abelianization. As a special case we obtain proofs of two conjectures of Claesson and Linusson. Finally, we conjecture that our results can be generalized to involving left crossings of matchings too.

  • 4. Eriksson, Kimmo
    et al.
    Jansson, Fredrik
    Sjöstrand, Jonas
    Stockholms universitet.
    Bentley's conjecture on popularity toplist turnover under random copying2010Ingår i: The Ramanujan journal, ISSN 1382-4090, E-ISSN 1572-9303, Vol. 23, s. 371-396Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Bentley et al studied the turnover rate in popularity toplists in a ’random copying’ model of cultural evolution. Based on simulations of a model with population size N, list length ℓ and invention rate μ, they conjectured a remarkably simple formula for the turnover rate: ℓ√μ. Here we study an overlapping generations version of the random copying model, which can be interpreted as a random walk on the integer partitions of the population size. In this model we show that the conjectured formula, after a slight correction, holds asymptotically.

  • 5.
    Eriksson, Kimmo
    et al.
    Malardalen Univ, Sch Educ Culture & Commun, Box 883, S-72123 Vasteras, Sweden..
    Jonsson, Markus
    Malardalen Univ, Sch Educ Culture & Commun, Box 883, S-72123 Vasteras, Sweden..
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Markov Chains on Graded Posets Compatibility of Up-Directed and Down-Directed Transition Probabilities2018Ingår i: Order, ISSN 0167-8094, E-ISSN 1572-9273, Vol. 35, nr 1, s. 93-109Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider two types of discrete-time Markov chains where the state space is a graded poset and the transitions are taken along the covering relations in the poset. The first type of Markov chain goes only in one direction, either up or down in the poset (an up chain or down chain). The second type toggles between two adjacent rank levels (an up-and-down chain). We introduce two compatibility concepts between the up-directed transition probabilities (an up rule) and the down-directed (a down rule), and we relate these to compatibility between up-and-down chains. This framework is used to prove a conjecture about a limit shape for a process on Young's lattice. Finally, we settle the questions whether the reverse of an up chain is a down chain for some down rule and whether there exists an up or down chain at all if the rank function is not bounded.

  • 6.
    Eriksson, Kimmo
    et al.
    Mälardalen University, School of Education, Culture and Communication.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Limiting shapes of birth-and-death processes on Young diagrams2012Ingår i: Advances in Applied Mathematics, ISSN 0196-8858, E-ISSN 1090-2074, Vol. 48, nr 4, s. 575-602Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider a family of birth processes and birth-and-death processes on Young diagrams of integer partitions of n. This family incorporates three famous models from very different fields: Rost's totally asymmetric particle model (in discrete time), Simon's urban growth model, and Moran's infinite alleles model. We study stationary distributions and limit shapes as n tends to infinity, and present a number of results and conjectures.

  • 7. Eriksson, Kimmo
    et al.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    On two theorems of Quinzii and rent controlled housing allocation in Sweden2007Ingår i: International Journal of Game Theory, ISSN 0020-7276, E-ISSN 1432-1270, Vol. 3, nr 9, s. 515-526Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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 people act according to utility functions that are both discontinuous and locally decreasing in money. We discuss Quinzii's theorem for the nonemptiness of the core of generalized house-swapping games, and show how it can be extended to cover the Swedish game. In a second part, we show how this theorem of Quinzii and her second theorem on nonemptiness of the core in two-sided models are both special cases of a more general theorem.

  • 8. Eriksson, Kimmo
    et al.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Strimling, Pontus
    Asymmetric equilibria in dynamic two-sided matching markets with independent preferences2008Ingår i: International Journal of Game Theory, ISSN 0020-7276, E-ISSN 1432-1270, Vol. 36, nr 3-4, s. 421-440Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A fundamental fact in two-sided matching is that if a market allows several stable outcomes, then one is optimal for all men in the sense that no man would prefer another stable outcome. We study a related phenomenon of asymmetric equilibria in a dynamic market where agents enter and search for a mate for at most n rounds before exiting again. Assuming independent preferences, we find that this game has multiple equilibria, some of which are highly asymmetric between sexes. We also investigate how the set of equilibria depends on a sex difference in the outside option of not being mated at all.

  • 9.
    Eriksson, Kimmo
    et al.
    Malardalen Univ, Dept Math & Phys.
    Sjöstrand, Jonas
    Malardalen Univ, Dept Math & Phys.
    Strimling, Pontus
    Malardalen Univ, Dept Math & Phys.
    Optimal expected rank in a two-sided secretary problem2007Ingår i: Operations Research, ISSN 0030-364X, E-ISSN 1526-5463, Vol. 55, nr 5, s. 921-931Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In a two-sided version of the famous secretary problem, employers search for a secretary at the same time as secretaries search for an employer. Nobody accepts being put on hold, and nobody is willing to take part in more than N interviews. Preferences are independent, and agents seek to optimize the expected rank of the partner they obtain among the N potential partners. We find that in any subgame perfect equilibrium, the expected rank grows as the square root of N (whereas it tends to a constant in the original secretary problem). We also compute how much agents can gain by cooperation.

  • 10. Eriksson, Kirnmo
    et al.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Strimling, Pontus
    Three-dimensional stable matching with cyclic preferences2006Ingår i: Mathematical Social Sciences, ISSN 0165-4896, E-ISSN 1879-3118, Vol. 52, nr 1, s. 77-87Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We consider stable three-dimensional matchings of three genders (3GSM). Alkan [Alkan, A., 1988. Nonexistence of stable threesome matchings. Mathematical Social Sciences 16, 207-209] showed that not all instances of 3GSM allow stable matchings. Boros et al. [Boros, E., Gurvich, V, Jaslar, S., Krasner, D., 2004. Stable matchings in three-sided systems with cyclic preferences. Discrete Mathematics 286, 1-10] showed that if preferences are cyclic, and the number of agents is limited to three of each gender, then a stable matching always exists. Here we extend this result to four agents of each gender. We also show that a number of well-known sufficient conditions for stability do not apply to cyclic 3GSM. Based on computer search, we formulate a conjecture on stability of "strongest link" 3GSM, which would imply stability of cyclic 3GSM.

  • 11.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Bruhat intervals as rooks on skew Ferrers boards2007Ingår i: Journal of combinatorial theory. Series A (Print), ISSN 0097-3165, E-ISSN 1096-0899, Vol. 114, nr 7, s. 1182-1198Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We characterise the permutations pi such that the elements in the closed lower Bruhat interval [id, pi] of the symmetric group correspond to non-taking rook configurations on a skew Ferrers board. It turns out that these are exactly the permutations pi such that [id, pi] corresponds to a flag manifold defined by inclusions, studied by Gasharov and Reiner.Our characterisation connect, the Poincare polynomials (rank-generating function) of Bruhat intervals with q-rook polynomials, and we are able to compute the Poincare polynomial of some particularly interesting intervals in the finite Weyl groups An and B, The expressions involve q-Stirling numbers of the second kind, and for the group A, putting q = 1 yields the poly-Bernoulli numbers defined by Kaneko.

  • 12.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Cylindrical lattice walks and the Loehr-Warrington 10(n) conjecture2007Ingår i: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 28, nr 3, s. 774-780Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    There are 10(n) zero-sum words of length 5n in the alphabet {+3, -2} such that no zero-sum consecutive subword that starts with +3 may be followed immediately by -2.

    We give a simple bijective proof of the conjecture in its original and more general setting. To do this we reformulate the problem in terms of cylindrical lattice walks.

  • 13.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    Enumerative combinatorics related to partition shapes2007Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [sv]

    Ämnet för denna avhandling är enumerativ kombinatorik tillämpad på tre olika objekt med anknytning till partitionsformer, nämligen tablåer, begränsade ord och bruhatintervall. Dom viktigaste vetenskapliga bidragen är följande.

    Artikel I: Låt tecknet av en standardtablå vara tecknet hos permutationen man får om man läser tablån rad för rad från vänster till höger, som en bok. En förmodan av Richard Stanley säjer att teckensumman av alla standardtablåer med n rutor är 2^[n/2]. Vi visar en generalisering av denna förmodan med hjälp av Robinson-Schensted-korrespondensen och ett nytt begrepp som vi kallar schacktablåer. Beviset bygger på ett anmärkningsvärt enkelt samband mellan tecknet hos en permutation pi och tecknen hos dess RS-motsvarande tablåer P och Q, nämligen sgn(pi)=(-1)^v sgn(P)sgn(Q), där v är antalet disjunkta vertikala dominobrickor som får plats i partitionsformen hos P och Q. Teckenobalansen hos en partitionsform definieras som teckensumman av alla standardtablåer av den formen. Som en ytterligare tillämpning av formeln för teckenöverföring ovan bevisar vi också en starkare variant av en annan förmodan av Stanley som handlar om viktade summor av kvadrerade teckenobalanser.

    Artikel II: Vi generaliserar några av resultaten i artikel I till skeva tablåer. Närmare bestämt undersöker vi hur teckenegenskapen överförs av Sagan och Stanleys skeva Robinson-Schensted-korrespondens. Resultatet är en förvånansvärt enkel generalisering av den vanliga ickeskeva formeln ovan. Som en tillämpning visar vi att vissa viktade summor av kvadrerade teckenobalanser blir noll, vilket leder till en generalisering av en variant av Stanleys andra förmodan.

    Artikel III: Följande specialfall av en förmodan av Loehr och Warrington bevisades av Ekhad, Vatter och Zeilberger: Det finns 10^n ord med summan noll av längd 5n i alfabetet {+3,-2} sådana att inget sammanhängande delord börjar med +3, slutar med -2 och har summan -2. Vi ger ett enkelt bevis för denna förmodan i dess ursprungliga allmännare utförande där 3 och 2 byts ut mot vilka som helst relativt prima positiva heltal a och b, 10^n byts ut mot ((a+b) över a)^n och 5n mot (a+b)n. För att göra detta formulerar vi problemet i termer av cylindriska latticestigar som kan tolkas som den sydöstra gränslinjen för vissa partitionsformer.

    Artikel IV: Vi karakteriserar dom permutationer pi sådana att elementen i det slutna bruhatintervallet [id,pi] i symmetriska gruppen motsvarar ickeslående tornplaceringar på ett skevt ferrersbräde. Dessa intervall visar sej vara precis dom vars flaggmångfalder är definierade av inklusioner, ett begrepp introducerat av Gasharov och Reiner. Karakteriseringen skapar en länk mellan poincarépolynom (ranggenererande funktioner) för bruhatintervall och q-tornpolynom, och vi kan beräkna poincarépolynomet för några särskilt intressanta intervall i dom ändliga weylgrupperna A_n och B_n. Uttrycken innehåller q-stirlingtal av andra sorten, och sätter man q=1 för grupp A_n så får man Kanekos poly-bernoullital.

  • 14.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.), Matematik (Avd.).
    Expected length of a product of random reflections2012Ingår i: Proceedings of the American Mathematical Society, ISSN 0002-9939, E-ISSN 1088-6826, Vol. 140, nr 12, s. 4369-4380Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We present a simple formula for the expected number of inversions in a permutation of size n obtained by applying t random (not necessarily adjacent) transpositions to the identity permutation. More generally, for any finite irreducible Coxeter group belonging to one of the infinite families (type A, B, D, and I), an exact expression is obtained for the expected length of a product of t random reflections.

  • 15.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    On the sign-imbalance of partition shapes2005Ingår i: Journal of combinatorial theory. Series A (Print), ISSN 0097-3165, E-ISSN 1096-0899, Vol. 111, nr 2, s. 190-203Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2([n/2]). We present a stronger theorem with a purely combinatorial proof using the Robinson-Schensted correspondence and a new concept called chess tableaux. We also prove a sharpening of another conjecture by Stanley concerning weighted sums of squares of sign-imbalances. The proof is built on a remarkably simple relation between the sign of a permutation and the signs of its RS-corresponding tableaux.

  • 16.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    On the sign-imbalance of skew partition shapes2007Ingår i: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 28, nr 6, s. 1582-1594Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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 transferred by the skew Robinson-Schensted correspondence invented by Sagan and Stanley. The result is a remarkably simple generalization of the ordinary non-skew formula.The sum of the signs of all standard tableaux on a given skew shape is the sign-imbalance of that shape. We generalize previous results on the sign-imbalance of ordinary partition shapes to skew ones.

  • 17.
    Sjöstrand, Jonas
    KTH, Skolan för teknikvetenskap (SCI), Matematik (Inst.).
    The cover pebbling theorem2005Ingår i: The Electronic Journal of Combinatorics, ISSN 1097-1440, E-ISSN 1077-8926, Vol. 12, nr 1, s. N22-Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a cover pebbling starting with all pebbles on one node is trivial to compute and it was conjectured that the maximum of these simple cover pebbling numbers is indeed the general cover pebbling number of the graph. That is, for any configuration of this size, there exists a cover pebbling. In this note, we prove a generalization of the conjecture. All previously published results about cover pebbling numbers for special graphs (trees, hypercubes et cetera) are direct consequences of this theorem. We also prove that the cover pebbling number of a product of two graphs equals the product of the cover pebbling numbers of the graphs.

  • 18. Strimling, Pontus
    et al.
    Sjöstrand, Jonas
    Centre for the Study of Cultural Evolution, Stockholm University.
    Accumulation of independent cultural traits2009Ingår i: Theoretical Population Biology, ISSN 0040-5809, E-ISSN 1096-0325, Vol. 76, nr 2, s. 77-83Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In a species capable of (imperfect) social learning, how much culture can a population of a given size carry? And what is the relationship between the individual and the population? In the first study of these novel questions, here we develop a mathematical model of the accumulation of independent cultural traits in a finite population with overlapping generations.

1 - 18 av 18
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf