Combinatorial proofs of two theorems of Lutz and Stull

02/05/2020
by   Tuomas Orponen, et al.
0

The purpose of this note is to give combinatorial-geometric proofs for two Marstrand-type projection theorems for arbitrary, possibly non-analytic, sets, originally due to Lutz and Stull. The original proofs were based on algorithmic information theory, and the notion of pointwise dimension. In this note, the proofs instead rely on δ-discretised variants of a standard "potential theoretic" argument, and the pigeonhole principle.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2014

Proofs of two Theorems concerning Sparse Spacetime Constraints

In the SIGGRAPH 2014 paper [SvTSH14] an approach for animating deformabl...
research
04/16/2020

The Dimensions of Hyperspaces

We use the theory of computing to prove general hyperspace dimension the...
research
12/13/2017

Potential-Function Proofs for First-Order Methods

This note discusses proofs for convergence of first-order methods based ...
research
10/16/2022

A Formal Logic for Formal Category Theory

We present a domain-specific type theory for constructions and proofs in...
research
07/13/2020

On the Parallel Tower of Hanoi Puzzle: Acyclicity and a Conditional Triangle Inequality

A generalization of the Tower of Hanoi Puzzle—the Parallel Tower of Hano...
research
05/10/2020

Dynamic IFC Theorems for Free!

We show that noninterference and transparency, the key soundness theorem...
research
02/15/2022

A new discrete theory of pseudoconvexity

Recently geometric hypergraphs that can be defined by intersections of p...

Please sign up or login with your details

Forgot password? Click here to reset