Abstract

We study word metrics on \({\mathbb{Z}^d}\) by developing tools that are fine enough to measure dependence on the generating set. We obtain counting and distribution results for the words of length n. With this, we show that counting measure on spheres always converges to cone measure on a polyhedron (strongly, in an appropriate sense). Using the limit measure, we can reduce probabilistic questions about word metrics to problems in convex geometry of Euclidean space. We give several applications to the statistics of “size-like” functions.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.