2023/07/14 by Kevin G. Hare, Hare, Kevin G., Vávra, Tomáš
Computer Science · Mathematics · #11S82 #28A80 #Artificial intelligence #Class (philosophy) #Classical Analysis and ODEs (math.CA) #Combinatorics #Computer science #Converse #Data mining #Decimation #Dimension (graph theory) #Discrete mathematics #FOS: Mathematics #Fractal #Mathematical Dynamics and Fractals #Mathematical analysis #Mathematics #Measure (data warehouse) #Number Theory (math.NT) #Path (computing) #Pure mathematics #Self-similarity #Set (abstract data type) #Topological and Geometric Data Analysis #advanced mathematical theories
paper · pdf · doi:10.48550/arxiv.2307.07375
openalex publication_date 2023/07/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we investigate p-adic self-similar sets and p-adic self-similar measures. We show that p-adic self-similar sets are p-adic path set fractals, and that the converse is not necessarily true. For p-adic self-similar sets and p-adic self-similar measures, we show the existence of a unique essential class. We show that, under mild assumptions, the decimation of p-adic self-similar sets is maximal. For p-adic self-similar measures, we show that many results involving local dimension are similar to those of their real counterparts, with fewer complications. Most of these results use the additional structure of self-similarity, and are not true in general for p-adic path set fractals.