Abstract
The problem I ultimately want to solve, and its solution, is described in the paper Target Enumeration via Euler Characteristic Integrals by Baryshnikov and Ghrist. My goal here is to show how to implement that solution on a computer, and by doing so make it accessible to a wider audience.
Thanks to @alpheccar for tweeting about the original paper.
Sigfpe, is the following part correct?
ReplyDelete> So we'd also like this property:
> count (n `scale` f ) = count f
> It's easy to see that that gsum actually has this property for n > 0:
> gsum (n `scale` f ) = n^2 * gsum f
As I understand, you want count to remain invariant under scaling, but the function gsum does not have this property?
Am I guilty of what Conal Elliot now calls "vague pronoun referent"? The 'this' refers to the following property, not the one on the line before.
ReplyDeleteA count function would be completely invariant under scaling.
gsum isn't completely invariant. But it *does* have the alternative transformation property I describe.
To make this absolutely unambiguous, compare
gsum test1
with
gsum (2 `scale` test1).
The return value of gsum changes by a factor of 2^2.
Ah, that clears things up.
ReplyDelete> Am I guilty of what Conal Elliot now calls "vague pronoun referent"?
Well, yes. I was confused as I thought "this" in the second sentence referred to the previous property. Now knowing what you actually meant, the sentence reads differently (when reading out loud, there seems to be an emphasis on "this property").
Writing clearly is tough! Because of Conal's advice I explicitly searched for vague pronoun referents and thought I had eliminated them.
ReplyDeleteAnyway, I think special_property_2 is cool so keep at it!