English
Related papers

Related papers: Pigeons do not jump high

200 papers

We prove, under a computational complexity hypothesis, that it is consistent with the true universal theory of p-time algorithms that a specific p-time function extending $n$ bits to $m \geq n^2$ bits violates the dual weak pigeonhole…

Logic · Mathematics 2021-05-18 Jan Krajicek

In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…

Computational Complexity · Computer Science 2012-06-04 Emmanuel Jeandel , Pascal Vanier

We find upper and lower bounds of the multiplicities of irreducible admissible representations $\pi$ of a semisimple Lie group $G$ occurring in the induced representations $Ind_H^G\tau$ from irreducible representations $\tau$ of a closed…

Representation Theory · Mathematics 2013-10-09 Toshiyuki Kobayashi , Toshio Oshima

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN$_k^\pm$ theorem. The proofs do not use of the concept of ultrafilter.

Combinatorics · Mathematics 2019-10-04 Ryszard Frankiewicz , Sławomir Szczepaniak

A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…

Category Theory · Mathematics 2009-09-29 Brian J. Day

We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic…

Logic in Computer Science · Computer Science 2015-07-01 Dexter Kozen

The Jump Inversion Theorem says that for every real $A \ge_T 0'$ there is a real $B$ such that $A \equiv_T B' \equiv_T B \oplus 0'$. A known refinement of this theorem says that we can choose $B$ to be a member of any special $\Pi^0_1$…

Logic · Mathematics 2021-02-12 Hayden R. Jananthan , Stephen G. Simpson

We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are…

General Topology · Mathematics 2015-07-09 Santi Spadaro

We consider the Hardy-H\'enon system $-\Delta u =|x|^a v^p$, $-\Delta v =|x|^b u^q$ with $p,q>0$ and $a,b\in {\mathbb R}$ and we are concerned in particular with the Liouville property, i.e. the nonexistence of positive solutions in the…

Analysis of PDEs · Mathematics 2018-10-08 Quoc Hung Phan

This paper makes 3 contributions. First, it generalizes the Lindeberg\textendash Feller and Lyapunov Central Limit Theorems to Hilbert Spaces by way of $L^2$. Second, it generalizes these results to spaces in which sample failure and…

Statistics Theory · Mathematics 2022-12-12 Julian Morimoto

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

Combinatorics · Mathematics 2015-08-07 Michael H. Albert

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

Combinatorics · Mathematics 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class superhigh$^\Diamond$, and show that it contains some,…

Logic · Mathematics 2014-08-14 André Nies , Bjørn Kjos-Hanssen

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

A class of non-compact billiards is introduced, namely the infinite step billiards, i.e., systems of a point particle moving freely in the domain $\Omega = \bigcup_{n\in\N} [n,n+1] \times [0,p_n]$, with elastic reflections on the boundary;…

chao-dyn · Physics 2008-02-03 Mirko Degli Esposti , Gianluigi Del Magno , Marco Lenci

The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…

Number Theory · Mathematics 2012-03-13 Ruslan Sharipov

In this paper, we establish the following Liouville theorem for fractional \emph{p}-harmonic functions. {\em Assume that $u$ is a bounded solution of $$(-\lap)^s_p u(x) = 0, \;\; x \in \mathbb{R}^n,$$ with $0<s<1$ and $p \geq 2$. Then $u$…

Analysis of PDEs · Mathematics 2019-05-27 Wenxiong Chen , Leyun Wu

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

Computational Complexity · Computer Science 2020-04-21 Justin Holmgren , Alexander S. Wein

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

Combinatorics · Mathematics 2019-02-04 Shishuo Fu , Dazhao Tang , Ae Ja Yee
‹ Prev 1 4 5 6 7 8 10 Next ›