Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A simple information theoretical proof of the Fueter-Pólya Conjecture (1809.09871v1)

Published 26 Sep 2018 in cs.DM

Abstract: We present a simple information theoretical proof of the Fueter-P\'olya Conjecture: there is no polynomial pairing function that defines a bijection between the set of natural numbers N and its product set N2 of degree higher than 2. We introduce the concept of information efficiency of a function as the balance between the information in the input and the output. We show that 1) Any function defining a computable bijection between an infinite set and the set of natural numbers is information efficient, 2) the Cantor functions satisfy this condition, 3) any hypothetical higher order function defining such a bijection also will be information efficient, i.e. it stays asymtotically close to the Cantor functions and thus cannot be a higher order function.

Citations (2)

Summary

We haven't generated a summary for this paper yet.