English
Related papers

Related papers: Enumeration of planar Tangles

200 papers

In this paper we consider developable surfaces which are isometric to planar domains and which are piecewise differentiable, exhibiting folds along curves. The paper revolves around the longstanding problem of existence of the so-called…

Differential Geometry · Mathematics 2020-08-07 Leonardo Alese

A 4-regular planar graph $G$ is said to be circle representable if there exists a collection of circles drawn on the plane such that the touching and crossing points correspond to the vertices of $G$, and the circular arcs between those…

Combinatorics · Mathematics 2019-08-14 Jane Tan

Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…

Algebraic Geometry · Mathematics 2019-03-05 Yaniv Ganor

We prove that the tangent bundle of a generic space of planar n-gons with specified side lengths, identified under isometry, plus a trivial line bundle is isomorphic to (n-2) times a canonical line bundle. We then discuss consequences for…

Algebraic Topology · Mathematics 2018-05-09 Donald M. Davis

We use twisted stable maps to compute the number of rational degree d plane curves having prescribed contacts to a smooth plane cubic.

Algebraic Geometry · Mathematics 2007-05-23 Charles Cadman , Linda Chen

A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is…

Computational Geometry · Computer Science 2016-01-08 Stefan Felsner , Alexander Igamberdiev , Philipp Kindermann , Boris Klemz , Tamara Mchedlidze , Manfred Scheucher

Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…

Combinatorics · Mathematics 2017-06-20 Péter Györgyi , Bálint Hujter , Sándor Kisfaludi-Bak

A tight map is a map with some of its vertices marked, such that every vertex of degree $1$ is marked. We give an explicit formula for the number $N_{0,n}(d_1,\ldots,d_n)$ of planar tight maps with $n$ labeled faces of prescribed degrees…

Combinatorics · Mathematics 2024-07-08 Jérémie Bouttier , Emmanuel Guitter , Grégory Miermont

We complete the proof of a theorem we announced and partly proved in [Math. Nachr. 271 (2004), 69-90, math.AG/0111299]. The theorem concerns a family of curves on a family of surfaces. It has two parts. The first was proved in that paper.…

Algebraic Geometry · Mathematics 2022-08-03 Steven Kleiman , Ragni Piene

We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…

Combinatorics · Mathematics 2016-06-15 Andrei K. Svinin

A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…

Combinatorics · Mathematics 2021-03-30 Nikolai Avdeev , Ekaterina Momot , Aleksandr Zvolinskiy

Congruent polygons are congruent in angles as well as in edge lengths. We concentrate on the angle aspect, and investigate how tilings of the sphere by congruent pentagons can be determined by the angle information only. We also investigate…

Combinatorics · Mathematics 2026-04-29 Robert Barish , Hoi Ping Luk , Min Yan

Tanglegrams are special graphs that consist of a pair of rooted binary trees with the same number of leaves, and a perfect matching between the two leaf-sets. These objects are of use in phylogenetics and are represented with straightline…

Given a plane curve $\gamma: S^1\to \mathbb R^2$, we consider the problem of determining the minimal number $I(\gamma)$ of inflections which curves $\mbox{diff}(\gamma)$ may have, where $\mbox{diff}$ runs over the group of diffeomorphisms…

Differential Geometry · Mathematics 2014-02-25 Gleb Nenashev

We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…

Algebraic Geometry · Mathematics 2007-05-23 S. Kleiman , R. Piene

A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place vertices inside their corresponding primal faces, and to draw the dual edges so that they only cross their…

Computational Geometry · Computer Science 2015-05-12 Tamara Mchedlidze

A differentiable curve y = y(x) is determined by its tangent lines and is said to be the envelope of its tangent lines. The coefficients of the curve's tangent lines form a curve in another space, called the dual space. There is a…

General Mathematics · Mathematics 2021-05-26 Steven J. Kilner , David L. Farnsworth

We consider quadrangles of perimeter $2$ in the plane with marked directed edge. To such quadrangle $Q$ a two-dimensional plane $\Pi\in\mathbb{R}^4$ with orthonormal base is corresponded. Orthogonal plane $\Pi^\bot$ defines a plane…

Metric Geometry · Mathematics 2019-11-22 Irina Busjatskaja , Yury Kochetkov

A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…

Numerical Analysis · Mathematics 2023-05-19 Robert M. Corless

We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be…

Combinatorics · Mathematics 2019-07-26 Marc Noy , Clément Requilé , Juanjo Rué
‹ Prev 1 8 9 10 Next ›