【摘 要】
：
We will survey whats known,and whats not known,about super Riemann surfaces,their supermoduli spaces,and their relevance to string perturbation theory.
【机 构】
：
UniversityofPennsylvania
【出 处】
：
三亚国际数学论坛(String Math2015)
论文部分内容阅读
We will survey whats known,and whats not known,about super Riemann surfaces,their supermoduli spaces,and their relevance to string perturbation theory.
其他文献
The original EKR(Erd(o)s-Ko-Rado)theorem describes the size and structure of the largest collection of intersecting k-subsets of the set [n]={1,2,…,n}.
In many fields of human activity we have to find an unknown object with as little cost as possible.A mathematical model of such problems and first general r
For two given graphs G and H,the Ramsey number R(G,H)is the smallest integer N such that any red-blue edge colorings of a complete graph Kn,either there is
Let G be an edge-bicolored graph where each edge is colored either blue or red.We discuss problems of obtaining a subgraph H from G that simultaneously sati
A k-clique-coloring of a graph G is an assignment of k colors to the vertices of G such that no maximal clique with at least two vertices is monochromatic.
In this talk,we first review progress of some research topics on symmetries of graphs,such as arc-transitive graphs,half-arc-transitive graphs,edge-primitiv
In this paper we give a proof of Enomotos conjecture for graphs of sufficiently large order.
There are various positivity problems in combinatorics,such as the unimodality,log-concavity and log-convexity of combinatorial sequences,and the realrooted
Kelmans and Seymour independently conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5.Ma and Yu proved that this co
Left-right paths of plane graphs were introduced by H.Shank in 1970s.They are equivalent to straight-ahead walks of medial graphs of plane graphs and compon