uu.seUppsala University Publications

Please wait ... |

Refine search result

CiteExportLink to result list
http://uu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22organisationId%22%3A%221108%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_upper_j_idt1168_recordPermLink",{id:"formSmash:upper:j_idt1168:recordPermLink",widgetVar:"widget_formSmash_upper_j_idt1168_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt1168_j_idt1170",{id:"formSmash:upper:j_idt1168:j_idt1170",widgetVar:"widget_formSmash_upper_j_idt1168_j_idt1170",target:"formSmash:upper:j_idt1168:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1186",{id:"formSmash:upper:j_idt1186",widgetVar:"widget_formSmash_upper_j_idt1186",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1186",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1186",u:"formSmash:upper:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1197",{id:"formSmash:upper:j_idt1197",widgetVar:"widget_formSmash_upper_j_idt1197",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:upper:j_idt1197",e:"change",f:"formSmash",p:"formSmash:upper:j_idt1197",u:"formSmash:upper:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_upper_j_idt1207",{id:"formSmash:upper:j_idt1207",widgetVar:"widget_formSmash_upper_j_idt1207"});});

- html
- text
- asciidoc
- rtf

Rows per page

- 5
- 10
- 20
- 50
- 100
- 250

Sort

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)

- Standard (Relevance)
- Author A-Ö
- Author Ö-A
- Title A-Ö
- Title Ö-A
- Publication type A-Ö
- Publication type Ö-A
- Issued (Oldest first)
- Issued (Newest first)
- Created (Oldest first)
- Created (Newest first)
- Last updated (Oldest first)
- Last updated (Newest first)

Select

The maximal number of hits you can export is 250. When you want to export more records please use the 'Create feeds' function.

1. Aboud, Mathilde PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_0_j_idt1269",{id:"formSmash:items:resultList:0:j_idt1269",widgetVar:"widget_formSmash_items_resultList_0_j_idt1269",onLabel:"Aboud, Mathilde ",offLabel:"Aboud, Mathilde ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:0:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Philosophy of mathematics in “La Science et l’Hypothèse”, from Henri Poincaré.2017Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis2. Abouzaid, Mohammed PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1269",{id:"formSmash:items:resultList:1:j_idt1269",widgetVar:"widget_formSmash_items_resultList_1_j_idt1269",onLabel:"Abouzaid, Mohammed ",offLabel:"Abouzaid, Mohammed ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1272",{id:"formSmash:items:resultList:1:j_idt1272",widgetVar:"widget_formSmash_items_resultList_1_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Columbia Univ, Dept Math, New York, NY 10027 USA.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Kragh, ThomasUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:1:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the immersion classes of nearby Lagrangians2016In: Journal of Topology, ISSN 1753-8416, E-ISSN 1753-8424, Vol. 9, no 1, 232-244 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_1_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:1:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_1_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We show that the transfer map on Floer homotopy types associated to an exact Lagrangian embedding is an equivalence. This provides an obstruction to representing isotopy classes of Lagrangian immersions by Lagrangian embeddings, which, unlike previous obstructions, is sensitive to information that cannot be detected by Floer cochains. We show this by providing a concrete computation in the case of spheres.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:1:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 3. Abrahamsson, Linda PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_2_j_idt1269",{id:"formSmash:items:resultList:2:j_idt1269",widgetVar:"widget_formSmash_items_resultList_2_j_idt1269",onLabel:"Abrahamsson, Linda ",offLabel:"Abrahamsson, Linda ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:2:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Statistical models of breast cancer tumour growth for mammography screening data2012Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis4. Abramovic, A. et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1272",{id:"formSmash:items:resultList:3:j_idt1272",widgetVar:"widget_formSmash_items_resultList_3_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Pecaric, J.Persson, Lars-ErikUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Applied mathematics.Varosanec, S.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:3:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); General inequalities via isotonic subadditive functionals2007In: Mathematical Inequalities & Applications, ISSN 1331-4343, E-ISSN 1848-9966, Vol. 10, no 1, 15-28 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_3_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:3:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_3_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this manuscript a number of general inequalities for isotonic subadditive functionals on a set of positive mappings are proved and applied. In particular, it is pointed out that these inequalities both unify and generalize some general forms of the Hö̈lder, Popoviciu, Minkowski, Bellman and Power mean inequalities. Also some refinements of some of these results are proved.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:3:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 5. Aceto, Paolo PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1269",{id:"formSmash:items:resultList:4:j_idt1269",widgetVar:"widget_formSmash_items_resultList_4_j_idt1269",onLabel:"Aceto, Paolo ",offLabel:"Aceto, Paolo ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1272",{id:"formSmash:items:resultList:4:j_idt1272",widgetVar:"widget_formSmash_items_resultList_4_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Alfred Renyi Inst Math, 13-15 Realtanoda U, H-1053 Budapest, Hungary..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Golla, MarcoUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:4:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Dehn surgeries and rational homology2017In: Algebraic and Geometric Topology, ISSN 1472-2747, E-ISSN 1472-2739, Vol. 17, no 1, 487-527 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_4_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:4:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_4_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We consider the question of which Dehn surgeries along a given knot bound rational homology balls. We use Ozsvath and Szabo's correction terms in Heegaard Floer homology to obtain general constraints on the surgery coefficients. We then turn our attention to the case of integral surgeries, with particular emphasis on positive torus knots. Finally, combining these results with a lattice-theoretic obstruction based on Donaldson's theorem, we classify which integral surgeries along torus knots of the form Tkq 1; q bound rational homology balls.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:4:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 6. Aceto, Paolo PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1269",{id:"formSmash:items:resultList:5:j_idt1269",widgetVar:"widget_formSmash_items_resultList_5_j_idt1269",onLabel:"Aceto, Paolo ",offLabel:"Aceto, Paolo ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1272",{id:"formSmash:items:resultList:5:j_idt1272",widgetVar:"widget_formSmash_items_resultList_5_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Alfred Renyi Inst Math, Realtanoda Ut 13-15, H-1053 Budapest, Hungary..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Golla, MarcoUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.Larson, KyleMichigan State Univ, Dept Math, 619 Red Cedar Rd, E Lansing, MI 48824 USA..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:5:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Embedding 3-manifolds in spin 4-manifolds2017In: Journal of Topology, ISSN 1753-8416, E-ISSN 1753-8424, Vol. 10, no 2, 301-323 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_5_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:5:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_5_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An invariant of orientable 3-manifolds is defined by taking the minimum n such that a given 3-manifold embeds in the connected sum of n copies of S-2 x S-2, and we call this n the embedding number of the 3-manifold. We give some general properties of this invariant, and make calculations for families of lens spaces and Brieskorn spheres. We show how to construct rational and integral homology spheres whose embedding numbers grow arbitrarily large, and which can be calculated exactly if we assume the 11/8-Conjecture. In a different direction we show that any simply connected 4-manifold can be split along a rational homology sphere into a positive definite piece and a negative definite piece.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:5:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 7. Aczel, Peter et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_6_j_idt1272",{id:"formSmash:items:resultList:6:j_idt1272",widgetVar:"widget_formSmash_items_resultList_6_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Crosilla, LauraIshihara, HajimePalmgren, ErikUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Logic.Schuster, PeterPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:6:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Binary refinement implies discrete exponentiation2006In: Studia Logica, Vol. 84, 361-368 p.Article in journal (Refereed)8. Addario-Berry, Louigi et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1272",{id:"formSmash:items:resultList:7:j_idt1272",widgetVar:"widget_formSmash_items_resultList_7_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Devroye, LucJanson, SvanteUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:7:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees2013In: Annals of Probability, ISSN 0091-1798, E-ISSN 2168-894X, Vol. 41, no 2, 1072-1087 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_7_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:7:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_7_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study the height and width of a Galton-Watson tree with offspring distribution xi satisfying E xi = 1, 0 < Var xi < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the width (largest number of nodes in any level) and height (greatest level containing a node); the bounds are optimal up to constant factors in the exponent. Under the same conditioning, we also derive essentially optimal upper tail bounds for the number of nodes at level k, for 1 <= k <= n.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:7:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 9. Addario-Berry, Louigi et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1272",{id:"formSmash:items:resultList:8:j_idt1272",widgetVar:"widget_formSmash_items_resultList_8_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Janson, SvanteUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.McDiarmid, ColinPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:8:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On the Spread of Random Graphs2014In: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 23, no 4, 477-504 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_8_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:8:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_8_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distributed on V(G). We investigate the spread for certain models of sparse random graph, in particular for random regular graphs G(n,d), for Erdos-Renyi random graphs G(n,p) in the supercritical range p > 1/n, and for a `small world' model. For supercritical G(n,p), we show that if p = c/n with c > 1 fixed, then with high probability the spread of the giant component is bounded, and we prove corresponding statements for other models of random graphs, including a model with random edge lengths. We also give lower bounds on the spread for the barely supercritical case when p = (1 + o(1))/n. Further, we show that for d large, with high probability the spread of G(n, d) becomes arbitrarily close to that of the complete graph K-n.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:8:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 10. Adimurthi, et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1272",{id:"formSmash:items:resultList:9:j_idt1272",widgetVar:"widget_formSmash_items_resultList_9_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Marcos do O, JoaoTintarev, KyrilUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:9:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Cocompactness and minimizers for inequalities of Hardy-Sobolev type involving N-Laplacian2010In: NoDEA. Nonlinear differential equations and applications (Printed ed.), ISSN 1021-9722, E-ISSN 1420-9004, Vol. 17, no 4, 467-477 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_9_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:9:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_9_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The paper studies quasilinear elliptic problems in the Sobolev spaces W-1,W-p(Omega), Omega subset of R-N, with p = N, that is, the case of Pohozhaev-Trudinger-Moser inequality. Similarly to the case p < N where the loss of compactness in W-1,W-p(R-N) occurs due to dilation operators u bar right arrow t((N-p)/p)u(tx), t > 0, and can be accounted for in decompositions of the type of Struwe's "global compactness" and its later refinements, this paper presents a previously unknown group of isometric operators that leads to loss of compactness in W-0(1,N) over a ball in R-N. We give a one-parameter scale of Hardy-Sobolev functionals, a "p = N"-counterpart of the Holder interpolation scale, for p > N, between the Hardy functional integral vertical bar u vertical bar(p)/vertical bar x vertical bar(p) dx and the Sobolev functional integral vertical bar u vertical bar(pN/(N-mp)) dx. Like in the case p < N, these functionals are invariant with respect to the dilation operators above, and the respective concentration-compactness argument yields existence of minimizers for W-1,W-N-norms under Hardy-Sobolev constraints.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:9:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 11. Adimurthi, PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1269",{id:"formSmash:items:resultList:10:j_idt1269",widgetVar:"widget_formSmash_items_resultList_10_j_idt1269",onLabel:"Adimurthi, ",offLabel:"Adimurthi, ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1272",{id:"formSmash:items:resultList:10:j_idt1272",widgetVar:"widget_formSmash_items_resultList_10_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); TIFR CAM, PB 6503, Bangalore 560065, Karnataka, India.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tintarev, KyrilUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:10:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Defect of compactness in spaces of bounded variation2016In: Journal of Functional Analysis, ISSN 0022-1236, E-ISSN 1096-0783, Vol. 271, no 1, 37-48 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_10_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:10:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_10_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Defect of compactness for non-compact imbeddings of Banach spaces can be expressed in the form of a profile decomposition. Let X be a Banach space continuously imbedded into a Banach space Y, and let D be a group of linear isometric operators on X. A profile decomposition in X, relative to D and Y, for a bounded sequence (x(k))(k is an element of N) subset of X is a sequence (S-k)(k is an element of N), such that (x(k) - S-k)(k is an element of N) is a convergent sequence in Y, and, furthermore, S-k has the particular form S-k = Sigma(n is an element of N)g(k)((n))W((n)) with g(k)((n)) is an element of D and w((n)) is an element of X. This paper extends the profile decomposition proved by Solimini [10] for Sobolev spaces (H) over dot(1,P)(R-N) with 1 < p < N to the non-reflexive case p = 1. Since existence of "concentration profiles" w((n)) relies on weak-star compactness, and the space (H) over dot(1,1) is not a conjugate of a Banach space, we prove a corresponding result for a larger space of functions of bounded variation. The result extends also to spaces of bounded variation on Lie groups.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:10:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 12. Adimurthi, et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1272",{id:"formSmash:items:resultList:11:j_idt1272",widgetVar:"widget_formSmash_items_resultList_11_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tintarev, KyrilUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:11:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Hardy inequalities for weighted Dirac operator2010In: Annali di Matematica Pura ed Applicata, ISSN 0373-3114, E-ISSN 1618-1891, Vol. 189, no 2, 241-251 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_11_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:11:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_11_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); An inequality of Hardy type is established for quadratic forms involving Dirac operator and a weight r(-b) for functions in R-n. The exact Hardy constant c(b) = c(b) (n) is found and generalized minimizers are given. The constant cb vanishes on a countable set of b, which extends the known case n = 2, b = 0 which corresponds to the trivial Hardy inequality in R-2. Analogous inequalities are proved in the case c(b) = 0 under constraints and, with error terms, for a bounded domain.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:11:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 13. Adimurthi, et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1272",{id:"formSmash:items:resultList:12:j_idt1272",widgetVar:"widget_formSmash_items_resultList_12_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tintarev, KyrilUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:12:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On a version of Trudinger-Moser inequality with Möbius shift invariance2010In: Calculus of Variations and Partial Differential Equations, ISSN 0944-2669, E-ISSN 1432-0835, Vol. 39, no 1-2, 203-212 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_12_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:12:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_12_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The paper raises a question about the optimal critical nonlinearity for the Sobolev space in two dimensions, connected to loss of compactness, and discusses the pertinent concentration compactness framework. We study properties of the improved version of the Trudinger-Moser inequality on the open unit disk B subset of R-2, recently proved by Mancini and Sandeep [g], (Arxiv 0910.0971). Unlike the original Trudinger-Moser inequality, this inequality is invariant with respect to the Mobius automorphisms of the unit disk, and as such is a closer analogy of the critical nonlinearity integral |u|(2)* in the higher dimension than the original Trudinger-Moser nonlinearity.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:12:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 14. Adimurthi, no first name et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt1272",{id:"formSmash:items:resultList:13:j_idt1272",widgetVar:"widget_formSmash_items_resultList_13_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Tintarev, CyrilUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:13:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On compactness in the Trudinger-Moser inequality2014In: Annali della Scuola Normale Superiore di Pisa (Classe Scienze), Serie V, ISSN 0391-173X, E-ISSN 2036-2145, Vol. 13, no 2, 399-416 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_13_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:13:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_13_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We show that the Moser functional J(u) = integral Omega(e(4 pi u2) - 1) dx on the set B = {u is an element of H-0(1)(Omega) : parallel to del u parallel to(2) <= 1}, where Omega subset of R-2 is a bounded domain, fails to be weakly continuous only in the following exceptional case. Define g(s)w(r) = s(-1/2)w(r(s)) for s > 0. If u(k) -> u in B while lim inf J(u(k)) > J(u), then, with some s(k) -> 0, u(k) = g(sk) [(2 pi)(-1/2) min {1, log1/vertical bar x vertical bar}], up to translations and up to a remainder vanishing in the Sobolev norm. In other words, the weak continuity fails only on translations of concentrating Moser functions. The proof is based on a profile decomposition similar to that of Solimini [16], but with different concentration operators, pertinent to the two-dimensional case.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:13:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 15. Adle, Tobias PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt1269",{id:"formSmash:items:resultList:14:j_idt1269",widgetVar:"widget_formSmash_items_resultList_14_j_idt1269",onLabel:"Adle, Tobias ",offLabel:"Adle, Tobias ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:14:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Framtagning av metod för analys av livslängdsdata2017Independent thesis Basic level (professional degree), 10 credits / 15 HE creditsStudent thesisAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_14_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:14:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_14_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Husqvarna AB has as of today an extensive research and development department.This department serves to control the active product as well as the upcoming ones.The way that is done is through two different sets of tests. The first one being a longterm endurance test with aimed to unveil the durability of a product. Second and finalsort of test is a more one dimensional one. The aim is to determine different specificunits of interest like for example Newton (N).

Today the R&D department has a great knowledge within normal distributed data andsomewhat less when it comes to the opposite, so called none normal distributed data.When endurance is of interest the likelihood of that to be of the latter sort is morecommon than not. For now no complete method has been appointed to make iteasier to process a situation of this kind. Studying ever unique case individually, bylooking at the data, has been the way to go. This causes an inconsistency in theanalysis and makes it purely based on which individual that has done it. Lastly it mayalso, unintentionally, ignore the large picture of how a product has progressed.

To solve these problems this thesis work was put together to propose and conduct amethod. To form this method was an ongoing process throughout the whole thesisperiod. Ideas and thoughts were put forward to be reviewed and discussed. After aseries of tweaks to steer it towards the overall goal the method was finalized. Themethod that was put forward was firmly tested. Also a wide laboration in what themethod actually meant was done.

The result was a method to be applied on none normal distributed data. This methodhas three parts. The first being the report where everything is embraced. The secondpart is a short manual for an operator to use. Last part is an example where themethod is put to use.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:14:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 16. Agerholm, Troels et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt1272",{id:"formSmash:items:resultList:15:j_idt1272",widgetVar:"widget_formSmash_items_resultList_15_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Mazorchuk, VolodymyrUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra, Geometry and Logic.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:15:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On selfadjoint functors satisfying polynomial relations2011In: Journal of Algebra, ISSN 0021-8693, E-ISSN 1090-266X, Vol. 330, no 1, 448-467 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_15_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:15:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_15_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in particular, idempotents and square roots of a sum of identity functors. are classified. We also describe various natural constructions for new actions using external direct sums, external tensor products. Serre subcategories, quotients and centralizer subalgebras.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:15:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 17. Ahlberg, Daniel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt1269",{id:"formSmash:items:resultList:16:j_idt1269",widgetVar:"widget_formSmash_items_resultList_16_j_idt1269",onLabel:"Ahlberg, Daniel ",offLabel:"Ahlberg, Daniel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt1272",{id:"formSmash:items:resultList:16:j_idt1272",widgetVar:"widget_formSmash_items_resultList_16_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory. Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Griffiths, SimonUniv Oxford, Dept Stat, Oxford OX1 3TG, England..Morris, RobertIMPA, Rio De Janeiro, RJ, Brazil..Tassion, VincentUniv Geneva, Dept Math, Geneva, Switzerland..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:16:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Quenched Voronoi percolation2016In: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 286, 889-911 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_16_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:16:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_16_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We prove that the probability of crossing a large square in quenched Voronoi percolation converges to 1/2 at criticality, confirming a conjecture of Benjamini, Kalai and Schramm from 1999. The main new tools are a quenched version of the box-crossing property for Voronoi percolation at criticality, and an Efron Stein type bound on the variance of the probability of the crossing event in terms of the sum of the squares of the influences. As a corollary of the proof, we moreover obtain that the quenched crossing event at criticality is almost surely noise sensitive.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:16:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 18. Ahlberg, Peter PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_17_j_idt1269",{id:"formSmash:items:resultList:17:j_idt1269",widgetVar:"widget_formSmash_items_resultList_17_j_idt1269",onLabel:"Ahlberg, Peter ",offLabel:"Ahlberg, Peter ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:17:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Studier av mätdataregistrering för JAS 39 Gripen2002Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis19. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_18_j_idt1269",{id:"formSmash:items:resultList:18:j_idt1269",widgetVar:"widget_formSmash_items_resultList_18_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:18:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A zero-one law for*l*-colourable structures with a vectorspace pregeometry2012Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis20. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt1269",{id:"formSmash:items:resultList:19:j_idt1269",widgetVar:"widget_formSmash_items_resultList_19_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:19:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Combinatorial geometries in model theory2009Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAbstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_19_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:19:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_19_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Model theory and combinatorial pregeometries are closely related throughthe so called algebraic closure operator on strongly minimal sets. Thestudy of projective and ane pregeometries are especially interestingsince they have a close relation to vectorspaces. In this thesis we willsee how the relationship occur and how model theory can concludea very strong classi cation theorem which divides pregeometries withcertain properties into projective, ane and degenerate (trivial) cases.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:19:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 21. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt1269",{id:"formSmash:items:resultList:20:j_idt1269",widgetVar:"widget_formSmash_items_resultList_20_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:20:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Homogenizable structures and model completeness2016In: Archive for mathematical logic, ISSN 0933-5846, E-ISSN 1432-0665, Vol. 55, no 7-8, 977-995 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_20_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:20:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_20_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A homogenizable structure M is a structure where we may add a finite amount of new relational symbols to represent some 0-definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital for the relation between a structure and the amalgamation bases of its age and give a necessary and sufficient condition for an countably categorical model-complete structure to be homogenizable.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:20:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 22. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt1269",{id:"formSmash:items:resultList:21:j_idt1269",widgetVar:"widget_formSmash_items_resultList_21_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:21:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); >k-homogeneous infinite graphs2018In: Journal of combinatorial theory. Series B (Print), ISSN 0095-8956, E-ISSN 1096-0902, Vol. 128, 160-174 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_21_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:21:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_21_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this article we give an explicit classification for the countably infinite graphs G which are, for some

*k*, ≥*k*-homogeneous. It turns out that a ≥*k*-homogeneous graph M is non-homogeneous if and only if it is either not 1-homogeneous or not 2-homogeneous, both cases which may be classified using ramsey theory.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:21:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The full text will be freely available from 2019-09-05 16:29$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_21_j_idt1538_0_j_idt1541",{id:"formSmash:items:resultList:21:j_idt1538:0:j_idt1541",widgetVar:"widget_formSmash_items_resultList_21_j_idt1538_0_j_idt1541",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:21:j_idt1538:0:fullTextSvg"});}); 23. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt1269",{id:"formSmash:items:resultList:22:j_idt1269",widgetVar:"widget_formSmash_items_resultList_22_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:22:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limit Laws, Homogenizable Structures and Their Connections2018Doctoral thesis, comprehensive summary (Other academic)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:22:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_22_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); This thesis is in the field of mathematical logic and especially model theory. The thesis contain six papers where the common theme is the Rado graph R. Some of the interesting abstract properties of R are that it is simple, homogeneous (and thus countably categorical), has SU-rank 1 and trivial dependence. The Rado graph is possible to generate in a probabilistic way. If we let K be the set of all finite graphs then we obtain R as the structure which satisfy all properties which hold with assymptotic probability 1 in K. On the other hand, since the Rado graph is homogeneous, it is also possible to generate it as a Fraïssé-limit of its age.

Paper I studies the binary structures which are simple, countably categorical, with SU-rank 1 and trivial algebraic closure. The main theorem shows that these structures are all possible to generate using a similar probabilistic method which is used to generate the Rado graph. Paper II looks at the simple homogeneous structures in general and give certain technical results on the subsets of SU-rank 1.

Paper III considers the set K consisting of all colourable structures with a definable pregeometry and shows that there is a 0-1 law and almost surely a unique definable colouring. When generating the Rado graph we almost surely have only rigid structures in K. Paper IV studies what happens if the structures in K are only the non-rigid finite structures. We deduce that the limit structures essentially try to stay as rigid as possible, given the restriction, and that we in general get a limit law but not a 0-1 law.

Paper V looks at the Rado graph's close cousin the random t-partite graph and notices that this structure is not homogeneous but almost homogeneous. Rather we may just add a definable binary predicate, which hold for any two elemenets which are in the same part, in order to make it homogeneous. This property is called being homogenizable and in Paper V we do a general study of homogenizable structures. Paper VI conducts a special case study of the homogenizable graphs which are the closest to being homogeneous, providing an explicit classification of these graphs.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:22:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); List of papers PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_22_j_idt1311",{id:"formSmash:items:resultList:22:j_idt1311",widgetVar:"widget_formSmash_items_resultList_22_j_idt1311",onLabel:"List of papers",offLabel:"List of papers",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); 1. Simple structures axiomatized by almost sure theoriesOpen this publication in new window or tab >>Simple structures axiomatized by almost sure theories### Ahlman, Ove

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_0_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:0:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_0_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_0_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:0:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_0_overlay_otherAuthors",multiple:true}); 2016 (English)In: Annals of Pure and Applied Logic, ISSN 0168-0072, E-ISSN 1873-2461, Vol. 167, no 5, 435-456 p.Article in journal (Refereed) Published##### Abstract [en]

In this article we give a classification of the binary, simple,

*ω*-categorical structures with*SU*-rank 1 and trivial algebraic closure. This is done both by showing that they satisfy certain extension properties, but also by noting that they may be approximated by the almost sure theory of some sets of finite structures equipped with a probability measure. This study give results about general almost sure theories, but also considers certain attributes which, if they are almost surely true, generate almost sure theories with very specific properties such as*ω*-stability or strong minimality.##### Keyword

Random structure, Almost sure theory, Pregeometry, Supersimple, Countably categorical##### National Category

Algebra and Logic##### Research subject

Mathematics##### Identifiers

urn:nbn:se:uu:diva-276995 (URN)10.1016/j.apal.2016.02.001 (DOI)000372680500001 ()PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:0:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:0:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:0:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_0_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay908140",{id:"formSmash:items:resultList:22:j_idt1312:0:j_idt1316",widgetVar:"overlay908140",target:"formSmash:items:resultList:22:j_idt1312:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); 2. On sets with rank one in simple homogeneous structuresOpen this publication in new window or tab >>On sets with rank one in simple homogeneous structures### Ahlman, Ove

### Koponen, Vera

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_1_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:1:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_1_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_1_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:1:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_1_overlay_otherAuthors",multiple:true}); 2015 (English)In: Fundamenta Mathematicae, ISSN 0016-2736, E-ISSN 1730-6329, Vol. 228, 223-250 p.Article in journal (Refereed) Published##### Abstract [en]

We study definable sets D of SU-rank 1 in Meq, where M is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a 'canonically embedded structure', which inherits all relations on D which are definable in Meq, and has no other definable relations. Our results imply that if no relation symbol of the language of M has arity higher than 2, then there is a close relationship between triviality of dependence and D being a reduct of a binary random structure. Somewhat more precisely: (a) if for every n≥2, every n-type p(x1,...,xn) which is realized in D is determined by its sub-2-types q(xi,xj)⊆p, then the algebraic closure restricted to D is trivial; (b) if M has trivial dependence, then D is a reduct of a binary random structure.

##### Keyword

model theory, homogeneous structure, simple theory, pregeometry, rank, reduct, random structure##### National Category

Algebra and Logic##### Research subject

Mathematics##### Identifiers

urn:nbn:se:uu:diva-243006 (URN)10.4064/fm228-3-2 (DOI)000352858400002 ()PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:1:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:1:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:1:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_1_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay785724",{id:"formSmash:items:resultList:22:j_idt1312:1:j_idt1316",widgetVar:"overlay785724",target:"formSmash:items:resultList:22:j_idt1312:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); 3. Random l-colourable structures with a pregeometryOpen this publication in new window or tab >>Random l-colourable structures with a pregeometry### Ahlman, Ove

### Koponen, Vera

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_2_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:2:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_2_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_2_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:2:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_2_overlay_otherAuthors",multiple:true}); 2017 (English)In: Mathematical logic quarterly, ISSN 0942-5616, E-ISSN 1521-3870, Vol. 63, no 1-2, 32-58 p.Article in journal (Refereed) Published##### Abstract [en]

We study finite -colourable structures with an underlying pregeometry. The probability measure that is usedcorresponds to a process of generating such structures by which colours are first randomly assigned to all1-dimensional subspaces and then relationships are assigned in such a way that the colouring conditions aresatisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure,where we now forget the specific colouring of the generating process, has a given property. With this measurewe get the following results: (1) A zero-one law. (2) The set of sentences with asymptotic probability 1 has anexplicit axiomatisation which is presented. (3) There is a formula ξ (x, y) (not directly speaking about colours)such that, with asymptotic probability 1, the relation “there is an -colouring which assigns the same colourto x and y” is defined by ξ (x, y). (4) With asymptotic probability 1, an -colourable structure has a unique-colouring (up to permutation of the colours).

##### Place, publisher, year, edition, pages

Wiley-VCH Verlagsgesellschaft, 2017##### National Category

Algebra and Logic##### Research subject

Mathematical Logic##### Identifiers

urn:nbn:se:uu:diva-321515 (URN)10.1002/malq.201500006 (DOI)000400361900003 ()PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:2:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:2:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:2:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_2_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay1093452",{id:"formSmash:items:resultList:22:j_idt1312:2:j_idt1316",widgetVar:"overlay1093452",target:"formSmash:items:resultList:22:j_idt1312:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); 4. Limit laws and automorphism groups of random nonrigid structuresOpen this publication in new window or tab >>Limit laws and automorphism groups of random nonrigid structures### Ahlman, Ove

### Koponen, Vera

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_3_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:3:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_3_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_3_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:3:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_3_overlay_otherAuthors",multiple:true}); 2015 (English)In: Journal of Logic and Analysis, ISSN 1759-9008, E-ISSN 1759-9008, Vol. 7, no 2, 1-53 p., 1Article in journal (Refereed) Published##### Abstract [en]

A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the class of finite structures has a zero-one law are, in the present context, the first layer in a hierarchy of classes of finite structures with increasingly more complex automorphism groups. Such a hierarchy can be defined in more than one way. For example, the kth level of the hierarchy can consist of all structures having at least k elements which are moved by some automorphism. Or we can consider, for any finite group G, all finite structures M such that G is a subgroup of the group of automorphisms of M; in this case the "hierarchy" is a partial order. In both cases, as well as variants of them, each "level" satisfies a logical limit law, but not a zero-one law (unless k = 0 or G is trivial). Moreover, the number of (labelled or unlabelled) n-element structures in one place of the hierarchy divided by the number of n-element structures in another place always converges to a rational number or to infinity as n -> infinity. All instances of the respective result are proved by an essentially uniform argument.

##### Keyword

finite model theory, limit law, zero-one law, random structure, automorphism group##### National Category

Algebra and Logic##### Research subject

Mathematical Logic##### Identifiers

urn:nbn:se:uu:diva-248078 (URN)10.4115/jla.2015.7.2 (DOI)000359802400001 ()PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:3:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:3:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:3:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_3_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay798508",{id:"formSmash:items:resultList:22:j_idt1312:3:j_idt1316",widgetVar:"overlay798508",target:"formSmash:items:resultList:22:j_idt1312:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); 5. Homogenizable structures and model completenessOpen this publication in new window or tab >>Homogenizable structures and model completeness### Ahlman, Ove

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_4_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:4:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_4_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_4_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:4:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_4_overlay_otherAuthors",multiple:true}); 2016 (English)In: Archive for mathematical logic, ISSN 0933-5846, E-ISSN 1432-0665, Vol. 55, no 7-8, 977-995 p.Article in journal (Refereed) Published##### Abstract [en]

A homogenizable structure M is a structure where we may add a finite amount of new relational symbols to represent some 0-definable relations in order to make the structure homogeneous. In this article we will divide the homogenizable structures into different classes which categorize many known examples and show what makes each class important. We will show that model completeness is vital for the relation between a structure and the amalgamation bases of its age and give a necessary and sufficient condition for an countably categorical model-complete structure to be homogenizable.

##### Keyword

Homogenizable, Model-complete, Amalgamation class, Quantifier-elimination##### National Category

Algebra and Logic##### Research subject

Mathematics##### Identifiers

urn:nbn:se:uu:diva-303714 (URN)10.1007/s00153-016-0507-6 (DOI)000385155700010 ()PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:4:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:4:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:4:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_4_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay973821",{id:"formSmash:items:resultList:22:j_idt1312:4:j_idt1316",widgetVar:"overlay973821",target:"formSmash:items:resultList:22:j_idt1312:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); 6. >k-homogeneous infinite graphsOpen this publication in new window or tab >>>k-homogeneous infinite graphs### Ahlman, Ove

PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_5_overlay_some",{id:"formSmash:items:resultList:22:j_idt1312:5:overlay:some",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_5_overlay_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_5_overlay_otherAuthors",{id:"formSmash:items:resultList:22:j_idt1312:5:overlay:otherAuthors",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_5_overlay_otherAuthors",multiple:true}); 2018 (English)In: Journal of combinatorial theory. Series B (Print), ISSN 0095-8956, E-ISSN 1096-0902, Vol. 128, 160-174 p.Article in journal (Refereed) Published##### Abstract [en]

In this article we give an explicit classification for the countably infinite graphs G which are, for some

*k*, ≥*k*-homogeneous. It turns out that a ≥*k*-homogeneous graph M is non-homogeneous if and only if it is either not 1-homogeneous or not 2-homogeneous, both cases which may be classified using ramsey theory.##### Place, publisher, year, edition, pages

Elsevier, 2018##### Keyword

>k-homomogeneous, countably infinite graph##### National Category

Algebra and Logic##### Research subject

Mathematical Logic##### Identifiers

urn:nbn:se:uu:diva-329362 (URN)10.1016/j.jctb.2017.08.007 (DOI)PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1487",{id:"formSmash:items:resultList:22:j_idt1312:5:overlay:j_idt1487",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1487",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1493",{id:"formSmash:items:resultList:22:j_idt1312:5:overlay:j_idt1493",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1493",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1499",{id:"formSmash:items:resultList:22:j_idt1312:5:overlay:j_idt1499",widgetVar:"widget_formSmash_items_resultList_22_j_idt1312_5_overlay_j_idt1499",multiple:true}); $(function(){PrimeFaces.cw("OverlayPanel","overlay1144583",{id:"formSmash:items:resultList:22:j_idt1312:5:j_idt1316",widgetVar:"overlay1144583",target:"formSmash:items:resultList:22:j_idt1312:5:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});}); PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:22:partsPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 24. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt1269",{id:"formSmash:items:resultList:23:j_idt1269",widgetVar:"widget_formSmash_items_resultList_23_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:23:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Simple structures axiomatized by almost sure theories2016In: Annals of Pure and Applied Logic, ISSN 0168-0072, E-ISSN 1873-2461, Vol. 167, no 5, 435-456 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_23_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:23:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_23_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); In this article we give a classification of the binary, simple,

*ω*-categorical structures with*SU*-rank 1 and trivial algebraic closure. This is done both by showing that they satisfy certain extension properties, but also by noting that they may be approximated by the almost sure theory of some sets of finite structures equipped with a probability measure. This study give results about general almost sure theories, but also considers certain attributes which, if they are almost surely true, generate almost sure theories with very specific properties such as*ω*-stability or strong minimality.PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:23:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); The full text will be freely available from 2018-02-15 15:28$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_items_resultList_23_j_idt1538_0_j_idt1541",{id:"formSmash:items:resultList:23:j_idt1538:0:j_idt1541",widgetVar:"widget_formSmash_items_resultList_23_j_idt1538_0_j_idt1541",showEffect:"fade",hideEffect:"fade",target:"formSmash:items:resultList:23:j_idt1538:0:fullTextSvg"});}); 25. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_24_j_idt1269",{id:"formSmash:items:resultList:24:j_idt1269",widgetVar:"widget_formSmash_items_resultList_24_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:24:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); To infinity and back: Logical limit laws and almost sure theories2014Licentiate thesis, comprehensive summary (Other academic)26. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt1269",{id:"formSmash:items:resultList:25:j_idt1269",widgetVar:"widget_formSmash_items_resultList_25_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt1272",{id:"formSmash:items:resultList:25:j_idt1272",widgetVar:"widget_formSmash_items_resultList_25_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Koponen, VeraUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:25:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limit laws and automorphism groups of random nonrigid structures2015In: Journal of Logic and Analysis, ISSN 1759-9008, E-ISSN 1759-9008, Vol. 7, no 2, 1-53 p., 1Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_25_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:25:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_25_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the class of finite structures has a zero-one law are, in the present context, the first layer in a hierarchy of classes of finite structures with increasingly more complex automorphism groups. Such a hierarchy can be defined in more than one way. For example, the kth level of the hierarchy can consist of all structures having at least k elements which are moved by some automorphism. Or we can consider, for any finite group G, all finite structures M such that G is a subgroup of the group of automorphisms of M; in this case the "hierarchy" is a partial order. In both cases, as well as variants of them, each "level" satisfies a logical limit law, but not a zero-one law (unless k = 0 or G is trivial). Moreover, the number of (labelled or unlabelled) n-element structures in one place of the hierarchy divided by the number of n-element structures in another place always converges to a rational number or to infinity as n -> infinity. All instances of the respective result are proved by an essentially uniform argument.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:25:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 27. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt1269",{id:"formSmash:items:resultList:26:j_idt1269",widgetVar:"widget_formSmash_items_resultList_26_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt1272",{id:"formSmash:items:resultList:26:j_idt1272",widgetVar:"widget_formSmash_items_resultList_26_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Koponen, VeraUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:26:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On sets with rank one in simple homogeneous structures2015In: Fundamenta Mathematicae, ISSN 0016-2736, E-ISSN 1730-6329, Vol. 228, 223-250 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_26_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:26:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_26_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study definable sets D of SU-rank 1 in Meq, where M is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such D can be seen as a 'canonically embedded structure', which inherits all relations on D which are definable in Meq, and has no other definable relations. Our results imply that if no relation symbol of the language of M has arity higher than 2, then there is a close relationship between triviality of dependence and D being a reduct of a binary random structure. Somewhat more precisely: (a) if for every n≥2, every n-type p(x1,...,xn) which is realized in D is determined by its sub-2-types q(xi,xj)⊆p, then the algebraic closure restricted to D is trivial; (b) if M has trivial dependence, then D is a reduct of a binary random structure.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:26:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 28. Ahlman, Ove PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt1269",{id:"formSmash:items:resultList:27:j_idt1269",widgetVar:"widget_formSmash_items_resultList_27_j_idt1269",onLabel:"Ahlman, Ove ",offLabel:"Ahlman, Ove ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt1272",{id:"formSmash:items:resultList:27:j_idt1272",widgetVar:"widget_formSmash_items_resultList_27_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Koponen, VeraUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:27:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Random l-colourable structures with a pregeometry2017In: Mathematical logic quarterly, ISSN 0942-5616, E-ISSN 1521-3870, Vol. 63, no 1-2, 32-58 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_27_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:27:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_27_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study finite -colourable structures with an underlying pregeometry. The probability measure that is usedcorresponds to a process of generating such structures by which colours are first randomly assigned to all1-dimensional subspaces and then relationships are assigned in such a way that the colouring conditions aresatisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure,where we now forget the specific colouring of the generating process, has a given property. With this measurewe get the following results: (1) A zero-one law. (2) The set of sentences with asymptotic probability 1 has anexplicit axiomatisation which is presented. (3) There is a formula ξ (x, y) (not directly speaking about colours)such that, with asymptotic probability 1, the relation “there is an -colouring which assigns the same colourto x and y” is defined by ξ (x, y). (4) With asymptotic probability 1, an -colourable structure has a unique-colouring (up to permutation of the colours).

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:27:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 29. Ahlsén, Daniel PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_28_j_idt1269",{id:"formSmash:items:resultList:28:j_idt1269",widgetVar:"widget_formSmash_items_resultList_28_j_idt1269",onLabel:"Ahlsén, Daniel ",offLabel:"Ahlsén, Daniel ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:28:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Limitless Analysis2014Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis30. Ahmady Phoulady, Hady PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_29_j_idt1269",{id:"formSmash:items:resultList:29:j_idt1269",widgetVar:"widget_formSmash_items_resultList_29_j_idt1269",onLabel:"Ahmady Phoulady, Hady ",offLabel:"Ahmady Phoulady, Hady ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:29:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Brownian Motions and Scaling Limits of Random Trees2011Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis31. Ahmady Phoulady, Hady PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_30_j_idt1269",{id:"formSmash:items:resultList:30:j_idt1269",widgetVar:"widget_formSmash_items_resultList_30_j_idt1269",onLabel:"Ahmady Phoulady, Hady ",offLabel:"Ahmady Phoulady, Hady ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:30:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Monte Carlo Methods in American Put Option Pricing2011Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis32. Albahaca, Juan Carlos PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_31_j_idt1269",{id:"formSmash:items:resultList:31:j_idt1269",widgetVar:"widget_formSmash_items_resultList_31_j_idt1269",onLabel:"Albahaca, Juan Carlos ",offLabel:"Albahaca, Juan Carlos ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Applied Mathematics and Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:31:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Analytical and Numerical Study of the Poincaré Map with Applications on the Computation of Periodic Orbits2015Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis33. Aldberg, Henrik PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_32_j_idt1269",{id:"formSmash:items:resultList:32:j_idt1269",widgetVar:"widget_formSmash_items_resultList_32_j_idt1269",onLabel:"Aldberg, Henrik ",offLabel:"Aldberg, Henrik ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:32:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Bond Pricing in Stochastic Volatility Models2008Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis34. Aleksandrov, Alexei B. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt1269",{id:"formSmash:items:resultList:33:j_idt1269",widgetVar:"widget_formSmash_items_resultList_33_j_idt1269",onLabel:"Aleksandrov, Alexei B. ",offLabel:"Aleksandrov, Alexei B. ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_33_j_idt1272",{id:"formSmash:items:resultList:33:j_idt1272",widgetVar:"widget_formSmash_items_resultList_33_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Janson, SvantePeller, Vladimir V.Rochberg, RichardPrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:33:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); An interesting class of operators with unusual Schatten-von Neumann behavior2002In: Function Spaces, Interpolation Theory and Related Topics (Proceedings of the International Conference in honour of Jaak Peetre on his 65th birthday, Lund 2000), 61-150 p.Article in journal (Refereed)35. Alexandrov A.B., Janson PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt1269",{id:"formSmash:items:resultList:34:j_idt1269",widgetVar:"widget_formSmash_items_resultList_34_j_idt1269",onLabel:"Alexandrov A.B., Janson ",offLabel:"Alexandrov A.B., Janson ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_34_j_idt1272",{id:"formSmash:items:resultList:34:j_idt1272",widgetVar:"widget_formSmash_items_resultList_34_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); S., Peller V.V.Rochberg R.,PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:34:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); An interesting class of operators with unusual Schatten-von Neumann behavior2001Report (Other scientific)36. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt1269",{id:"formSmash:items:resultList:35:j_idt1269",widgetVar:"widget_formSmash_items_resultList_35_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics. Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:35:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Approximation and Simulation of the Distributions of Scan Statistics for Poisson Processes in Higher Dimensions1998In: Extremes, Vol. 1, 111-126 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_35_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:35:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_35_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Given a Poisson process in two or three dimensions we are interested in the scan statistic, i.e. the largest number of points contained in a translate of a fixed scanning set restricted to lie inside a rectangular area.

The distribution of the scan statistic is accurately approximated for rectangular scanning sets, using a technique that is also extended to higher dimensions.

The accuracy of the approximation is checked through simulation.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:35:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 37. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_36_j_idt1269",{id:"formSmash:items:resultList:36:j_idt1269",widgetVar:"widget_formSmash_items_resultList_36_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:36:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Monotonicity of the difference between median and mean of Gamma distributions and of a related Ramanujan sequence2002Report (Other academic)38. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt1269",{id:"formSmash:items:resultList:37:j_idt1269",widgetVar:"widget_formSmash_items_resultList_37_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics. Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:37:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Monotonicity of the difference between median and mean of gamma distributions and of a related Ramanujan sequence2003In: Bernoulli, ISSN 1350-7265, Vol. 9, no 2, 351-371 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_37_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:37:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_37_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); For $n\ge0$, let $\lambda_n$ be the median of the $\Gamma(n+1,1)$ distribution. We prove that the sequence $\{\alpha_n=\lambda_n-n\}$ decreases from $\log 2$ to $2/3$ as $n$ increases from 0 to $\infty$. The difference, $1-\alpha_n$, between the mean and the median thus increases from $1-\log 2$ to $1/3$.

This result also proves the following conjecture by Chen \& Rubin about the Poisson distributions: Let $Y_{\mu}\sim\text{Poisson}(\mu)$, and \lambda_n$ be the largest $\mu$ such that $P(Y_{\mu}\le n)=1/2$, then $\lambda_n-n$ is decreasing in $n$.

The sequence $\{\alpha_n\}$ is related to a sequence $\{\theta_n\}$, introduced by Ramanujan, which is known to be decreasing and of the form

$\theta_n=\frac13+\frac4{135(n+k_n)}$, where $\frac2{21}<k_n\le\frac8{45}$. We also show that the sequence $\{k_n\}$ is decreasing.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:37:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 39. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_38_j_idt1269",{id:"formSmash:items:resultList:38:j_idt1269",widgetVar:"widget_formSmash_items_resultList_38_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:38:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On measures of average degree for lattices2003Report (Other scientific)40. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt1269",{id:"formSmash:items:resultList:39:j_idt1269",widgetVar:"widget_formSmash_items_resultList_39_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:39:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On Measures of Average Degree for Lattices2006In: Combinatorics, Probability and Computing, Vol. 15, no 4, 477-488 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_39_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:39:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_39_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); The usual definition of average degree for a non-regular lattice has the disadvantage that it takes the same value for many lattices with clearly different connectivity. We introduce an alternative definition of average degree, which better separates different lattices.

These measures are compared on a class of lattices and are analyzed using a Markov chain describing a random walk on the lattice. Using the new measure, we conjecture the order of both the critical probabilities for bond percolation and the connective constants for self-avoiding walks on these lattices.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:39:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 41. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_40_j_idt1269",{id:"formSmash:items:resultList:40:j_idt1269",widgetVar:"widget_formSmash_items_resultList_40_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:40:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); On monoticity of some binomial probabilities2010Report (Other academic)42. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_41_j_idt1269",{id:"formSmash:items:resultList:41:j_idt1269",widgetVar:"widget_formSmash_items_resultList_41_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:41:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Upper and Lower Bounds for the Connective Constants of Self-avoiding Walks on the Archimedean and Laves Lattices2005In: J. Phys. A: Math. Gen., no 38, 2055-2080 p.Article in journal (Refereed)43. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_42_j_idt1269",{id:"formSmash:items:resultList:42:j_idt1269",widgetVar:"widget_formSmash_items_resultList_42_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:42:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Upper and Lower Bounds for the Connective Constants of Self-avoiding Walks on the Archimedean and Laves Lattices2004Report (Other scientific)44. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt1269",{id:"formSmash:items:resultList:43:j_idt1269",widgetVar:"widget_formSmash_items_resultList_43_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt1272",{id:"formSmash:items:resultList:43:j_idt1272",widgetVar:"widget_formSmash_items_resultList_43_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Probability Theory.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Deijfen, MariaStockholm Univ, Dept Math, S-10691 Stockholm, Sweden..PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:43:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); First Passage Percolation on \(\mathbb {Z}^2\): A Simulation Study2015In: Journal of statistical physics, ISSN 0022-4715, E-ISSN 1572-9613, Vol. 161, no 3, 657-678 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_43_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:43:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_43_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); First passage percolation on is a model for describing the spread of an infection on the sites of the square lattice. The infection is spread via nearest neighbor sites and the time dynamic is specified by random passage times attached to the edges. In this paper, the speed of the growth and the shape of the infected set is studied by aid of large-scale computer simulations, with focus on continuous passage time distributions. It is found that the most important quantity for determining the value of the time constant, which indicates the inverse asymptotic speed of the growth, is , where are i.i.d. passage time variables. The relation is linear for a large class of passage time distributions. Furthermore, the directional time constants are seen to be increasing when moving from the axis towards the diagonal, so that the limiting shape is contained in a circle with radius defined by the speed along the axes. The shape comes closer to the circle for distributions with larger variability.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:43:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 45. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt1269",{id:"formSmash:items:resultList:44:j_idt1269",widgetVar:"widget_formSmash_items_resultList_44_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt1272",{id:"formSmash:items:resultList:44:j_idt1272",widgetVar:"widget_formSmash_items_resultList_44_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Janson, SvanteUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Analysis and Applied Mathematics.Linusson, SvantePrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:44:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Correlations for Paths in Random Orientations of G(n, p) and G(n, m)2011In: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 39, no 4, 486-506 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_44_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:44:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_44_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study random graphs, both G(n, p) and G(n, m), with random orientations on the edges. For three fixed distinct vertices s, a, b we study the correlation, in the combined probability space, of the events {a -> s} and {s -> b}. For G(n, p), we prove that there is a p(c) = 1/2 such that for a fixed p < p(c) the correlation is negative for large enough n and for p > p(c) the correlation is positive for large enough n. We conjecture that for a fixed n >= 27 the correlation changes sign three times for three critical values of p. For G(n, m) it is similarly proved that, with p = m/((n)(2)), there is a critical p(c) that is the solution to a certain equation and approximately equal to 0.7993. A lemma, which computes the probability of non existence of any l directed edges in G(n, m), is thought to be of independent interest. We present exact recursions to compute P(a -> s) and P(a -> s, s -> b). We also briefly discuss the corresponding question in the quenched version of the problem.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:44:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 46. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt1269",{id:"formSmash:items:resultList:45:j_idt1269",widgetVar:"widget_formSmash_items_resultList_45_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt1272",{id:"formSmash:items:resultList:45:j_idt1272",widgetVar:"widget_formSmash_items_resultList_45_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Janson, SvanteUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics.Linusson, SvantePrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:45:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); First critical probability for a problem on random orientations in G(n,p)2014In: Electronic Journal of Probability, ISSN 1083-6489, E-ISSN 1083-6489, Vol. 19, 69- p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_45_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:45:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_45_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We study the random graph G (n,p) with a random orientation. For three fixed vertices s, a, b in G(n,p) we study the correlation of the events {a -> s} (there exists a directed path from a to s) and {s -> b}. We prove that asymptotically the correlation is negative for small p, p < C-1/n, where C-1 approximate to 0.3617, positive for C-1/n < p < 2/n and up to p = p(2)(n). Computer aided computations suggest that p(2)(n) = C-2/n, with C-2 approximate to 7.5. We conjecture that the correlation then stays negative for p up to the previously known zero at 1/2; for larger p it is positive.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:45:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 47. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt1269",{id:"formSmash:items:resultList:46:j_idt1269",widgetVar:"widget_formSmash_items_resultList_46_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt1272",{id:"formSmash:items:resultList:46:j_idt1272",widgetVar:"widget_formSmash_items_resultList_46_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Linusson, SvantePrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:46:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); A Counter-Intuitive Correlation in a Random Tournament2011In: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 20, no 1, 1-9 p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_46_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:46:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_46_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Consider a randomly oriented graph G = (V, E) and let a, s and b be three distinct vertices in V. We study the correlation between the events {a -> s} and {s -> b}. We show that, counter-intuitively, when G is the complete graph K-n, n >= 5, then the correlation is positive. (It is negative for n = 3 and zero for n = 4.) We briefly discuss and pose problems for the same question on other graphs.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:46:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 48. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt1269",{id:"formSmash:items:resultList:47:j_idt1269",widgetVar:"widget_formSmash_items_resultList_47_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt1272",{id:"formSmash:items:resultList:47:j_idt1272",widgetVar:"widget_formSmash_items_resultList_47_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics. Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parviainen, RobertUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics. Matematisk statistik.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:47:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Bounds for the connective constant of the hexagonal lattice2004In: J.\ Phys. A: Math. Gen., Vol. 37, 549- p.Article in journal (Refereed)Abstract [en] PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_47_j_idt1307_0_j_idt1308",{id:"formSmash:items:resultList:47:j_idt1307:0:j_idt1308",widgetVar:"widget_formSmash_items_resultList_47_j_idt1307_0_j_idt1308",onLabel:"Abstract [en]",offLabel:"Abstract [en]",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); We give improved bounds for the connective constant of the hexagonal lattice. The lower bound is found by using Kesten's method of irreducible bridges and by determining generating functions for bridges on one-dimensional lattices.

The upper bound is obtained as the largest eigenvalue of a certain transfer matrix. Using a relation between the hexagonal and the $(3.12^2)$ lattices, we also give bounds for the connective constant of the latter lattice.

PrimeFaces.cw("Panel","tryPanel",{id:"formSmash:items:resultList:47:j_idt1307:0:abstractPanel",widgetVar:"tryPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); 49. Alm, Sven Erick PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt1269",{id:"formSmash:items:resultList:48:j_idt1269",widgetVar:"widget_formSmash_items_resultList_48_j_idt1269",onLabel:"Alm, Sven Erick ",offLabel:"Alm, Sven Erick ",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_48_j_idt1272",{id:"formSmash:items:resultList:48:j_idt1272",widgetVar:"widget_formSmash_items_resultList_48_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parviainen, RobertUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics. Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics, Mathematical Statistics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:48:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Bounds for the Connective Constant of the Hexagonal Lattice2003Report (Other scientific)50. Alm, Sven Erick et al. PrimeFaces.cw("SelectBooleanButton","widget_formSmash_items_resultList_49_j_idt1272",{id:"formSmash:items:resultList:49:j_idt1272",widgetVar:"widget_formSmash_items_resultList_49_j_idt1272",onLabel:"et al.",offLabel:"et al.",onIcon:"ui-icon-triangle-1-s",offIcon:"ui-icon-triangle-1-e"}); PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:orgPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Parviainen, RobertUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Mathematics.PrimeFaces.cw("Panel","testPanel",{id:"formSmash:items:resultList:49:etAlPanel",widgetVar:"testPanel",toggleable:true,toggleSpeed:500,collapsed:false,toggleOrientation:"vertical",closable:true,closeSpeed:500}); Bounds for the Connective Constant on the Hexagonal Lattice2004In: Journal of Physics A: Mathematical and General, Vol. 3, no 37, 549-560 p.Article in journal (Refereed)

CiteExportLink to result list
http://uu.diva-portal.org/smash/resultList.jsf?query=&language=en&searchType=SIMPLE&noOfRows=50&sortOrder=author_sort_asc&sortOrder2=title_sort_asc&onlyFullText=false&sf=all&aq=%5B%5B%7B%22organisationId%22%3A%221108%22%7D%5D%5D&aqe=%5B%5D&aq2=%5B%5B%5D%5D&af=%5B%5D $(function(){PrimeFaces.cw("InputTextarea","widget_formSmash_lower_j_idt1587_recordPermLink",{id:"formSmash:lower:j_idt1587:recordPermLink",widgetVar:"widget_formSmash_lower_j_idt1587_recordPermLink",autoResize:true});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1587_j_idt1589",{id:"formSmash:lower:j_idt1587:j_idt1589",widgetVar:"widget_formSmash_lower_j_idt1587_j_idt1589",target:"formSmash:lower:j_idt1587:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Permanent link

Cite

Citation styleapa ieee modern-language-association vancouver Other style $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1605",{id:"formSmash:lower:j_idt1605",widgetVar:"widget_formSmash_lower_j_idt1605",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1605",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1605",u:"formSmash:lower:otherStyle"},ext);}}});});

- apa
- ieee
- modern-language-association
- vancouver
- Other style

Languagede-DE en-GB en-US fi-FI nn-NO nn-NB sv-SE Other locale $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1616",{id:"formSmash:lower:j_idt1616",widgetVar:"widget_formSmash_lower_j_idt1616",behaviors:{change:function(ext) {PrimeFaces.ab({s:"formSmash:lower:j_idt1616",e:"change",f:"formSmash",p:"formSmash:lower:j_idt1616",u:"formSmash:lower:otherLanguage"},ext);}}});});

- de-DE
- en-GB
- en-US
- fi-FI
- nn-NO
- nn-NB
- sv-SE
- Other locale

Output formathtml text asciidoc rtf $(function(){PrimeFaces.cw("SelectOneMenu","widget_formSmash_lower_j_idt1626",{id:"formSmash:lower:j_idt1626",widgetVar:"widget_formSmash_lower_j_idt1626"});});

- html
- text
- asciidoc
- rtf