Related papers: Splitting loops and necklaces: Variants of the squ…
We prove that for a chainable continuum $X$ and every non-zigzag $x\in X$ there exists a planar embedding $\phi:X\to \phi(X)\subset\mathbb R^2$ such that $\phi(x)$ is accessible, partially answering the question of Nadler and Quinn from…
We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.
In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…
We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the…
Holzer and Holzer (Discrete Applied Mathematics 144(3):345--358, 2004) proved that the Tantrix(TM) rotation puzzle problem with four colors is NP-complete, and they showed that the infinite variant of this problem is undecidable. In this…
A knot in the 3-sphere is called doubly slice if it is a slice of an unknotted 2-sphere in the 4-sphere. We give a bi-sequence of new obstructions for a knot being doubly slice. We construct it following the idea of Cochran-Orr-Teichner's…
Let $P$ be a polygon with $r>0$ reflex vertices and possibly with holes and islands. A subsuming polygon of $P$ is a polygon $P'$ such that $P \subseteq P'$, each connected component $R$ of $P$ is a subset of a distinct connected component…
Although little can be gleaned about a loop with the property that its squares are, say, left nuclear ($xx\cdot yz = (xx\cdot y)z$), if its squares are also, say, middle nuclear ($(x\cdot yy)z = x(yy\cdot z)$), then the loop exhibits more…
The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…
This article proves a conjecture by Zuber about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by $m$ nested arches is…
The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
This paper aims at the following results: \begin{enumerate} \item The class of all $*$-regular rings forms a variety. \item A subdirectly irreducible $*$-regular ring $R$ is faithfully representable (i.e. isomorphic to a subring of an…
Planarity Testing is the problem of determining whether a given graph is planar while planar embedding is the corresponding construction problem. The bounded space complexity of these problems has been determined to be exactly Logspace by…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
We consider the problem of stretching pseudolines in a planar straight-line drawing to straight lines while preserving the straightness and the combinatorial embedding of the drawing. We answer open questions by Mchedlidze et al. by showing…
We investigate the existence of closed planar loops with prescribed curvature. Our approach is variational, and relies on a Hardy type inequality and its associated functional space.
A separated sequence $\Lambda$ on the real line is called a Polya sequence if any entire function of zero exponential type bounded on $\Lambda$ is constant. In this paper we solve the problem by Polya and Levinson that asks for a…
The type problem is the problem of deciding, for a simply connected Riemann surface, whether it is conformally equivalent to the complex plane or to the unit dic in the complex plane. We report on Teichm{\"u}ller's results on the type…
This note addresses the quantitative aspect of the bilipschitz extension problem. The main result states that any bilipschitz embedding of $\mathbb R$ into $\mathbb R^2$ can be extended to a bilipschitz self-map of $\mathbb R^2$ with a…