Reputation
4,940
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
6 16 49
Impact
~80k people reached

Jan
31
awarded  Nice Question
Jan
26
awarded  Famous Question
Jan
18
revised Laplace, Legendre, Fourier, Hankel, Mellin, Hilbert, Borel, Z…: unified treatment of transforms?
deleted 17 characters in body
Jan
18
comment Laplace, Legendre, Fourier, Hankel, Mellin, Hilbert, Borel, Z…: unified treatment of transforms?
I owe everyone an apology for taking so long to accept an answer. They are all very good, as well as difficult to digest.
Jan
18
accepted Laplace, Legendre, Fourier, Hankel, Mellin, Hilbert, Borel, Z…: unified treatment of transforms?
Jan
18
comment Laplace, Legendre, Fourier, Hankel, Mellin, Hilbert, Borel, Z…: unified treatment of transforms?
@CameronWilliams: encyclopediaofmath.org/index.php/Idempotent_analysis
Jan
18
awarded  Favorite Question
Dec
28
comment Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
@yoyo311: I plead guilty on all counts. Indeed my attempt to sharpen/formalize the informal description (of the post's first part) is pretty hopeless. I probably should get rid of it altogether... Maybe I should phrase it like this: I'm looking for a binary predicate that is "easy to compute" (as in the product of two large primes is "easy to compute"), and for which any known factoring classifier is "hard to compute" (as in factors of the product of two large primes are "hard to compute").
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
added 38 characters in body
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
deleted 153 characters in body; edited tags
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
added 9 characters in body
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
added 288 characters in body
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
added 288 characters in body
Dec
28
comment Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
@AndréNicolas: I knew that choosing the [computability] tag for this question was a bad idea...
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
edited tags
Dec
28
revised Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
edited tags
Dec
28
asked Looking for an “irreducible equivalence predicate” on $\mathbb{Z}$
Dec
25
accepted What is the name of this construction of an induced order?
Dec
25
revised What is the name of this construction of an induced order?
edited title
Dec
25
asked What is the name of this construction of an induced order?