Mathematical Foundations of Computer Science 2005
From MaRDI portal
(Redirected from Publication:5492865)
Mathematical Foundations of Computer Science 2005 (scientific article; zbMATH DE number 5065393)
Mathematical Foundations of Computer Science 2005 (scientific article; zbMATH DE number 5065393)
Abstract: The zeta-dimension of a set A of positive integers is the infimum s such that the sum of the reciprocals of the s-th powers of the elements of A is finite. Zeta-dimension serves as a fractal dimension on the positive integers that extends naturally usefully to discrete lattices such as the set of all integer lattice points in d-dimensional space. This paper reviews the origins of zeta-dimension (which date to the eighteenth and nineteenth centuries) and develops its basic theory, with particular attention to its relationship with algorithmic information theory. New results presented include extended connections between zeta-dimension and classical fractal dimensions, a gale characterization of zeta-dimension, and a theorem on the zeta-dimensions of pointwise sums and products of sets of positive integers.
Recommendations
- Distribution of digits in integers: fractal dimensions and zeta functions
- Zeta functions of discrete self-similar sets
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Zeta functions of discrete self-similar sets and applications to point configuration and sum-product-type problems
- Zeta functions and solutions of Falconer-type problems for self-similar subsets of \(\mathbb{Z}^n\)
Cited in
(14)- Strict self-assembly of discrete Sierpinski triangles
- Fractal dimension of assemblies in the abstract tile assembly model
- Scaled pier fractals do not strictly self-assemble
- Zeta phenomenology
- Representation of maxitive measures: An overview
- Self-assembly of Discrete Self-similar Fractals
- Distribution of digits in integers: fractal dimensions and zeta functions
- Zeta functions of discrete self-similar sets and applications to point configuration and sum-product-type problems
- Limitations of self-assembly at temperature 1
- Self-assembly of infinite structures: a survey
- Strict self-assembly of discrete self-similar fractals in the abstract tile assembly model
- On exponential densities and limit ratios of subsets of \(\mathbb{N}\)
- Self-assembly of discrete self-similar fractals
- Complex network dimension and path counts
This page was built for publication: Mathematical Foundations of Computer Science 2005
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492865)