担心
发表于 2025-3-28 14:55:36
Moduli, Motives, MirrorsThis talk is dedicated to various aspects of Mirror Symmetry. It summarizes some of the mathematical developments that took place since M. Kontsevich’s report at the Zürich ICM and provides an extensive, although not exhaustive bibliography.
破译密码
发表于 2025-3-28 19:45:07
Advances on Extremal Problems in Number Theory and CombinatoricsTo keep an acceptable size, references not listed at the end are given by the Bibliography of the recent book and/or the page number of .
gusher
发表于 2025-3-28 23:22:59
Spectral Analysis of Nonrelativistic Quantum ElectrodynamicsI review the research results on spectral properties of atoms and molecules coupled to the quantized electromagnetic field or on simplified models of such systems obtained during the past decade. My main focus is on the results I have obtained in collaboration with . and . .
CRATE
发表于 2025-3-29 05:45:57
The Random Graph RevisitedThe random graph, or Rado’s graph (the unique countable homogeneous graph) has made an appearance in many parts of mathematics since its first occurrences in the early 1960s. In this paper I will discuss some old and new results on this remarkable structure.
草率男
发表于 2025-3-29 09:41:24
http://reply.papertrans.cn/32/3168/316745/316745_45.png
分解
发表于 2025-3-29 12:18:53
http://reply.papertrans.cn/32/3168/316745/316745_46.png
gain631
发表于 2025-3-29 16:29:04
http://reply.papertrans.cn/32/3168/316745/316745_47.png
FLIT
发表于 2025-3-29 22:06:25
Progress in Mathematicshttp://image.papertrans.cn/e/image/316745.jpg
elastic
发表于 2025-3-30 01:21:01
Die akademische Psychologie unter der Lupeameter deformation, where one parameter controls the generalization from points to loops, and the other parameter controls the sum over topologies of Riemann surfaces. The final mathematical formulation of M-theory will have to make contact with the theory of vector bundles, K-theory and non-commuta
辫子带来帮助
发表于 2025-3-30 05:35:20
Die gesamtgesellschaftliche Rolle der Machtsis reduction algorithms by using the concept of a “flag”. In our reformulation, lattice basis reduction algorithms are more appropriately called “flag reduction” algorithms. We address a problem that arises when one attempts to find a particularly good flag for a given lattice.