相关论文: "Magic" numbers in Smale's 7th problem

Let $ES(n)$ be the smallest integer such that any set of $ES(n)$ points in the plane in general position contains $n$ points in convex position. In their seminal 1935 paper, Erdos and Szekeres showed that $ES(n) \leq {2n - 4\choose n-2} + 1…

We investigate the two-dimensional $\mathcal{N}=(2,2)$ supersymmetric Yang-Mills (SYM) theory on the discretized curved space (polyhedra). We first revisit that the number of supersymmetries of the continuum $\mathcal{N}=(2,2)$ SYM theory…

We consider the half-wave maps equation $$ \partial_t \vec{S} = \vec{S} \wedge |\nabla| \vec{S}, $$ where $\vec{S}= \vec{S}(t,x)$ takes values on the two-dimensional unit sphere $\mathbb{S}^2$ and $x \in \mathbb{R}$ (real line case) or $x…

We consider a stochastic nonlinear Schr\"odinger equation with multiplicative noise in an abstract framework that covers subcritical focusing and defocusing stochastic NLS in $H^1$ on compact manifolds and bounded domains. We construct a…

We study the statistics of peaks in a weak lensing reconstructed mass map of the first 450 square degrees of the Kilo Degree Survey. The map is computed with aperture masses directly applied to the shear field with an NFW-like compensated…

The study is motivated by the known fact that, in the noncompact case, the main minimum-problem of the theory of interior capacities of condensers in a locally compact space is in general unsolvable, and this occurs even under very natural…

Let $\mathcal{C}(S^{m})$ denote the set of continuous maps from the unit sphere $S^{m}$ in $\mathbb{R}^{m+1}$ into itself endowed with the supremum norm. We prove that the set $\{f^n: f\in \mathcal{C}(S^{m})~\text{and}~n\ge 2\}$ of iterated…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the…

It is well known that theorems of Lieb-Schultz-Mattis type prohibit the existence of a trivial symmetric gapped ground state in certain systems possessing a combination of internal and lattice symmetries. In the continuum description of…

In 1975, Erd\H{o}s and Sauer asked to estimate, for any constant $r$, the maximum number of edges an $n$-vertex graph can have without containing an $r$-regular subgraph. In a recent breakthrough, Janzer and Sudakov proved that any…

We study the local existence of strong solutions for the cubic nonlinear wave equation with data in $H^s(M)$, $s<1/2$, where $M$ is a three dimensional compact riemannian manifold. This problem is supercritical and can be shown to be…

We relate the existence problem of harmonic maps into $S^2$ to the convex geometry of $S^2$. On one hand, this allows us to construct new examples of harmonic maps of degree 0 from compact surfaces of arbitrary genus into $S^2$. On the…

The odd-Ramsey number $r_{\text{odd}}(n,H)$ of a graph $H$ is the minimum number of colors needed to edge-color $K_n$ so that in every copy of $H$ some color occurs an odd number of times, and the unique-Ramsey number $r_{\text{u}}(n,H)$ is…

We prove that the Cauchy problem of the mass-critical generalized KdV equation is globally well-posed in Sobolev spaces $H^s(\R)$ for $s>6/13$. Of course, we require that the mass is strictly less than that of the ground state in the…

P. M. Akhmetiev used a controlled version of the stable Hopf invariant to show that any (continuous) map N -> M between stably parallelizable compact n-manifolds, n\ne 1,2,3,7, is realizable in R^{2n}, i.e. the composition of f with an…

In this paper we investigate the asymptotic behavior of the Riesz $s$-energy of the first $N$ points of a greedy $s$-energy sequence on the unit circle, for all values of $s$ in the range $0\leq s<\infty$ (identifying as usual the case…

Linear and semidefinite programming (LP, SDP), regularisation through basis pursuit (BP) and Lasso have seen great success in mathematics, statistics, data science, computer-assisted proofs and learning. The success of LP is traditionally…

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

Mantel's theorem states that every $n$-vertex graph with $\lfloor \frac{n^2}{4} \rfloor +t$ edges, where $t>0$, contains a triangle. The problem of determining the minimum number of triangles in such a graph is usually referred to as the…

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…