Reputation
10,352
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
6 41 93
Newest
 Nice Answer
Impact
~134k people reached

8h
reviewed Close Fourier tranform of the Euclidean norm
12h
reviewed Close An inequality for $L^p$-functions
16h
reviewed Close Integral of error function (erf) and gaussian
16h
reviewed No Action Needed Is there a relationship between model theory and category theory?
16h
reviewed Reviewed Link between the hairy ball theorem and the fundamental theorem of algebra
16h
revised Link between the hairy ball theorem and the fundamental theorem of algebra
Fixed a typo in the title; added top-level tag.
16h
reviewed Leave Closed Eigenvalues of tridiagonal matrix
1d
reviewed Reviewed Lowest upper bound of resultant
1d
reviewed Close How to numerically evaluate a integral whose limits are functions of x (using Gauss quadrature rule)?
1d
reviewed Leave Open Eigenvalues of cyclic tridiagonal matrix
1d
answered The exponential Diophantine equation $a^n-b^m=x^3+y^3$ for arbitrary large $n,m$
1d
reviewed Looks OK Interesting conjectures “discovered” by computers and proved by humans?
1d
reviewed No Action Needed Is there a subset of $\Sigma_n$ s.t. each pair of elements is once in each pair of positions?
1d
reviewed Close What will draw a shape for $L = \left\{ {\lambda \in \mathbb{C}:{s_4}(\lambda ) = {s_3}(\lambda )} \right\}$
1d
reviewed Close inverse of operator
1d
reviewed Approve Atiyah-Guillemin-Sternberg Theorem for current
2d
comment Lattice n-gons with ordered side lengths 1,2,3,…,n
@JosephO'Rourke: Of course! -- I have added a paragraph on this.
2d
revised Lattice n-gons with ordered side lengths 1,2,3,…,n
Added information, in response to Joseph O'Rourke's comment.
2d
revised Lattice n-gons with ordered side lengths 1,2,3,…,n
edited tags
2d
comment Lattice n-gons with ordered side lengths 1,2,3,…,n
@BernardoRecamánSantos: It seems likely that your conjecture is true (e.g. further search found $225$ such polygons for $n = 19$). But Gerhard Paseman is right that $n$ must be congruent to $0$ or $3$ modulo $4$. -- Consider a checkerboard coloring of the integer points in the Cartesian plane. Then the ends of a side have the same color if its length is even, and they have different color if its length is odd. This holds also for diagonal sides, as you can check. So a closed path must contain an even number of sides of odd length.