Universal bounds and an exact uniformly recurrent family
Statement
Growths functions of repetitive graphs
A graph is called \textbf{repetitive} if for all there exists such that for all , there exists an isomorphic copy of (the ball of radius centered at ) at distance less or equal to from . \
Consider two kind of growths functions for : pick and define and
What functions can be realized as growths functions of repetitive graphs?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.