2d

answered  family of polynomials with square discriminant 
Nov
23 
comment 
Unit in cyclotomic field
This approach, if it doesn't finish the question, at least is a cheap test if there are more small exceptions. There aren't any for $n\le300000$. 
Nov
23 
comment 
Unit in cyclotomic field
@guest: Do you need to know for which $n$ you get a unit? In this case, the question probably isn't that easy. I believe this holds only for $n=3,4,7,10,24$. 
Nov
23 
revised 
Gradual monotonic morphing between two natural numbers
added 386 characters in body 
Nov
23 
answered  Gradual monotonic morphing between two natural numbers 
Nov
20 
comment 
Frucht's type theorem for Riemann surface
@ShahroozJanbaz: Is the question about Riemann surfaces, or about Riemannian manifolds? These are quite different things. 
Nov
20 
answered  Polynomials of even degree with solvable Galois group 
Nov
18 
comment 
minimal maximal subgroup of the symmetric group
@AndreasThom: Yes, $\text{AGL}(1,p)\subset S_p$ is a maximal subgroup for most primes $p$. 
Nov
6 
comment 
If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square?
@MichaelStoll: Yes, thanks, this was a wrong wording. I just fixed it. 
Nov
6 
revised 
If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square?
added 7 characters in body 
Nov
6 
comment 
If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square?
@WillSawin: Thanks, I added a remark. 
Nov
6 
revised 
If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square?
added 306 characters in body 
Nov
5 
revised 
If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square?
added 13 characters in body 
Nov
5 
answered  If $F(x,y)$ is a polynomial which is not a square, then how often is the specialization $F(x,a)$ a square? 
Nov
2 
revised 
Covering of a surface of a cube $n\times n \times n$ by pieces of paper $1\times 6$
added 733 characters in body 
Oct
28 
revised 
Geometrically irreducible variety
deleted 4 characters in body 
Oct
28 
revised 
Geometrically irreducible variety
added 275 characters in body 
Oct
28 
awarded  Good Answer 
Oct
27 
answered  Geometrically irreducible variety 
Oct
26 
comment 
Covering of a surface of a cube $n\times n \times n$ by pieces of paper $1\times 6$
@FedorPetrov: Sorry, my remark was for the general exact cover problem. I do not know about the cases where the sets have a fixed small size. 