Thomas Klimpel

Munich, Germany

http://jakitoimgeisterhaus.blogspot.de/

My past research interests included differential algebraic equations, nonlinear analysis and relations between symmetries and structural properties.

I recently investigated hierarchical structures, starting from group cohomology, continuing with semi-group theory and ending with lattices and universal algebra.

top accounts reputation activity subscriptions

How did first-order logic come to be the dominant formal logic?

logic history-of-philosophy asked Apr 17, 2012 at 23:57

philosophy.stackexchange.com

30 votes

Proof refutation: Amateur reviews of ambitious CoRR papers

soft-question graph-isomorphism paper-review ppad asked Oct 3, 2016 at 15:18

cstheory.stackexchange.com

26 votes

Was von Neumann's 1954 ICM address "Unsolved Problems in Mathematics" outdated?

mathematical-physics math-history von-neumann-algebras quantum-field-theory nonclassical-logic asked Apr 2, 2017 at 14:32

math.stackexchange.com

20 votes

How to address numerical non-associativity for parallel reduction?

parallel-computing reproducibility asked May 29, 2012 at 21:21

scicomp.stackexchange.com

19 votes

Is there an O(n log n) algorithm for 4D line simplification?

reference-request computational-geometry randomized-algorithms asked May 8, 2014 at 10:34

cs.stackexchange.com

18 votes

Can Schwartz-Zippel be formulated for commutative rings instead of fields?

co.combinatorics ac.commutative-algebra ra.rings-and-algebras polynomials computational-complexity asked Nov 3, 2014 at 8:04

mathoverflow.net

17 votes

Is it decidable whether a pushdown automaton recognizes a given regular language?

computability undecidability pushdown-automata asked Apr 25, 2015 at 10:01

cs.stackexchange.com

16 votes

Are there simple models of Euclid's postulates that violate Pasch's theorem or Pasch's axiom?

geometry euclidean-geometry asked Apr 5, 2013 at 21:57

math.stackexchange.com

14 votes

Does P/poly $\neq$ NP/poly have any interesting implications?

cc.complexity-theory conditional-results advice-and-nonuniformity asked Jun 26, 2015 at 8:09

cstheory.stackexchange.com

14 votes

Conclusions from reverse mathematical strength of graph minor theorem

cc.complexity-theory lo.logic asked Oct 28, 2017 at 14:51

cstheory.stackexchange.com

Top Answers

What are some very important papers published in non-top journals?

mathoverflow.net

On mathematical arguments against Quantum computing

mathoverflow.net

Mathematical research interrupted by a war

mathoverflow.net

Is anyone aware of a counter-example to the Dharwadker-Tevet Graph Isomorphism algorithm?

cstheory.stackexchange.com

Why is it worth spending time on type theory?

math.stackexchange.com

Nonequivalent definitions in Mathematics

mathoverflow.net

Why are mathematician so interested to find theory for solving partial differential equations but not for integral equation?

math.stackexchange.com

Turing Machine restrictions that render halting decidable

cstheory.stackexchange.com

viscosity solution vs. weak solution

math.stackexchange.com

What evidence is there that Graph Isomorphism is not in $P$?

cstheory.stackexchange.com

Negative impact of wrong or non-rigorous proofs

mathoverflow.net

Is there a computationally reasonable algorithm for generating a set of polygons from a set of 2d points?

cs.stackexchange.com

Smooth structure on the topological space

math.stackexchange.com

Advanced Differential Geometry Textbook

mathoverflow.net

Does P/poly $\neq$ NP/poly have any interesting implications?

cstheory.stackexchange.com

Has philosophy ever clarified mathematics?

mathoverflow.net

Current Research in Numeric Mathematics

mathoverflow.net

Literature about a naive approach to graph isomorphism by inspecting polynomials of adjacency matrices

cs.stackexchange.com

Is there an algorithm that finds the forbidden minors?

cstheory.stackexchange.com

Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers?

cstheory.stackexchange.com

Is 1+1=2 true by definition ?

philosophy.stackexchange.com

Counterexamples in universal algebra

mathoverflow.net

How do I take the FFT of unevenly spaced data?

scicomp.stackexchange.com

What would be the real-world implications of a constructive $P=NP$ proof?

cs.stackexchange.com

Smallest class of automata model whose corresponding language class contains CFL and is closed against (dis)allowing nondeterminism in the model

cs.stackexchange.com

Is there a data-structure for semilattices similar to a tree data-structure?

cs.stackexchange.com

Which research languages have a stronger typesystem than Haskell and why?

cs.stackexchange.com

Reference book for Parallel Computing and Parallel algorithms.

cs.stackexchange.com

Is the finite inverse semigroup isomorphism problem GI-complete?

cstheory.stackexchange.com

Was Socrates a fictional character invented by Plato?

philosophy.stackexchange.com