Related papers: Connected components of meanders: I. Bi-rainbow me…
We define a cone curve to be a reduced sextic space curve which lies on a quadric cone and does not go through the vertex. We classify families of bitangent planes of cone curves. The methods we apply can be used for any space curve with…
The non-convexity of a smooth and compact connected component of a real algebraic plane curve can be measured by a combinatorial object called the Poincare-Reeb tree associated to the curve and to a direction of projection. In this paper we…
We define, analyze, and give efficient algorithms for two kinds of distance measures for rooted and unrooted phylogenies. For rooted trees, our measures are based on the topologies the input trees induce on triplets; that is, on…
The main purpose of this paper is twofold. We first want to analyze in details the meaningful geometric aspect of the method introduced in the previous paper [12], concerning regularity of families of irreducible, nodal "curves" on a…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
This work presents an initial analysis of using bijective mappings to extend the Theory of Functional Connections to non-rectangular two-dimensional domains. Specifically, this manuscript proposes three different mappings techniques: a)…
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…
We initiate the study of a class of real plane algebraic curves which we call expressive. These are the curves whose defining polynomial has the smallest number of critical points allowed by the topology of the set of real points of a…
We study compact stable embedded minimal surfaces whose boundary is given by two collections of closed smooth Jordan curves in close planes of Euclidean 3-space. Our main result is a classification of these minimal surfaces, under certain…
We study open B-model representing D-branes on 2-cycles of local Calabi--Yau geometries. To this end we work out a reduction technique linking D-branes partition functions and multi-matrix models in the case of conifold geometries so that…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…
For an algebraic stack $\sX$ flat and of finite presentation over a scheme $S$, we introduce various notions of {\em relative connected components} and {\em relative irreducible components}. The main distinction between these notions is…
We examine the structure and dimensionality of the Jones polynomial using manifold learning techniques. Our data set consists of more than 10 million knots up to 17 crossings and two other special families up to 2001 crossings. We introduce…
We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…
The Neighbor-Joining algorithm is a popular distance-based phylogenetic method that computes a tree metric from a dissimilarity map arising from biological data. Realizing dissimilarity maps as points in Euclidean space, the algorithm…
An edge-cut $R$ of an edge-colored connected graph is called a rainbow-cut if no two edges in the edge-cut are colored the same. An edge-colored graph is rainbow disconnected if for any two distinct vertices $u$ and $v$ of the graph, there…
We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…
This work concerns with the following problem. Given a two-dimensional domain whose boundary is a closed polygonal line with internal boundaries defined also by polygonal lines, it is required to generate a grid consisting only of…
Almost contact manifolds with B-metric are considered. There are studied three natural connections (i.e. linear connections preserving the structure tensors) determined by conditions for their torsions. These connections are investigated on…