201 reputation
18
bio website
location
age
visits member for 2 years, 5 months
seen 15 hours ago

Apr
2
comment Visually stunning math concepts which are easy to explain
@joeA: it's not as smooth as regenerating at a higher framerate, but gfycat.com allows one to view gifs at different speeds: gfycat.com/TintedWatchfulAxisdeer#?speed=0.25
Apr
2
revised Why do we use lowercase $k$ for fields?
closing paren
Apr
2
comment Why do we use lowercase $k$ for fields?
@WillJagy: yes, I deliberately said "not uncommon" rather than "usual". F and K seem to be at least as common as k.
Apr
2
awarded  Yearling
Apr
2
asked Why do we use lowercase $k$ for fields?
Mar
14
answered need orthogonal basis for R3. i'm given one of them. how do i find the rest?
Mar
14
comment Is this form of finite induction correctly called “downward induction”
That may be a name for this principle, but a Google search indicates "finite descent" is even less used than "downward induction". It also seems less transparent to somebody who doesn't know the term. And according to this, the term is reserved for a contrapositive/negative version of the principle.
Mar
14
asked Is this form of finite induction correctly called “downward induction”
Mar
8
awarded  Critic
Mar
8
revised Weak law of large numbers: counterexample for independent but not i.i.d. variables
more detailed title
Mar
8
suggested suggested edit on Weak law of large numbers: counterexample for independent but not i.i.d. variables
Mar
8
comment 3-SAT vs P/poly
You appear to be confusing a circuit for a formula with a circuit for SAT. You are correct that a formula in 3-CNF can be converted to a circuit with polynomial size. But to show that 3-SAT is in P/poly, we must find a family of circuits which take a circuit as input (or more precisely, a binary encoding of a formula in 3-CNF) and output whether it is satisfiable. A circuit for a formula is not the same as a circuit for satisfiability.
Nov
10
comment What are some examples of notation that really improved mathematics?
@NateEldredge: $f(n) \in n! + o(n^2)$ isn't that clunky
Sep
7
accepted Order structure of asymptotics
Jul
25
asked Origin of $\mapsto$ notation
Jul
25
awarded  Editor
Jul
25
comment Order structure of asymptotics
I restricted it to non-decreasing functions to eliminate oscillating functions.
Jul
25
revised Order structure of asymptotics
added 27 characters in body
Jul
25
comment Order structure of asymptotics
I think the simplest way to get what I'm thinking of is just to restrict to monotone functions.
Jul
25
comment Order structure of asymptotics
Ah, it seems that Wikipedia's definition is different from what I had assumed; in my thinking, for example, a constant function is in O(sin). Basically, one needs to replace a limit with a limit superior.