An official website of the United States government
Abstract We study the following mean field equation on a flat torus $$T:=\mathbb{C}/(\mathbb{Z}+\mathbb{Z}\tau )$$: $$\begin{equation*} \varDelta u + \rho \left(\frac{e^{u}}{\int_{T}e^u}-\frac{1}{|T|}\right)=0, \end{equation*}$$where $$ \tau \in \mathbb{C}, \mbox{Im}\ \tau>0$$, and $|T|$ denotes the total area of the torus. We first prove that the solutions are evenly symmetric about any critical point of $$u$$ provided that $$\rho \leq 8\pi $$. Based on this crucial symmetry result, we are able to establish further the uniqueness of the solution if $$\rho \leq \min{\{8\pi ,\lambda _1(T)|T|\}}$$. Furthermore, we also classify all one-dimensional solutions by showing that the level sets must be closed geodesics.
more »
« less
GÖDEL DIFFEOMORPHISMS
Abstract In 1932, von Neumann proposed classifying the statistical behavior of differentiable systems. Joint work of B. Weiss and the author proved that the classification problem is complete analytic. Based on techniques in that proof, one is able to show that the collection of recursive diffeomorphisms of the 2-torus that are isomorphic to their inverses is $$\Pi ^0_1$$ -hard via a computable 1-1 reduction. As a corollary there is a diffeomorphism that is isomorphic to its inverse if and only if the Riemann Hypothesis holds, a different one that is isomorphic to its inverse if and only if Goldbach’s conjecture holds and so forth. Applying the reduction to the $$\Pi ^0_1$$ -sentence expressing “ZFC is consistent” gives a diffeomorphism T of the 2-torus such that the question of whether $$T\cong T^{-1}$$ is independent of ZFC.
more »
« less
- Award ID(s):
- 1700143
- PAR ID:
- 10454943
- Date Published:
- Journal Name:
- The Bulletin of Symbolic Logic
- Volume:
- 26
- Issue:
- 3-4
- ISSN:
- 1079-8986
- Page Range / eLocation ID:
- 219 to 223
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Abstract A search for direct pair production of scalar partners of the top quark (top squarks or scalar third-generation up-type leptoquarks) in the all-hadronic $$t{\bar{t}}$$ t t ¯ plus missing transverse momentum final state is presented. The analysis of 139 $$\hbox {fb}^{-1}$$ fb - 1 of $${\sqrt{s}=13}$$ s = 13 TeV proton–proton collision data collected using the ATLAS detector at the LHC yields no significant excess over the Standard Model background expectation. To interpret the results, a supersymmetric model is used where the top squark decays via $${\tilde{t}} \rightarrow t^{(*)} {\tilde{\chi }}^0_1$$ t ~ → t ( ∗ ) χ ~ 1 0 , with $$t^{(*)}$$ t ( ∗ ) denoting an on-shell (off-shell) top quark and $${\tilde{\chi }}^0_1$$ χ ~ 1 0 the lightest neutralino. Three specific event selections are optimised for the following scenarios. In the scenario where $$m_{{\tilde{t}}}> m_t+m_{{\tilde{\chi }}^0_1}$$ m t ~ > m t + m χ ~ 1 0 , top squark masses are excluded in the range 400–1250 GeV for $${\tilde{\chi }}^0_1$$ χ ~ 1 0 masses below 200 GeV at 95% confidence level. In the situation where $$m_{{\tilde{t}}}\sim m_t+m_{{\tilde{\chi }}^0_1}$$ m t ~ ∼ m t + m χ ~ 1 0 , top squark masses in the range 300–630 GeV are excluded, while in the case where $$m_{{\tilde{t}}}< m_W+m_b+m_{{\tilde{\chi }}^0_1}$$ m t ~ < m W + m b + m χ ~ 1 0 (with $$m_{{\tilde{t}}}-m_{{\tilde{\chi }}^0_1}\ge 5$$ m t ~ - m χ ~ 1 0 ≥ 5 GeV), considered for the first time in an ATLAS all-hadronic search, top squark masses in the range 300–660 GeV are excluded. Limits are also set for scalar third-generation up-type leptoquarks, excluding leptoquarks with masses below 1240 GeV when considering only leptoquark decays into a top quark and a neutrino.more » « less
-
Abstract Recall that B is PA relative to A if B computes a member of every nonempty $$\Pi ^0_1(A)$$ class. This two-place relation is invariant under Turing equivalence and so can be thought of as a binary relation on Turing degrees. Miller and Soskova [23] introduced the notion of a $$\Pi ^0_1$$ class relative to an enumeration oracle A , which they called a $$\Pi ^0_1{\left \langle {A}\right \rangle }$$ class. We study the induced extension of the relation B is PA relative to A to enumeration oracles and hence enumeration degrees. We isolate several classes of enumeration degrees based on their behavior with respect to this relation: the PA bounded degrees, the degrees that have a universal class, the low for PA degrees, and the $${\left \langle {\text {self}\kern1pt}\right \rangle }$$ -PA degrees. We study the relationship between these classes and other known classes of enumeration degrees. We also investigate a group of classes of enumeration degrees that were introduced by Kalimullin and Puzarenko [14] based on properties that are commonly studied in descriptive set theory. As part of this investigation, we give characterizations of three of their classes in terms of a special sub-collection of relativized $$\Pi ^0_1$$ classes—the separating classes. These three can then be seen to be direct analogues of three of our classes. We completely determine the relative position of all classes in question.more » « less
-
Abstract Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton–Watson trees. For example, let $$\mathcal{T}_1$$ be the event that a Galton–Watson tree is infinite and let $$\mathcal{T}_2$$ be the event that it contains an infinite binary tree starting from its root. These events satisfy similar recursive properties: $$\mathcal{T}_1$$ holds if and only if $$\mathcal{T}_1$$ holds for at least one of the trees initiated by children of the root, and $$\mathcal{T}_2$$ holds if and only if $$\mathcal{T}_2$$ holds for at least two of these trees. The probability of $$\mathcal{T}_1$$ has a continuous phase transition, increasing from 0 when the mean of the child distribution increases above 1. On the other hand, the probability of $$\mathcal{T}_2$$ has a first-order phase transition, jumping discontinuously to a non-zero value at criticality. Given the recursive property satisfied by the event, we describe the critical child distributions where a continuous phase transition takes place. In many cases, we also characterise the event undergoing the phase transition.more » « less
-
The Gyárfás–Sumner conjecture says that for every tree T and every integer t ≥ 1, if G is a graph with no clique of size t and with sufficiently large chromatic number, then G contains an induced subgraph isomorphic to T. This remains open, but we prove that under the same hypotheses, G contains a subgraph H isomorphic to T that is “path-induced”; that is, for some distinguished vertex r, every path of H with one end r is an induced path of G.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1017/bsl.2020.36
