Visible lattice points and the chromatic zeta function of a graph
classification
🧮 math.CO
math.NT
keywords
graphlatticechromaticcyclepointszetaconfigurationscontain
read the original abstract
We study the probability that a cycle of length k in the lattice [1, n]^s does not contain more lattice points than the k vertices of the cycle. Then we generalize this problem to other configurations induced by a given graph H, introducting the chromatic zeta fuction of a graph.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.