Skip to main content
Martin Clever's user avatar
Martin Clever's user avatar
Martin Clever's user avatar
Martin Clever
  • Member for 1 year, 6 months
  • Last seen more than a week ago
accepted
answered
Loading…
revised
Efficient algorithm for graph problem
added 108 characters in body
Loading…
comment
Efficient algorithm for graph problem
No, the solution generally requires a path with repeating vertices and the graph is not acyclic.
Loading…
revised
Loading…
awarded
Loading…
awarded
comment
Matrix quantization and effect on singular values
The singular values of $A$ are the eigenvalues of $A^*A$. Findung a bound on those eigenvalues will probably be easier.
Loading…
revised
Generalization of SVD algorithm
added 212 characters in body
Loading…
comment
Generalization of SVD algorithm
@DimaPasechnik what do you mean by "expressible"? $\mathbb{R}$ is not computable, meaning an implementation requires approximation but the algorithm still is correct.
revised
Generalization of SVD algorithm
added 12 characters in body
Loading…
comment
Generalization of SVD algorithm
The norm does not matter, but I'll write Euclidean norm in the question to make it easier to understand.
revised
Generalization of SVD algorithm
added 13 characters in body
Loading…
asked
Loading…
revised
Why don't Zeilberger and Gosper's algorithms contradict Richardson's theorem?
Confusion between hypergeometric/rational "function" and "term". In most litriture, this would classify as a hypergeometric/rational term (even though it is a function, while a hypergeometric function is a "function [...] represented by the hypergeometric series" (wikipedia Hypergeometric Function).
Loading…