An official website of the United States government
Milliken’s tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey’s theorem and its many variants and consequences. In this sense, Milliken’s tree theorem is paradigmatic of structural Ramsey theory, which seeks to identify the common combinatorial and logical features of partition results in general. Its investigation in this area has consequently been extensive. Motivated by a question of Dobrinen, we initiate the study of Milliken’s tree theorem from the point of view of computability theory. The goal is to understand how close it is to being algorithmically solvable, and how computationally complex are the constructions needed to prove it. This kind of examination enjoys a long and rich history, and continues to be a highly active endeavor. Applied to combinatorial principles, particularly Ramsey’s theorem, it constitutes one of the most fruitful research programs in computability theory as a whole. The challenge to studying Milliken’s tree theorem using this framework is its unusually intricate proof, and more specifically, the proof of the Halpern-Laüchli theorem, which is a key ingredient. Our advance here stems from a careful analysis of the Halpern-Laüchli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken’s tree theorem that permits us to gauge its effectivity in turn. The key combinatorial tool we develop for the inductive step is a fast-growing computable function that can be used to obtain a finitary, or localized, version of Milliken’s tree theorem. This enables us to build solutions to the full Milliken’s tree theorem using effective forcing. The principal result of this is a full classification of the computable content of Milliken’s tree theorem in terms of the jump hierarchy, stratified by the size of instance. As usual, this also translates into the parlance of reverse mathematics, yielding a complete understanding of the fragment of second-order arithmetic required to prove Milliken’s tree theorem. We apply our analysis also to several well-known applications of Milliken’s tree theorem, namely Devlin’s theorem, a partition theorem for Rado graphs, and a generalized version of the so-called tree theorem of Chubb, Hirst, and McNicholl. These are all certain kinds of extensions of Ramsey’s theorem for different structures, namely the rational numbers, the Rado graph, and perfect binary trees, respectively. We obtain a number of new results about how these principles relate to Milliken’s tree theorem and to each other, in terms of both their computability-theoretic and combinatorial aspects. In particular, we establish new structural Ramsey-theoretic properties of the Rado graph theorem and the generalized Chubb-Hirst-McNicholl tree theorem using Zucker’s notion of big Ramsey structure.
more »
« less
This content will become publicly available on June 1, 2026
Extrema of spectral band functions of two dimensional discrete periodic Schrödinger operators
We use Bézout’s theorem and Bernstein–Khovanskii–Kushnirenko theorem to analyze the level sets of the extrema of the spectral band functions of discrete periodic Schrödinger operators on Z2. These approaches improve upon previous results of Liu and Filonov–Kachkovskiy.
more »
« less
- Award ID(s):
- 2052519
- PAR ID:
- 10616726
- Publisher / Repository:
- AIP
- Date Published:
- Journal Name:
- Journal of Mathematical Physics
- Volume:
- 66
- Issue:
- 6
- ISSN:
- 0022-2488
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The computational aspects of power systems have been exploring the steady states of AC power flow for several decades. In this paper, we propose a novel approach to AC power flow calculation using resultants and discriminants for polynomials, which are primarily compiled for quadratic power flow equations. In the case of AC power flow nonlinear systems, it is not possible to determine the number of isolated solutions. However, for polynomial systems, the theorem of Bézout is the primary theorem of algebraic geometry. This study considers a certain multi-homogeneous structure in an algebraic geometry system to demonstrate that the theorem of Bézout is indeed a generalization of the fundamental theorem, among other results.more » « less
-
We prove a quantitative finiteness theorem for the number of totally geodesic hyperplanes of non-arithmetic hyperbolic n-manifolds that arise from a gluing construction of Gromov and Piatetski-Shapiro for n ≥ 3. This extends work of LindenstraussMohammadi in dimension 3. This follows from effective density theorem for periodic orbits of SO(n −1,1) acting on quotients of SO(n,1) by a lattice for n ≥ 3. The effective density result uses a number of a ideas including Margulis functions, a restricted projection theorem, and an effective equidistribution result for measures on the horospherical subgroup that are nearly full dimensional.more » « less
-
The authors correct results in “Characterizations of monadic NIP” [Trans. Amer. Math. Soc. Ser. B 8 (2021), pp. 948–970]. The notion of endless indiscernible triviality is introduced and replaces indiscernible triviality throughout, in particular in Theorem 1.1. The claim regarding the failure of 4-wqo in Theorem 1.2 is withdrawn and remains unproved.more » « less
-
NA (Ed.)In Kenneth Arrow’s last week of life at age 95, he reported that “I began my research career with an impossibility theorem. If I had time now, my last theorem would be an impossibility theorem about social choice for environmental policy.” This paper completes the formalization, proof, and discussion of the theorem that Arrow then described.more » « less
