9 citations · 19 across the 12 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2016★ 9 cited
A combinatorial description of topological complexity for finite spaces
Kohei Tanaka
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original f…
math.CO2016
Minimal networks for sensor counting problem using discrete Euler calculus
Kohei Tanaka
This paper proposes a method to reduce noise in acyclic sensor networks enumerating targets using the integral theory with respect to Euler characteristic. For an acyclic network (…
math.CO2015★ 1 cited
Discrete Euler integration over functions on finite categories
Kohei Tanaka
This paper provides the theory of integration with respect to Euler characteristics of finite categories. As an application, we use sensors to enumerate the targets lying on a pose…