uu.seUppsala universitets publikationer
Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 3210
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Aboud, Mathilde
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Philosophy of mathematics in “La Science et l’Hypothèse”, from Henri Poincaré.2017Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 2.
    Abouzaid, Mohammed
    et al.
    Columbia Univ, Dept Math, New York, NY 10027 USA.
    Kragh, Thomas
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    On the immersion classes of nearby Lagrangians2016Ingår i: Journal of Topology, ISSN 1753-8416, E-ISSN 1753-8424, Vol. 9, nr 1, s. 232-244Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 3.
    Abouzaid, Mohammed
    et al.
    Columbia Univ, Dept Math, Room 509,MC 4406 2990 Broadway, New York, NY 10027 USA.
    Kragh, Thomas
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Simple homotopy equivalence of nearby Lagrangians2018Ingår i: Acta Mathematica, ISSN 0001-5962, E-ISSN 1871-2509, Vol. 220, nr 2, s. 207-237Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Given a closed exact Lagrangian in the cotangent bundle of a closed smooth manifold, we prove that the projection to the base is a simple homotopy equivalence.

  • 4.
    Abrahamsson, Linda
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Matematisk statistik.
    Statistical models of breast cancer tumour growth for mammography screening data2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 5. Abramovic, A.
    et al.
    Pecaric, J.
    Persson, Lars-Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Tillämpad matematik.
    Varosanec, S.
    General inequalities via isotonic subadditive functionals2007Ingår i: Mathematical Inequalities & Applications, ISSN 1331-4343, E-ISSN 1848-9966, Vol. 10, nr 1, s. 15-28Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 6.
    Aceto, Paolo
    et al.
    Alfred Renyi Inst Math, 13-15 Realtanoda U, H-1053 Budapest, Hungary..
    Golla, Marco
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Dehn surgeries and rational homology2017Ingår i: Algebraic and Geometric Topology, ISSN 1472-2747, E-ISSN 1472-2739, Vol. 17, nr 1, s. 487-527Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 7.
    Aceto, Paolo
    et al.
    Alfred Renyi Inst Math, Realtanoda Ut 13-15, H-1053 Budapest, Hungary..
    Golla, Marco
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Larson, Kyle
    Michigan State Univ, Dept Math, 619 Red Cedar Rd, E Lansing, MI 48824 USA..
    Embedding 3-manifolds in spin 4-manifolds2017Ingår i: Journal of Topology, ISSN 1753-8416, E-ISSN 1753-8424, Vol. 10, nr 2, s. 301-323Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 8. Aczel, Peter
    et al.
    Crosilla, Laura
    Ishihara, Hajime
    Palmgren, Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Matematisk logik.
    Schuster, Peter
    Binary refinement implies discrete exponentiation2006Ingår i: Studia Logica, Vol. 84, s. 361-368Artikel i tidskrift (Refereegranskat)
  • 9. Addario-Berry, Louigi
    et al.
    Devroye, Luc
    Janson, Svante
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Sub-Gaussian tail bounds for the width and height of conditioned Galton–Watson trees2013Ingår i: Annals of Probability, ISSN 0091-1798, E-ISSN 2168-894X, Vol. 41, nr 2, s. 1072-1087Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 10. Addario-Berry, Louigi
    et al.
    Janson, Svante
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    McDiarmid, Colin
    On the Spread of Random Graphs2014Ingår i: Combinatorics, probability & computing, ISSN 0963-5483, E-ISSN 1469-2163, Vol. 23, nr 4, s. 477-504Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 11. Adimurthi,
    et al.
    Marcos do O, Joao
    Tintarev, Kyril
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och tillämpad matematik.
    Cocompactness and minimizers for inequalities of Hardy-Sobolev type involving N-Laplacian2010Ingår i: NoDEA. Nonlinear differential equations and applications (Printed ed.), ISSN 1021-9722, E-ISSN 1420-9004, Vol. 17, nr 4, s. 467-477Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 12.
    Adimurthi,
    et al.
    TIFR CAM, PB 6503, Bangalore 560065, Karnataka, India.
    Tintarev, Kyril
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori.
    Defect of compactness in spaces of bounded variation2016Ingår i: Journal of Functional Analysis, ISSN 0022-1236, E-ISSN 1096-0783, Vol. 271, nr 1, s. 37-48Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 13. Adimurthi,
    et al.
    Tintarev, Kyril
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och tillämpad matematik.
    Hardy inequalities for weighted Dirac operator2010Ingår i: Annali di Matematica Pura ed Applicata, ISSN 0373-3114, E-ISSN 1618-1891, Vol. 189, nr 2, s. 241-251Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 14. Adimurthi,
    et al.
    Tintarev, Kyril
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och tillämpad matematik.
    On a version of Trudinger-Moser inequality with Möbius shift invariance2010Ingår i: Calculus of Variations and Partial Differential Equations, ISSN 0944-2669, E-ISSN 1432-0835, Vol. 39, nr 1-2, s. 203-212Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 15. Adimurthi, no first name
    et al.
    Tintarev, Cyril
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori.
    On compactness in the Trudinger-Moser inequality2014Ingår i: Annali della Scuola Normale Superiore di Pisa (Classe Scienze), Serie V, ISSN 0391-173X, E-ISSN 2036-2145, Vol. 13, nr 2, s. 399-416Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 16.
    Adle, Tobias
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Framtagning av metod för analys av livslängdsdata2017Självständigt arbete på grundnivå (yrkesexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    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.

  • 17. Agerholm, Troels
    et al.
    Mazorchuk, Volodymyr
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra, geometri och logik.
    On selfadjoint functors satisfying polynomial relations2011Ingår i: Journal of Algebra, ISSN 0021-8693, E-ISSN 1090-266X, Vol. 330, nr 1, s. 448-467Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 18.
    Ahlberg, Daniel
    et al.
    Stockholm Univ, Dept Math, S-10691 Stockholm, Sweden.
    Deijfen, Maria
    Stockholm Univ, Dept Math, S-10691 Stockholm, Sweden.
    Janson, Svante
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori.
    Competing first passage percolation on random graphs with finite variance degrees2019Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 55, nr 3, s. 545-559Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study the growth of two competing infection types on graphs generated by the configuration model with a given degree sequence. Starting from two vertices chosen uniformly at random, the infection types spread via the edges in the graph in that an uninfected vertex becomes type 1 (2) infected at rate lambda(1) (lambda(2)) times the number of nearest neighbors of type 1 (2). Assuming (essentially) that the degree of a randomly chosen vertex has finite second moment, we show that if lambda(1) = lambda(2), then the fraction of vertices that are ultimately infected by type 1 converges to a continuous random variable V is an element of (0,1), as the number of vertices tends to infinity. Both infection types hence occupy a positive (random) fraction of the vertices. If lambda(1) not equal lambda(2), on the other hand, then the type with the larger intensity occupies all but a vanishing fraction of the vertices. Our results apply also to a uniformly chosen simple graph with the given degree sequence.

  • 19.
    Ahlberg, Daniel
    et al.
    Stockholm Univ, Dept Math, SE-10691 Stockholm, Sweden.
    Griffiths, Simon
    PUC Rio, Dept Matemat, BR-22451900 Gavea, RJ, Brazil.
    Janson, Svante
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori.
    Morris, Robert
    Inst Nacl Matemat Pura & Aplicada, Estr Dona Castorina 110, BR-22460320 Rio De Janeiro, Brazil.
    Competition in growth and urns2019Ingår i: Random structures & algorithms (Print), ISSN 1042-9832, E-ISSN 1098-2418, Vol. 54, nr 2, s. 211-227Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study survival among two competing types in two settings: a planar growth model related to two-neighbor bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncolored sites are given a color at rate 0, 1 or infinity, depending on whether they have zero, one, or at least two neighbors of that color. In the urn scheme, each vertex of a graph G has an associated urn containing some number of either blue or red balls ( but not both). At each time step, a ball is chosen uniformly at random from all those currently present in the system, a ball of the same color is added to each neighboring urn, and balls in the same urn but of different colors annihilate on a one-for-one basis. We show that, for every connected graph G and every initial configuration, only one color survives almost surely. As a corollary, we deduce that in the two-type growth model on Z(2), one of the colors only infects a finite number of sites with probability one. We also discuss generalizations to higher dimensions and multi-type processes, and list a number of open problems and conjectures.

  • 20.
    Ahlberg, Daniel
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori. Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden..
    Griffiths, Simon
    Univ Oxford, Dept Stat, Oxford OX1 3TG, England..
    Morris, Robert
    IMPA, Rio De Janeiro, RJ, Brazil..
    Tassion, Vincent
    Univ Geneva, Dept Math, Geneva, Switzerland..
    Quenched Voronoi percolation2016Ingår i: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 286, s. 889-911Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    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.

  • 21.
    Ahlberg, Daniel
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori. Inst Nacl Matemat Pura & Aplicada, Estr Dona Castorina 110, BR-22460320 Rio De Janeiro, Brazil.;Uppsala Univ, Dept Math, SE-75106 Uppsala, Sweden..
    Steif, Jeffrey E.
    Univ Gothenburg, Chalmers Univ Technol, Math Sci, SE-41296 Gothenburg, Sweden..
    Pete, Gabor
    Hungarian Acad Sci, Renyi Inst, 13-15 Realtanoda U, H-1053 Budapest, Hungary.;Budapest Univ Technol & Econ, Inst Math, 1 Egry Jozsef U, H-1111 Budapest, Hungary..
    Scaling limits for the threshold window: When does a monotone Boolean function flip its outcome?2017Ingår i: Annales de l'I.H.P. Probabilites et statistiques, ISSN 0246-0203, E-ISSN 1778-7017, Vol. 53, nr 4, s. 2135-2161Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Consider a monotone Boolean function f : {0, 1}(n) -> {0, 1} and the canonical monotone coupling {eta(p) : p is an element of [0, 1]} of an element in {0, 1}(n) chosen according to product measure with intensity p is an element of [0, 1]. The random point p is an element of [0, 1] where f (eta(p)) flips from 0 to 1 is often concentrated near a particular point, thus exhibiting a threshold phenomenon. For a sequence of such Boolean functions, we peer closely into this threshold window and consider, for large n, the limiting distribution (properly normalized to be nondegenerate) of this random point where the Boolean function switches from being 0 to 1. We determine this distribution for a number of the Boolean functions which are typically studied and pay particular attention to the functions corresponding to iterated majority and percolation crossings. It turns out that these limiting distributions have quite varying behavior. In fact, we show that any nondegenerate probability measure on R arises in this way for some sequence of Boolean functions.

  • 22.
    Ahlberg, Daniel
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori. Inst Matematica Pura & Aplicada, Estr Dona Castorina 110, BR-22460320 Rio De Janeiro, Brazil.
    Tassion, Vincent
    Univ Geneva, 2-4 Rue Lievre, CH-1211 Geneva, Switzerland.
    Teixeira, Augusto
    Inst Matematica Pura & Aplicada, Estr Dona Castorina 110, BR-22460320 Rio De Janeiro, Brazil.
    Sharpness of the phase transition for continuum percolation in R22018Ingår i: Probability theory and related fields, ISSN 0178-8051, E-ISSN 1432-2064, Vol. 172, nr 1-2, s. 525-581Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study the phase transition of random radii Poisson Boolean percolation: Around each point of a planar Poisson point process, we draw a disc of random radius, independently for each point. The behavior of this process is well understood when the radii are uniformly bounded from above. In this article, we investigate this process for unbounded (and possibly heavy tailed) radii distributions. Under mild assumptions on the radius distribution, we show that both the vacant and occupied sets undergo a phase transition at the same critical parameter.c. Moreover, For. <.c, the vacant set has a unique unbounded connected component and we give precise bounds on the one-arm probability for the occupied set, depending on the radius distribution. At criticality, we establish the box-crossing property, implying that no unbounded component can be found, neither in the occupied nor the vacant sets. We provide a polynomial decay for the probability of the one-arm events, under sharp conditions on the distribution of the radius. For. >.c, the occupied set has a unique unbounded component and we prove that the one-arm probability for the vacant decays exponentially fast. The techniques we develop in this article can be applied to other models such as the Poisson Voronoi and confetti percolation.

  • 23.
    Ahlberg, Daniel
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och sannolikhetsteori. Inst Nacl Matemat Pura & Aplicada, Rio De Janeiro, RJ, Brazil;Stockholm Univ, Dept Math, SE-10691 Stockholm, Sweden;Stockholm Univ, Dept Math, SE-10691 Stockholm, Sweden.
    Tykesson, Johan
    Chalmers Univ Technol, Dept Math, SE-41296 Gothenburg, Sweden;Univ Gothenburg, Gothenburg, Sweden.
    Gilbert´s disc model with geostatical marking2018Ingår i: Advances in Applied Probability, ISSN 0001-8678, E-ISSN 1475-6064, Vol. 50, nr 4, s. 1075-1094Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We study a variant of Gilbert's disc model, in which discs are positioned at the points of a Poisson process in R-2 with radii determined by an underlying stationary and ergodic random field phi: R-2 -> [0, infinity), independent of the Poisson process. This setting, in which the random field is independent of the point process, is often referred to as geostatistical marking. We examine how typical properties of interest in stochastic geometry and percolation theory, such as coverage probabilities and the existence of long-range connections, differ between Gilbert's model with radii given by some random field and Gilbert's model with radii assigned independently, but with the same marginal distribution. Among our main observations we find that complete coverage of R(2 )does not necessarily happen simultaneously, and that the spatial dependence induced by the random field may both increase as well as decrease the critical threshold for percolation.

  • 24.
    Ahlberg, Peter
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Studier av mätdataregistrering för JAS 39 Gripen2002Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 25.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    A zero-one law for l-colourable structures with a vectorspace pregeometry2012Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 26.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Combinatorial geometries in model theory2009Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    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.

  • 27.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Homogenizable structures and model completeness2016Ingår i: Archive for mathematical logic, ISSN 0933-5846, E-ISSN 1432-0665, Vol. 55, nr 7-8, s. 977-995Artikel i tidskrift (Refereegranskat)
    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.

  • 28.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    >k-homogeneous infinite graphs2018Ingår i: Journal of combinatorial theory. Series B (Print), ISSN 0095-8956, E-ISSN 1096-0902, Vol. 128, s. 160-174Artikel i tidskrift (Refereegranskat)
    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.

  • 29.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Limit Laws, Homogenizable Structures and Their Connections2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    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.

    Delarbeten
    1. Simple structures axiomatized by almost sure theories
    Öppna denna publikation i ny flik eller fönster >>Simple structures axiomatized by almost sure theories
    2016 (Engelska)Ingår i: Annals of Pure and Applied Logic, ISSN 0168-0072, E-ISSN 1873-2461, Vol. 167, nr 5, s. 435-456Artikel i tidskrift (Refereegranskat) 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.

    Nyckelord
    Random structure, Almost sure theory, Pregeometry, Supersimple, Countably categorical
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematik
    Identifikatorer
    urn:nbn:se:uu:diva-276995 (URN)10.1016/j.apal.2016.02.001 (DOI)000372680500001 ()
    Tillgänglig från: 2016-03-01 Skapad: 2016-02-17 Senast uppdaterad: 2017-11-30Bibliografiskt granskad
    2. On sets with rank one in simple homogeneous structures
    Öppna denna publikation i ny flik eller fönster >>On sets with rank one in simple homogeneous structures
    2015 (Engelska)Ingår i: Fundamenta Mathematicae, ISSN 0016-2736, E-ISSN 1730-6329, Vol. 228, s. 223-250Artikel i tidskrift (Refereegranskat) 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.

    Nyckelord
    model theory, homogeneous structure, simple theory, pregeometry, rank, reduct, random structure
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematik
    Identifikatorer
    urn:nbn:se:uu:diva-243006 (URN)10.4064/fm228-3-2 (DOI)000352858400002 ()
    Tillgänglig från: 2015-02-03 Skapad: 2015-02-03 Senast uppdaterad: 2017-12-05Bibliografiskt granskad
    3. Random l-colourable structures with a pregeometry
    Öppna denna publikation i ny flik eller fönster >>Random l-colourable structures with a pregeometry
    2017 (Engelska)Ingår i: Mathematical logic quarterly, ISSN 0942-5616, E-ISSN 1521-3870, Vol. 63, nr 1-2, s. 32-58Artikel i tidskrift (Refereegranskat) 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).

    Ort, förlag, år, upplaga, sidor
    Wiley-VCH Verlagsgesellschaft, 2017
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematisk logik
    Identifikatorer
    urn:nbn:se:uu:diva-321515 (URN)10.1002/malq.201500006 (DOI)000400361900003 ()
    Tillgänglig från: 2017-05-06 Skapad: 2017-05-06 Senast uppdaterad: 2017-11-28Bibliografiskt granskad
    4. Limit laws and automorphism groups of random nonrigid structures
    Öppna denna publikation i ny flik eller fönster >>Limit laws and automorphism groups of random nonrigid structures
    2015 (Engelska)Ingår i: Journal of Logic and Analysis, ISSN 1759-9008, E-ISSN 1759-9008, Vol. 7, nr 2, s. 1-53, artikel-id 1Artikel i tidskrift (Refereegranskat) 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.

    Nyckelord
    finite model theory, limit law, zero-one law, random structure, automorphism group
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematisk logik
    Identifikatorer
    urn:nbn:se:uu:diva-248078 (URN)10.4115/jla.2015.7.2 (DOI)000359802400001 ()
    Tillgänglig från: 2015-03-26 Skapad: 2015-03-26 Senast uppdaterad: 2017-12-04Bibliografiskt granskad
    5. Homogenizable structures and model completeness
    Öppna denna publikation i ny flik eller fönster >>Homogenizable structures and model completeness
    2016 (Engelska)Ingår i: Archive for mathematical logic, ISSN 0933-5846, E-ISSN 1432-0665, Vol. 55, nr 7-8, s. 977-995Artikel i tidskrift (Refereegranskat) 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.

    Nyckelord
    Homogenizable, Model-complete, Amalgamation class, Quantifier-elimination
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematik
    Identifikatorer
    urn:nbn:se:uu:diva-303714 (URN)10.1007/s00153-016-0507-6 (DOI)000385155700010 ()
    Tillgänglig från: 2016-09-22 Skapad: 2016-09-22 Senast uppdaterad: 2017-11-28Bibliografiskt granskad
    6. >k-homogeneous infinite graphs
    Öppna denna publikation i ny flik eller fönster >>>k-homogeneous infinite graphs
    2018 (Engelska)Ingår i: Journal of combinatorial theory. Series B (Print), ISSN 0095-8956, E-ISSN 1096-0902, Vol. 128, s. 160-174Artikel i tidskrift (Refereegranskat) 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.

    Nyckelord
    >k-homomogeneous, countably infinite graph
    Nationell ämneskategori
    Algebra och logik
    Forskningsämne
    Matematisk logik
    Identifikatorer
    urn:nbn:se:uu:diva-329362 (URN)10.1016/j.jctb.2017.08.007 (DOI)000417771100009 ()
    Tillgänglig från: 2017-09-26 Skapad: 2017-09-26 Senast uppdaterad: 2018-04-05Bibliografiskt granskad
  • 30.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Simple structures axiomatized by almost sure theories2016Ingår i: Annals of Pure and Applied Logic, ISSN 0168-0072, E-ISSN 1873-2461, Vol. 167, nr 5, s. 435-456Artikel i tidskrift (Refereegranskat)
    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.

  • 31.
    Ahlman, Ove
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    To infinity and back: Logical limit laws and almost sure theories2014Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
  • 32.
    Ahlman, Ove
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Koponen, Vera
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Limit laws and automorphism groups of random nonrigid structures2015Ingår i: Journal of Logic and Analysis, ISSN 1759-9008, E-ISSN 1759-9008, Vol. 7, nr 2, s. 1-53, artikel-id 1Artikel i tidskrift (Refereegranskat)
    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.

  • 33.
    Ahlman, Ove
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Koponen, Vera
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    On sets with rank one in simple homogeneous structures2015Ingår i: Fundamenta Mathematicae, ISSN 0016-2736, E-ISSN 1730-6329, Vol. 228, s. 223-250Artikel i tidskrift (Refereegranskat)
    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.

  • 34.
    Ahlman, Ove
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Koponen, Vera
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Random l-colourable structures with a pregeometry2017Ingår i: Mathematical logic quarterly, ISSN 0942-5616, E-ISSN 1521-3870, Vol. 63, nr 1-2, s. 32-58Artikel i tidskrift (Refereegranskat)
    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).

  • 35.
    Ahlsén, Daniel
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Classifying Categories: The Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories2018Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 36.
    Ahlsén, Daniel
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Limitless Analysis2014Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 37.
    Ahmady Phoulady, Hady
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Matematisk statistik.
    Brownian Motions and Scaling Limits of Random Trees2011Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 38.
    Ahmady Phoulady, Hady
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Analys och tillämpad matematik.
    Monte Carlo Methods in American Put Option Pricing2011Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 39.
    Al Homsi, Rania
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Algebra och geometri.
    Equation Solving in Indian Mathematics2018Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 40.
    Albahaca, Juan Carlos
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen, Tillämpad matematik och statistik.
    Analytical and Numerical Study of the Poincaré Map with Applications on the Computation of Periodic Orbits2015Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
  • 41.
    Aldberg, Henrik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Bond Pricing in Stochastic Volatility Models2008Självständigt arbete på avancerad nivå (magisterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
  • 42.
    Aleksandrov, Alexei B.
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Janson, Svante
    Peller, Vladimir V.
    Rochberg, Richard
    An interesting class of operators with unusual Schatten-von Neumann behavior2002Ingår i: Function Spaces, Interpolation Theory and Related Topics (Proceedings of the International Conference in honour of Jaak Peetre on his 65th birthday, Lund 2000), s. 61-150Artikel i tidskrift (Refereegranskat)
  • 43.
    Alexandrov A.B., Janson
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    S., Peller V.V.
    Rochberg R.,
    An interesting class of operators with unusual Schatten-von Neumann behavior2001Rapport (Övrigt vetenskapligt)
  • 44.
    Alghamdi, Azza
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Matematiska institutionen.
    Approximation of pluricomplex Green functions: A probabilistic approach2018Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    This PhD thesis focuses on probabilistic methods of approximation of pluricomplex Green functions and is based on four papers.

    The thesis begins with a general introduction to the use of pluricomplex Green functions in multidimensional complex analysis and a review of their main properties. This is followed by short description of the main results obtained in the enclosed papers.

    In Paper I, we study properties of the metric space of pluriregular sets, that is zero sets of continuous pluricomplex Green functions. The best understood non-trivial examples of such sets are composite Julia sets, obtained by iteration of finite families of polynomial mappings in several complex variables. We prove that the so-called chaos game is applicable in the case of such sets. We also visualize some composite Julia sets using escape time functions and Monte Carlo simulation.

    In Paper II, we extend results in Paper I to the case of infinite compact families of proper polynomials mappings. With composition as the semigroup operation, we generate families of infinite iterated function systems with compact attractors. We show that such attractors can be approximated probabilistically in a manner of the classic chaos game.

    In Paper III, we study numerical approximation and visualisation of pluricomplex Green functions based on the Monte-Carlo integration. Unlike alternative methods that rely on locating a sequence of carefully chosen finite sets of points satisfying some optimal conditions for approximation purposes, our approach is simpler and more direct by relying on generation of pseudorandom points. We examine numerically the errors of approximation for some simple geometric shapes for which the pluricomplex Green functions are known. If the pluricomplex Green functions are not known, the errors in Monte Carlo integration can be expressed with the aid of statistics in terms of confidence intervals.

    Finally, in Paper IV, we study how perturbations of an orthonomalization procedure influence the resulting approximate Bergman functions. To this end we consider the concept of near orthonormality of a finite set of vectors in an inner product space, understood as closeness of the Gram matrix of those vectors to the identity matrix. We provide estimates for the errors resulting from using nearly orthogonal bases instead of orthogonal ones. The motivation for this work comes from Paper III: when Gram matrices are calculated via Monte Carlo integration, the outcomes of standard orthogonalisation algorithms are nearly orthonormal bases.

    Delarbeten
    1. Probabilistic approximation of partly filled-in composite Julia sets
    Öppna denna publikation i ny flik eller fönster >>Probabilistic approximation of partly filled-in composite Julia sets
    2017 (Engelska)Ingår i: Annales Polonici Mathematici, ISSN 0066-2216, E-ISSN 1730-6272, Vol. 119, nr 3, s. 203-220Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    We study properties of the metric space of pluriregular sets and of contractions on that space induced by finite families of proper polynomial mappings of several complex variables. In particular, we show that closed balls in the space of pluriregular sets do not have to be compact and we give a simple proof of applicability of the so-called chaos game in the case of composite Julia sets. Part of the construction of those sets also leads to a computationally viable approximation by simpler sets based on Monte-Carlo simulation.

    Nyckelord
    composite Julia sets, pluricomplex Green functions, iterated function system, the chaos game, complex dynamics, Monte-Carlo simulation
    Nationell ämneskategori
    Matematik
    Identifikatorer
    urn:nbn:se:uu:diva-339527 (URN)10.4064/ap4100-8-2017 (DOI)000417986400002 ()
    Tillgänglig från: 2018-01-22 Skapad: 2018-01-22 Senast uppdaterad: 2018-07-06Bibliografiskt granskad
    2. Attractors of compactly generated semigroups of regular polynomial mappings.
    Öppna denna publikation i ny flik eller fönster >>Attractors of compactly generated semigroups of regular polynomial mappings.
    2018 (Engelska)Ingår i: Complexity, ISSN 1076-2787, E-ISSN 1099-0526, artikel-id 5698021Artikel i tidskrift (Refereegranskat) Published
    Abstract [en]

    We investigate the metric space of pluriregular sets as well as the contractions on that space induced by infinite compact families of proper polynomial mappings of several complex variables. The topological semigroups generated by such families, with composition as the semigroup operation, lead to the constructions of a variety of Julia-type pluriregular sets. The generating families can also be viewed as infinite iterated function systems with compact attractors. We show that such attractors can be approximated both deterministically and probabilistically in a manner of the classic chaos game.

    Nyckelord
    Julia sets, pluricomplex Green function, iterated function systems
    Nationell ämneskategori
    Matematisk analys
    Identifikatorer
    urn:nbn:se:uu:diva-355806 (URN)10.1155/2018/5698021 (DOI)000450216100001 ()
    Tillgänglig från: 2018-07-05 Skapad: 2018-07-05 Senast uppdaterad: 2018-12-19Bibliografiskt granskad
    3. Approximation of pluricomplex Green functions based on Monte Carlo integration
    Öppna denna publikation i ny flik eller fönster >>Approximation of pluricomplex Green functions based on Monte Carlo integration
    (Engelska)Manuskript (preprint) (Övrigt vetenskapligt)
    Nyckelord
    Pluricomplex Green functions, pluriregular sets, Bernstein-Markov property, orthogonal polynomials, Monte Carlo simulation
    Nationell ämneskategori
    Beräkningsmatematik
    Forskningsämne
    Matematik
    Identifikatorer
    urn:nbn:se:uu:diva-355808 (URN)
    Tillgänglig från: 2018-07-05 Skapad: 2018-07-05 Senast uppdaterad: 2018-07-06