User Anurag

26 votes

Examples of conjectures that were widely believed to be true but later proved false

answered May 21, 2015 at 21:18

11 votes

Important formulas in combinatorics

answered Aug 23, 2015 at 14:37

10 votes

Most helpful math resources on the web

answered Jun 8, 2016 at 11:10

10 votes

How to recognise that the polynomial method might work

answered May 6, 2015 at 17:37

10 votes

Proofs of the Chevalley-Warning Theorem

answered Apr 9, 2015 at 2:29

9 votes

Accepted

The most number of points that realize only $k$ distinct distances

answered May 24, 2015 at 16:26

8 votes

Where have you used computer programming in your career as an (applied/pure) mathematician?

answered Jan 20, 2015 at 15:43

7 votes

Not especially famous, long-open problems which anyone can understand

answered Mar 28, 2015 at 12:38

6 votes

Which math paper maximizes the ratio (importance)/(length)?

answered Jul 16, 2014 at 12:35

5 votes

Combinatorial databases

answered Apr 12, 2015 at 9:52

5 votes

Contest problems with connections to deeper mathematics

answered May 11, 2015 at 21:36

5 votes

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

answered Sep 3, 2015 at 23:54

5 votes

Accepted

$(n-2)$-blocking sets in $AG(n,2)$

answered Jan 26, 2016 at 13:08

4 votes

Hypersurface missing just one point

answered May 19, 2016 at 23:52

4 votes

Linear algebra proofs in combinatorics?

answered May 15, 2015 at 12:14

4 votes

Old books still used

answered May 17, 2015 at 21:45

4 votes

What are the applications of hypergraphs?

answered Jan 12, 2015 at 13:16

3 votes

On MDS code property

answered Apr 28, 2015 at 20:39

3 votes

Blocking sets in three dimensional finite affine spaces

answered Jan 31, 2016 at 21:28

2 votes

Are bipartite Moore graphs Hamiltonian?

answered Sep 23, 2018 at 6:52

2 votes

Reference on the Veblen-Young characterization of projective spaces

answered May 19, 2015 at 1:01

2 votes

Covering all, but $k$ points with affine subspaces

answered Jun 6, 2015 at 1:54

2 votes

ADE type Dynkin diagrams

answered Jun 15, 2015 at 23:29

1 vote

Graduate Schools for Graph Theory

answered Jun 23, 2015 at 3:43

1 vote

Mclaughlin Graph

answered Jan 15, 2015 at 5:00

0 votes

Polynomials of low degree that clone polynomials of higher degree

answered Apr 29, 2015 at 6:55

Stack Exchange Network

26 Answers

Examples of conjectures that were widely believed to be true but later proved false

Important formulas in combinatorics

Most helpful math resources on the web

How to recognise that the polynomial method might work

Proofs of the Chevalley-Warning Theorem

The most number of points that realize only $k$ distinct distances

Where have you used computer programming in your career as an (applied/pure) mathematician?

Not especially famous, long-open problems which anyone can understand

Which math paper maximizes the ratio (importance)/(length)?

Combinatorial databases

Contest problems with connections to deeper mathematics

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

$(n-2)$-blocking sets in $AG(n,2)$

Hypersurface missing just one point

Linear algebra proofs in combinatorics?

Old books still used

What are the applications of hypergraphs?

On MDS code property

Blocking sets in three dimensional finite affine spaces

Are bipartite Moore graphs Hamiltonian?

Reference on the Veblen-Young characterization of projective spaces

Covering all, but $k$ points with affine subspaces

ADE type Dynkin diagrams

Graduate Schools for Graph Theory

Mclaughlin Graph

Polynomials of low degree that clone polynomials of higher degree