Skip to main content

All Questions

Filter by
Sorted by
Tagged with
45 votes
4 answers
1k views

How to write computer-assisted mathematics well?

Much has been said about writting good papers in mathematics. A short google query yields countless sources of advice. This skill also appears to be quite transferrable between basic branches of ...
18 votes
3 answers
785 views

Automated search for bijective proofs

In enumerative combinatorics, a bijective proof that $|A_n| = |B_n|$ (where $A_n$ and $B_n$ are finite sets of combinatorial objects of size $n$) is a proof that constructs an explicit bijection ...
Timothy Chow's user avatar
  • 82.7k
37 votes
12 answers
3k views

Interesting conjectures "discovered" by computers and proved by humans?

There are notable examples of computers "proving" results discovered by mathematicians, what about the opposite: Are there interesting conjectures "discovered" by computers and proved by humans? ...