中文
相关论文

相关论文: Pigeons do not jump high

200 篇论文

The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…

数论 · 数学 2018-07-18 Jean-Louis Sikorav

We prove:(1) the existence, for every integer n > 3, of a noncompact smooth n-dimensional topological manifold whose diffeomorphism group contains an isomorphic copy of every finitely presented group; (2) a finiteness theorem on finite…

群论 · 数学 2014-01-07 Vladimir L. Popov

We develop a general framework for infinite-dimensional Ramsey theory with and without pigeonhole principle, inspired by Gowers' Ramsey-type theorem for block sequences in Banach spaces and by its exact version proved by Rosendal. In this…

逻辑 · 数学 2020-01-22 Noé de Rancourt

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

逻辑 · 数学 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural corecursion? Structural corecursion is an elegant technique,…

编程语言 · 计算机科学 2026-03-05 Zena M. Ariola , Paul Downen , Hugo Herbelin

We prove that the pigeonhole upper bound $\lambda(s,m) \leq \binom{m}{2}(s+1)$ is asymptotically tight whenever $s/\!\sqrt{m} \to \infty$. In particular, $\lambda(s,m) \sim \binom{m}{2}\,s$ in this regime. As corollaries: $\lambda(n,n)/n^3…

组合数学 · 数学 2026-02-18 Jesse Geneson

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

数论 · 数学 2014-10-21 Apoloniusz Tyszka

We study the reverse mathematics of pigeonhole principles for finite powers of the ordinal $\omega$. Four natural formulations are presented and their relative strengths are compared. In the analysis of the pigeonhole principle for…

逻辑 · 数学 2015-11-03 Jared R. Corduan , François G. Dorais

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

数论 · 数学 2009-07-16 L. Bary-Soroker

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

综合数学 · 数学 2023-07-31 Mbakiso Fix Mothebe

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

逻辑 · 数学 2008-01-15 Arnold W. Miller

Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…

复变函数 · 数学 2014-02-26 P. J. Rippon , G. M. Stallard

We give a construction of an infinite set of points $A$ in $\mathbb{R}^2$ such that any subset $P\subseteq A$ has a constant density subset $P'$ with no three points collinear and yet $A$ cannot be separated into finitely many subsets such…

组合数学 · 数学 2026-02-26 Moe Putterman , Mehtaab Sawhney , Gregory Valiant

Which finite sets $P \subseteq \mathbb{Z}^r$ with $|P| \ge 3$ have the following property: for every $A \subseteq [N]^r$, there is some nonzero integer $d$ such that $A$ contains $(\alpha^{|P|} - o(1))N^r$ translates of $d \cdot P = \{d p :…

组合数学 · 数学 2021-08-02 Ashwin Sah , Mehtaab Sawhney , Yufei Zhao

We show that the statement ``In every separable pseudometric space there is a maximal non-strictly \delta-separated set.'' implies the axiom of choice for countable families of sets. This gives answers to a question of Dybowski and…

逻辑 · 数学 2026-01-14 Michał Dybowski , Przemyslaw Górka , Paul Howard

Given a set P of points on the plane, a polygon with vertices in P is said to be empty if it contains no element of P in its interior. We show that every set of n points in general position on the plane determines at least…

组合数学 · 数学 2026-03-20 Omar Astudillo-Marbán , Oriol Solé-Pi

Motivated by work of Dragt and Abell on accelerator physics, we study the completion of symplectic jets by polynomial maps of low degrees. We use Anders\'en-Lempert Theory to prove that symplectic completions always exist, and we prove the…

代数几何 · 数学 2013-08-19 Erik Loew , Jorge V. Pereira , Han Peters , Erlend F. Wold

Let A, B and S be three subsets of a finite Abelian group G. The restricted sumset of A and B with respect to S is defined as A\wedge^{S} B= {a+b: a in A, b in B and a-b not in S}. Let L_S=max_{z in G}| {(x,y): x,y in G, x+y=z and x-y in…

数论 · 数学 2013-05-14 Yahya ould Hamidoune , Susana C. Lopez , Alain Plagne

The big-line-big-clique conjecture states that for all $k,\ell\geq2$ there is an integer $n$ such that every finite set of at least $n$ points in the plane contains $\ell$ collinear points or $k$ pairwise visible points. We show that this…

组合数学 · 数学 2010-08-19 Attila~Pór , David R. Wood

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

计算复杂性 · 计算机科学 2024-11-13 Albert Atserias , Iddo Tzameret