Impact
~12k
people reached
 0 posts edited
 8 helpful flags
 334 votes cast
2d

reviewed  Reviewed Prove in GL that no statement can be proven consistent with PA unless PA is inconsistent 
Jan
31 
comment 
Can one make highlevel proofs about chess positions?
Note that the last example on the Wikipedia page was composed by Lasker who was also a mathematician. Maybe this is not a coincidence. 
Jan
31 
comment 
Can one make highlevel proofs about chess positions?
Why isn't the K+Q vs K example you gave an example for your second question? Or say K+R vs R? The tree is probably too big for a human to draw by hand (probably thousands of nodes) but it's not hard to give a rigorous proof, as you did yourself. A slightly more complicated and interesting example might be the theory of corresponding squares? en.wikipedia.org/wiki/Corresponding_squares 
Jan
29 
reviewed  No Action Needed Relation between symplectic blowup of a compact manifold and fibre bundles over same manifold 
Jan
28 
reviewed  No Action Needed Elliptic regularity and inhomogeneous Neumann boundary condition 
Jan
28 
reviewed  No Action Needed Extracting a full rank matrix from a 01 matrix 
Jan
26 
reviewed  No Action Needed Simulate a graph from a certain distribution 
Jan
22 
reviewed  No Action Needed On numerical approximation to stationary distribution of diffusion process 
Jan
22 
reviewed  No Action Needed Detection tools for (reduced) suspension 
Jan
21 
reviewed  No Action Needed concentration inequality for entropy from sample 
Jan
17 
reviewed  No Action Needed Intuitive functional analysis book 
Jan
10 
reviewed  No Action Needed Distribution of values of quadratic polynomials over a finite field 
Jan
10 
reviewed  No Action Needed Locked convex polyhedra 
Jan
2 
awarded  Informed 
Jan
2 
awarded  Civic Duty 
Dec
23 
comment 
Which finite groups can be characterized by their automorphism groups?
You need to be more precise about what you mean by $Aut(H)=Aut(G)$. Do you mean that $Aut(H)$ is isomorphic (as an abstract group) to $Aut(G)$? 
Dec
23 
comment 
Characterizing cyclic group of order $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r}$, by Lattice isomorphisms
Can you remind us what is L(G)? 
Dec
21 
reviewed  No Action Needed Magic tesseract of order 3 composed of prime numbers 
Dec
3 
comment 
connected and vertextransitive prime graphs with respect to Cartesian product
Assuming that $f$ grows quickly, the largest term in the sum will probably be $f(1)f(n1)$ and so an upper bound will be $nf(1)f(n1)$. Again, assume that $f$ grows quickly, this will be much smaller than $f(n)$. 
Dec
3 
comment 
connected and vertextransitive prime graphs with respect to Cartesian product
This counting argument should work no matter the product. Consider a specific example, for simplicity: graphs of order a power of two. (Which some people expect will dominate the count anyway.) Let $f(n)$ be the number of graphs of order $2^n$. Given a graph product, which takes as input an ordered pair of two graphs and outputs one with order the product of the orders, one has the following upper bound on the number of nonprime graphs of order 2^n: it's at most $f(1)f(n1)+f(2)f(n2)+...+f(n1)f(1)$. 