Reputation
6,441
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
10 37
Impact
~99k people reached

Apr
20
reviewed Approve fibre-bundles tag wiki
Apr
20
reviewed Approve fibre-bundles tag wiki excerpt
Apr
20
reviewed Approve connections tag wiki
Apr
20
reviewed Approve Hausdorff dimension of sequence space
Apr
20
reviewed Approve grothendieck-riemann-roch tag wiki
Apr
20
reviewed Approve lorentzian-geometry tag wiki excerpt
Apr
20
comment Complexity of solving systems of linear diophantine equations
see my answer. still, AFAIK, the transformations needed are explicit.
Apr
20
answered Complexity of solving systems of linear diophantine equations
Apr
20
comment Complexity of solving systems of linear diophantine equations
IIRC, the transformation matrices can be trivially recovered, as they basically trace the steps taken by the SNF computation.
Apr
20
comment Complexity of solving systems of linear diophantine equations
OK - by the way, have a look at sciencedirect.com/science/article/pii/S0024379598100125
Apr
20
comment Complexity of solving systems of linear diophantine equations
I think you should be more specific regarding what you mean by "solved". E.g. one may think of $b=0$ and $x$ being an infinite set (so no finite time, leave alone polynomial), or a basis of a $\mathbb{Z}$-lattice, or yet something else...
Apr
20
reviewed Approve albert-algebras tag wiki
Apr
20
reviewed Approve syzygies tag wiki excerpt
Apr
20
reviewed Approve syzygies tag wiki
Apr
20
reviewed Approve fans tag wiki excerpt
Apr
20
reviewed Approve albert-algebras tag wiki excerpt
Apr
20
reviewed Approve thesis tag wiki
Apr
20
reviewed Approve fans tag wiki
Apr
20
reviewed Approve thesis tag wiki excerpt
Apr
19
comment Intuition about Toroidal Embeddings
It would be great if there was an example of some "really non-convex" polyhedron, e.g. a triangulation of a torus in $\mathbb{R}^3$ corresponding to some explicit variety...