ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Growths functions of repetitive graphs

A graph Γ\Gamma is called \textbf{repetitive} if for all r>0r > 0 there exists d>0d > 0 such that for all x,y∈Γx,y \in \Gamma, there exists an isomorphic copy of Br(x)B_r(x) (the ball of radius rr centered at xx) at distance less or equal to dd from yy. \

Consider two kind of growths functions for Γ\Gamma: pick x0∈Γx_0 \in \Gamma and define fx0(n)=#Bn(x0)f_{x_0}(n) = \# B_n(x_0) and f(x)=max⁡{fx(n):x∈Γ}f(x) = \max \left\{f_x(n): x \in \Gamma\right\}

What functions can be realized as growths functions of repetitive graphs?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.