English
Related papers

Related papers: Paperfolding sequences, paperfolding curves and lo…

200 papers

In this article, we study rectifying curves in arbitrary dimensional Euclidean space. A curve is said to be a rectifying curve if, in all points of the curve, the orthogonal complement of its normal vector contains a fixed point. We…

Differential Geometry · Mathematics 2018-06-29 Stijn Cambie , Wendy Goemans , Iris Van den Bussche

For each integer q>0 there is a cohomology theory such that the zero cohomology group of a manifold N of dimension n is a certain group of cobordism classes of proper fold maps of manifolds of dimension n+q into N. We prove a splitting…

Geometric Topology · Mathematics 2012-03-06 Rustam Sadykov

We introduce a representation via (n+1)-colored graphs of compact n-manifolds with (possibly empty) boundary, which appears to be very convenient for computer aided study and tabulation. Our construction is ageneralization to arbitrary…

Geometric Topology · Mathematics 2018-11-21 Luigi Grasselli , Michele Mulazzani

Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…

Numerical Analysis · Mathematics 2025-07-16 H. Hakopian , G. Vardanyan , N. Vardanyan

We describe some regular techniques of calculating finite degree invariants of triple points free smooth plane curves $S^1 \to R^2$. They are a direct analog of similar techniques for knot invariants and are based on the calculus of {\em…

Geometric Topology · Mathematics 2014-07-29 Victor A. Vassiliev

We define a new notion of total curvature, called net total curvature, for finite graphs embedded in Rn, and investigate its properties. Two guiding principles are given by Milnor's way of measuring the local crookedness of a Jordan curve…

Differential Geometry · Mathematics 2011-01-13 Robert Gulliver , Sumio Yamada

An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…

Combinatorics · Mathematics 2008-06-13 Peter Keevash , Benny Sudakov

In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Shpilrain , Jie-Tai Yu

Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…

Logic in Computer Science · Computer Science 2026-04-08 Bruno Courcelle

We prove several interpolation results for holomorphic Legendrian curves lying in an odd dimensional complex Euclidean space with the standard contact structure. In particular, we show that an arbitrary countable set of points in…

Complex Variables · Mathematics 2023-05-17 Andrej Svetina

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

We obtain complete geometric invariants of cobordism classes of oriented simple fold maps of (n+1)-dimensional manifolds into an n-dimensional manifold N in terms of immersions with prescribed normal bundles. We compute that this cobordism…

Geometric Topology · Mathematics 2009-02-24 Boldizsar Kalmar

We introduce a novel class of rotation invariants of two dimensional curves based on iterated integrals. The invariants we present are in some sense complete and we describe an algorithm to calculate them, giving explicit computations up to…

Computer Vision and Pattern Recognition · Computer Science 2013-05-30 Joscha Diehl

Consider the graph obtained by superposition of an independent pair of uniform infinite non-crossing perfect matchings of the set of integers. We prove that this graph contains at most one infinite path. Several motivations are discussed.

Probability · Mathematics 2017-01-24 Nicolas Curien , Gady Kozma , Vladas Sidoravicius , Laurent Tournier

This article describes the geometry of isomorphisms between complements of geometrically irreducible closed curves in the affine plane $\mathbb{A}^2$, over an arbitrary field, which do not extend to an automorphism of $\mathbb{A}^2$. We…

Algebraic Geometry · Mathematics 2019-09-18 Jérémy Blanc , Jean-Philippe Furter , Mattias Hemmig

For all positive even integers $n$, graphs of order $n$ with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the study of a labeling problem in \cite{IMO}. This fact…

Combinatorics · Mathematics 2023-03-15 Rikio Ichishima , Francesc A. Muntaner-Batle

Just how many different connected shapes result from slicing a cube along some of its edges and unfolding it into the plane? In this article we answer this question by viewing the cube both as a surface and as a graph of vertices and edges.…

Group Theory · Mathematics 2016-04-20 Richard Goldstone , Robert Suzzi Valli

Taking the product of (2n+1)/(2n+2) raised to the power +1 or -1 according to the n-th term of the Thue-Morse sequence gives rise to an infinite product P while replacing (2n+1)/(2n+2) with (2n)/(2n+1) yields an infinite product Q, where P…

Number Theory · Mathematics 2014-07-01 Jean-Paul Allouche

We review the stamp folding problem, the number of ways to fold a strip of $n$ stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to…

Combinatorics · Mathematics 2013-02-11 Stéphane Legendre

We study non-compact surfaces obtained by gluing strips $\mathbb{R}\times(-1,1)$ with at most countably many boundary intervals along some these intervals. Every such strip possesses a foliation by parallel lines, which gives a foliation on…

Geometric Topology · Mathematics 2017-10-19 Sergiy Maksymenko , Eugene Polulyakh