中文
相关论文

相关论文: Pigeons do not jump high

200 篇论文

Hirst investigated a slight variant of Hindman's Finite Sums Theorem -- called Hilbert's Theorem -- and proved it equivalent over $\RCA_0$ to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural…

逻辑 · 数学 2024-01-10 Lorenzo Carlucci

Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has a Delta^1_3-minimal upper bound, or…

逻辑 · 数学 2016-09-06 Philip Welch

This note concerns the so-called pyjama problem, whether it is possible to cover the plane by finitely many rotations of vertical strips of half-width $\varepsilon$. We first prove that there exist no periodic coverings for…

组合数学 · 数学 2020-05-04 R. D. Malikiosis , M. Matolcsi , I. Z. Ruzsa

In this paper we study the problem of the existence of a least-action principle for invertible, second-order dynamical systems, discrete in time and space. We show that, when the configuration space is finite, a least-action principle does…

元胞自动机与格子气 · 物理学 2007-05-23 Gianluca Caterina , Bruce Boghosian

The famous Michael selection theorem deals with the characterisation of paracompact spaces by continuous selections of lower semi-continuous mappings in Banach spaces. In this paper, we will discuss several equivalent forms of this theorem,…

泛函分析 · 数学 2026-02-26 Valentin Gutev

The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…

逻辑 · 数学 2018-05-01 Pantelis E. Eleftheriou

In \cite{J}, Theorem 4.2, Jockusch proves that for any computable k-coloring of pairs of integers, there is an infinite $\Pi^0_2$ homogeneous set. The proof uses a countable collection of $\Pi^0_2$ sets as potential infinite homogeneous…

逻辑 · 数学 2015-07-14 Gregory Igusa , Henry Towsner

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

组合数学 · 数学 2023-10-16 Shi-Chao Chen

The general maximum principle is proved for an infinite dimensional controlled stochastic evolution system. The control is allowed to take values in a nonconvex set and enter into both drift and diffusion terms. The operator-valued backward…

最优化与控制 · 数学 2012-08-07 Kai Du , Qingxin Meng

In 1952 Bing published a wild (not topologically conjugate to smooth) involution $I$ of the 3-sphere $S^3$. But exactly how wild is it, analytically? We prove that any involution $I^h$, topologically conjugate to $I$, must have a nearly…

几何拓扑 · 数学 2023-04-05 Michael Freedman , Michael Starbird

We state and prove an equivariant version of Lehmer's conjecture on heights, generalizing papers by Zagier (1993) and Dresden (1998) which are special cases of this theorem. We also extend their three cases to a full classification of all…

数论 · 数学 2020-11-10 Jan-Willem M. van Ittersum

We introduce and investigate a new model of a finite number of particles jumping forward on the real line. The jump lengths are independent of everything, but the jump rate of each particle depends on the relative position of the particle…

概率论 · 数学 2015-01-08 Marton Balazs , Miklos Z. Racz , Balint Toth

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

组合数学 · 数学 2010-10-14 William J. Keith

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

概率论 · 数学 2024-12-23 Tom Hutchcroft , Minghao Pan

Several recent problems in the representation theory of finite groups require determining whether certain characters of almost simple groups belong to the principal block. Since the values of these characters are not yet known, we employ…

表示论 · 数学 2025-08-05 Richard Lyons , J. Miquel Martínez , Gabriel Navarro , Pham Huu Tiep

Conventional wisdom holds that any region of 3-space contains infinitely many points, and the Planck length scale determines the uncertainty in every measurement of distance between two separate points. Against such a backdrop, this…

综合物理 · 物理学 2023-08-25 Arkady Bolotin

This paper views the honeycomb conjecture and the Kepler problem essentially as extreme value problems and solves them by partitioning 2-space and 3-space into building blocks and determining those blocks that have the universal extreme…

综合数学 · 数学 2009-07-27 Fu-Gao Song , Francis Austin

The Erd\H{o}s-Anning theorem states that every point set in the Euclidean plane with integer distances must be either collinear or finite. More strongly, for any (non-degenerate) triangle of diameter~$\delta$, at most $O(\delta^2)$ points…

度量几何 · 数学 2026-04-13 David Eppstein

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

逻辑 · 数学 2021-10-14 Denis R. Hirschfeldt , Asher M. Kach , Antonio Montalbán

The Mordell--Lang conjecture for abelian varieties states that the intersection of an algebraic subvariety $X$ with a subgroup of finite rank is contained in a finite union of cosets contained in $X$. In this article, we prove a uniform…

数论 · 数学 2026-03-27 Ziyang Gao , Tangli Ge , Lars Kühne
‹ 上一页 1 8 9 10 下一页 ›