Related papers: Arnold's problem on paper folding
This work answers the question what coverings over a topological torus can be induced from a covering over a space of dimension $k$. The answer to this question is then applied in algebro-geometric context to present obstructions to…
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical…
Expander graphs have been, during the last five decades, the subject of a most fruitful interaction between pure mathematics and computer science, with influence and applications going both ways (cf. [Lub94], [HLW06], [Lub12] and the…
We survey Weber's class number problem and its variants in the spirit of arithmetic topology; we recollect some history, present a relation to certain units and generalized Pell's equation, and overview a study of the $p$-adic limits of…
The oloid is the convex hull of two circles with equal radius in perpendicular planes so that the center of each circle lies on the other circle. It is part of a developable surface which we call extended oloid. We determine the tangential…
The stationary reflected Brownian motion in a three-quarter plane has been rarely analyzed in the probabilistic literature, in comparison with the quarter plane analogue model. In this context, our main result is to prove that the…
We characterize the cut patterns that can be produced by "orthogonal fold & cut": folding an axis-aligned rectangular sheet of paper along horizontal and vertical creases, and then making a single straight cut (at any angle). Along the way,…
We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
This paper contributes to the solution of the Poincare problem, which is to bound the degree of a (generalized algebraic) leaf of a (singular algebraic) foliation of the complex projective plane. The first theorem gives a new sort of bound,…
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
$\lambda$-self-expanders $\Sigma$ in $\mathbb{R}^{n+1}$ are the solutions of the isoperimetric problem with respect to the same weighted area form as in the study of the self-expanders. In this paper, we mainly extend the results on…
We investigate the blow-up of a weighted projective plane at a general point. We provide criteria and algorithms for testing if the result is a Mori dream surface and we compute the Cox ring in several cases. Moreover applications to the…
In a companion paper, we discuss students' ability to take advantage of what they learn from a solved problem and transfer their learning to solve a quiz problem that has different surface features but the same underlying physics…
We consider the problem of packing congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult nonconvex…
How can we convince students, who have mainly learned to follow given mathematical rules, that mathematics can also be fascinating, creative, and beautiful? In this paper I discuss different ways of introducing non-Euclidean geometry to…
Consider a smooth complex surface $X$ which is a double cover of the projective plane $\mathbb{P}^2$ branched along a smooth curve of degree $2s$. In this article, we study the geometric conditions which are equivalent to the existence of…
Fold-and-cut theorem claims the possibility to cut out from a sheet a set of straight-line drawing using only one cut of scissors, without producing any other cut in the sheet and separating all the figures at the same time, just by folding…
An annulus is, informally, a ring-shaped region, often described by two concentric circles. The maximum-width empty annulus problem asks to find an annulus of a certain shape with the maximum possible width that avoids a given set of $n$…
The Plateau's problem seeks to determine a surface of minimal area which spans a given boundary. It is widely studied for its varied mathematical formulations, applications and relevance to physical models such as soap films. We revisit the…