SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "AMNE:(NATURVETENSKAP Matematik Geometri) "

Sökning: AMNE:(NATURVETENSKAP Matematik Geometri)

  • Resultat 1-10 av 1292
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Berndtsson, Bo, 1950 (författare)
  • Probability measures associated to geodesics in the space of kähler metrics
  • 2018
  • Ingår i: Springer Proceedings in Mathematics and Statistics. - Cham : Springer International Publishing. - 2194-1017 .- 2194-1009. ; 269, s. 395-419
  • Konferensbidrag (refereegranskat)abstract
    • We associate certain probability measures on R to geodesics in the space HL of positively curved metrics on a line bundle L, and to geodesics in the finite dimensional symmetric space of hermitian norms on H0(X, kL). We prove that the measures associated to the finite dimensional spaces converge weakly to the measures related to geodesics in HL as k goes to infinity. The convergence of second order moments implies a recent result of Chen and Sun on geodesic distances in the respective spaces, while the convergence of first order moments gives convergence of Donaldson’s Z-functional to the Aubin–Yau energy. We also include a result on approximation of infinite dimensional geodesics by Bergman kernels which generalizes work of Phong and Sturm.
  •  
2.
  • Xia, Jiacheng, 1991 (författare)
  • Vector-valued Eisenstein series of congruence types and their products
  • 2019
  • Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Historically, Kohnen and Zagier connected modular forms with period polynomials, and as a consequence of this association concluded that the products of at most two Eisenstein series span all spaces of classical modular forms of level 1. Later Borisov and Gunnells among other authors extended the result to higher levels. We consider this problem for vector-valued modular forms, establish the framework of congruence types and obtain the structure of the space of vector-valued Eisenstein series using tools from representation theory. Based on this development and historic results, we show that the space of vector-valued modular forms of certain weights and any congruence type can be spanned by the invariant vectors of that type tensor at most two Eisenstein series.
  •  
3.
  • Discrete Geometry and Mathematical Morphology : First International Joint Conference, DGMM 2021, Uppsala, Sweden, May 24–27, 2021, Proceedings
  • 2021
  • Samlingsverk (redaktörskap) (refereegranskat)abstract
    • This book constitutes the proceedings of the First IAPR International Conference on Discrete Geometry and Mathematical Morphology, DGMM 2021, which was held during May 24-27, 2021, in Uppsala, Sweden.The conference was created by joining the International Conference on Discrete Geometry for computer Imagery, DGCI, with the International Symposium on Mathematical Morphology, ISMM.The 36 papers included in this volume were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: applications in image processing, computer vision, and pattern recognition; discrete and combinatorial topology; discrete geometry - models, transforms, visualization; discrete tomography and inverse problems; hierarchical and graph-based models, analysis and segmentation; learning-based approaches to mathematical morphology; multivariate and PDE-based mathematical morphology, morphological filtering.The book also contains 3 invited keynote papers.
  •  
4.
  • Gäfvert, Oliver, 1991- (författare)
  • Topological and geometrical methods in data analysis
  • 2021
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • This thesis concerns two related data analysis pipelines, using topological and geometrical methods respectively, to extract relevant information. The first pipeline, referred to as the topological data analysis (TDA) pipeline, constructs a filtered simplicial complex on a given data set in order to describe its shape. The shape is described using a persistence module, which characterizes the topological features of the filtration, and the final step of the pipeline extracts algebraic invariants from this object. The second pipeline, referred to as the geometric data analysis (GDA) pipeline, associates an algebraic variety to a given data set and aims to describe the structure of this variety. Its structure is described using homology, an invariant which for most algebraic varieties can only be computed numerically using sampling methods.In Paper A we consider invariants on multi-parameter persistence modules. We explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate  this process by constructing stable invariants for multi-parameter persistence modules with respect to the interleaving distance and so called simple noise systems. For one parameter, we recover the standard barcode information. For more than one parameter we prove that  the constructed invariants are in general NP-hard to calculate. A consequence is that computing the feature counting function, proposed by Scolamiero et. al. (2016), is NP-hard.In Paper B we introduce an efficient algorithm to compute a minimal presentation of a multi-parameter persistent homology module, given a chain complex of free modules as input.  Our approach extends previous  work on this problem in the 2-parameter case, and draws on ideas underlying the F4 and F5 algorithms for Gröbner basis computation. In the r-parameter case, our algorithm computes a presentation for the homology of C ->F A ->G B, with modules of rank l,n,m respectively, in O(r2nr+1 + nrm + nr-1m2 + rn2 l) arithmetic operations. We implement this approach in our new software Muphasa, written in C++. In preliminary computational experiments on synthetic TDA examples,      we compare our approach to a version of a classical approach based on Schreyer's algorithm, and find that ours is substantially faster and more memory efficient. In the course of developing our algorithm for computing presentations, we also introduce algorithms for the closely related problems of computing Gröbner bases for the image and kernel of the morphism G.  This algorithm runs in time O(nrm + nr-1m2) and memory O(n2 + mn + nr + K), where K is the size of the output.Paper C analyzes the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in RN. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDD) of a certain variety called the hypothesis variety as the number of points in the configuration increases. Finally, we establish a connection to complexity of architectures of polynomial neural networks. For the problem of fitting an (N-1)-sphere to a configuration of m points in RN, we give a closed formula for the algebraic complexity of the hypothesis variety as m grows for the case of N=1. For the case N>1 we conjecture a generalization of this formula supported by numerical experiments.In Paper D we present an efficient algorithm to produce a provably dense sample of a smooth compact variety. The procedure is partly based on computing bottlenecks of the variety. Using geometric information such as the bottlenecks and the local reach we also provide bounds on the density of the sample needed in order to guarantee that the homology of the variety can be recovered from the sample. An implementation of the algorithm is provided together with numerical experiments and a computational     comparison to the algorithm by Dufresne et. al. (2019).
  •  
5.
  • Ardila, Federico, et al. (författare)
  • The equivariant Ehrhart theory of the permutahedron
  • 2020
  • Ingår i: Proceedings of the American Mathematical Society. - : American Mathematical Society (AMS). - 0002-9939 .- 1088-6826. ; 148:12, s. 5091-5107
  • Tidskriftsartikel (refereegranskat)abstract
    • Equivariant Ehrhart theory enumerates the lattice points in a polytope with respect to a group action. Answering a question of Stapledon, we describe the equivariant Ehrhart theory of the permutahedron, and we prove his Effectiveness Conjecture in this special case.
  •  
6.
  • Eur, Christopher, et al. (författare)
  • The universal valuation of Coxeter matroids
  • 2021
  • Ingår i: Bulletin of the London Mathematical Society. - : Wiley. - 0024-6093 .- 1469-2120. ; 53:3, s. 798-819
  • Tidskriftsartikel (refereegranskat)abstract
    • Coxeter matroids generalize matroids just as flag varieties of Lie groups generalize Grassmannians. Valuations of Coxeter matroids are functions that behave well with respect to subdivisions of a Coxeter matroid into smaller ones. We compute the universal valuative invariant of Coxeter matroids. A key ingredient is the family of Coxeter Schubert matroids, which correspond to the Bruhat cells of flag varieties. In the process, we compute the universal valuation of generalized Coxeter permutohedra, a larger family of polyhedra that model Coxeter analogues of combinatorial objects such as matroids, clusters, and posets.
  •  
7.
  • Lundman, Anders, 1985-, et al. (författare)
  • A note on higher order Gauss Maps
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • We study Gauss maps of order k, associated to a projective variety X embedded in projective space via a line bundle L. We show that if X is a smooth, complete complex variety and L is a k-jet spanned line bundle on X, with k > 1, then the Gauss map of order k has finite fibers, unless X = P^n is embedded by the Veronese embedding of order k. In the case where X is a toric variety, we give a combinatorial description of the Gauss maps of order k, its image and the general fibers. 
  •  
8.
  • Lundman, Anders, 1985- (författare)
  • Computing Seshardi constants on smooth toric surfaces
  • Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
    • In this paper we compute the Seshadri constants at the general point on many smooth polarized toric surfaces. We consider the case when the degree of jet separation is small or the core of the associated polygon is a line segment. Our main result is that in this case the Seshadri constant at the general point can often be determined in terms of easily computable invariants of the surfaces at hand. Lastly we consider the case that the core of the associated polygon is a point for a smooth polarized toric surface (X, L ). We show that in this case X can be constructed via consecutive equivariant blow-ups of either P^2 or P^1 x P^1. 
  •  
9.
  •  
10.
  • Lundström, Patrik, 1971- (författare)
  • Self-dual Normal Integral Bases for Infinite Unramified Extensions
  • 2002
  • Ingår i: Journal of Number Theory. - 0022-314X .- 1096-1658. ; 97:2, s. 350-367
  • Tidskriftsartikel (refereegranskat)abstract
    • We prove a generalization to infinite Galois extensions of local fields, of a classical result by Noether on the existence of normal integral bases for finite tamely ramified Galois extensions. We also prove a self-dual normal integral basis theorem for infinite unramified Galois field extensions of local fields with finite residue fields of characteristic different from 2. This generalizes a result by Fainsilber for the finite case. To do this, we obtain an injectivity result concerning pointed cohomology sets, defined by inverse limits of norm-one groups of free finite-dimensional algebras with involution over complete discrete valuation rings.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-10 av 1292
Typ av publikation
tidskriftsartikel (911)
annan publikation (92)
konferensbidrag (83)
doktorsavhandling (71)
bokkapitel (44)
licentiatavhandling (34)
visa fler...
rapport (25)
bok (16)
samlingsverk (redaktörskap) (8)
forskningsöversikt (3)
recension (3)
proceedings (redaktörskap) (2)
visa färre...
Typ av innehåll
refereegranskat (1001)
övrigt vetenskapligt/konstnärligt (281)
populärvet., debatt m.m. (10)
Författare/redaktör
Gudmundsson, Sigmund ... (52)
Roos, Jan-Erik (46)
Modin, Klas, 1979 (31)
Lundström, Patrik, 1 ... (22)
Ekholm, Tobias, 1970 ... (22)
Goffeng, Magnus C H ... (21)
visa fler...
Cederwall, Martin, 1 ... (20)
Wulcan, Elizabeth, 1 ... (19)
Lärkäng, Richard, 19 ... (17)
Rowlett, Julie, 1978 (16)
Merkulov, Sergei (16)
Zhang, Genkai, 1963 (16)
Tkachev, Vladimir (16)
Menegon, Aurelio (15)
Dimitroglou Rizell, ... (15)
Andersson, Mats, 195 ... (14)
Rozenblioum, Grigori ... (14)
Berman, Robert, 1976 (14)
Samuelsson Kalm, Håk ... (13)
Berglund, Alexander (13)
Björklund, Michael, ... (13)
Verdier, Olivier (12)
Gu, Irene Yu-Hua, 19 ... (12)
Di Rocco, Sandra (12)
Dimitroglou Rizell, ... (12)
McCormick, Stephen (11)
Kohn, Kathlén (11)
Izquierdo, Milagros (11)
Gosson, Maurice de (11)
Persson, Daniel, 197 ... (10)
Del Zotto, Michele (10)
Stevens, Jan, 1955 (10)
Berndtsson, Bo, 1950 (10)
Juhl, Andreas, 1955- (10)
Palmkvist, Jakob, 19 ... (10)
Rydell, Felix (10)
Williams, Christophe ... (9)
Mazorchuk, Volodymyr (9)
Tjatyrko, Vitalij (9)
Svensson, Martin (9)
Eriksson, Dennis, 19 ... (9)
Costa, Antonio F. (9)
Bergström, Jonas (9)
Kragh, Thomas, 1980- (8)
Kleinschmidt, Axel (8)
Lindahl, Karl-Olof, ... (8)
Hultgren, Jakob, 198 ... (8)
Westerholt-Raum, Mar ... (8)
Bergvall, Olof (8)
Golovko, Roman (8)
visa färre...
Lärosäte
Chalmers tekniska högskola (434)
Göteborgs universitet (269)
Uppsala universitet (208)
Stockholms universitet (194)
Kungliga Tekniska Högskolan (188)
Lunds universitet (74)
visa fler...
Linköpings universitet (73)
Högskolan Väst (26)
Blekinge Tekniska Högskola (25)
Umeå universitet (19)
Högskolan i Gävle (19)
Mälardalens universitet (19)
Linnéuniversitetet (19)
Mittuniversitetet (17)
Örebro universitet (14)
Luleå tekniska universitet (10)
Malmö universitet (8)
Högskolan i Skövde (7)
Högskolan i Borås (6)
Karlstads universitet (4)
Sveriges Lantbruksuniversitet (3)
Jönköping University (2)
RISE (1)
visa färre...
Språk
Engelska (1261)
Svenska (18)
Latin (3)
Tyska (2)
Franska (2)
Ryska (2)
visa fler...
Norska (1)
Italienska (1)
Kinesiska (1)
Esperanto (1)
visa färre...
Forskningsämne (UKÄ/SCB)
Naturvetenskap (1292)
Teknik (62)
Humaniora (12)
Samhällsvetenskap (8)
Lantbruksvetenskap (1)

År

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy