Highly irregular separated nets

03/14/2019
by   Michael Dymond, et al.
0

In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate that such notions also give rise to distinct equivalence classes. Put differently, we find occurrences of particularly strong divergence of separated nets from the integer lattice. Our approach generalises that of Burago and Kleiner and McMullen which takes place largely in a continuous setting. Existence of irregular separated nets is verified via the existence of non-realisable density functions ρ [0,1]^d→(0,∞). In the present work we obtain stronger types of non-realisable densities.

READ FULL TEXT
research
04/30/2021

A Decidable Equivalence for a Turing-complete, Distributed Model of Computation

Place/Transition Petri nets with inhibitor arcs (PTI nets for short), wh...
research
04/03/2021

Place Bisimilarity is Decidable, Indeed!

Place bisimilarity is a behavioral equivalence for finite Petri nets, pr...
research
07/10/2022

Abstract Processes in the Absence of Conflicts in General Place/Transition Systems

Goltz and Reisig generalised Petri's concept of processes of one-safe Pe...
research
07/17/2017

On weak ε-nets and the Radon number

We show that the Radon number characterizes the existence of weak nets i...
research
06/02/2023

Automated Polyhedral Abstraction Proving

We propose an automated procedure to prove polyhedral abstractions for P...
research
04/12/2022

Methods for Efficient Unfolding of Colored Petri Nets

Colored Petri nets offer a compact and user friendly representation of t...
research
08/16/2017

A fix-point characterization of Herbrand equivalence of expressions in data flow frameworks

The problem of determining Herbrand equivalence of terms at each program...

Please sign up or login with your details

Forgot password? Click here to reset