Related papers: Parametrizing some interesting knotted surfaces
We review the polynomial parameterization of classical knots and prove the analogous results for long $2$ knots. We also construct polynomial parameterizations for certain classes of knotted spheres (such as spun and twist spun of the…
In this paper, we characterize the polynomiality of surfaces of revolution by means of the polynomiality of an associated plane curve. In addition, if the surface of revolution is polynomial, we provide formulas for computing a polynomial…
A knotted surface in the 4-sphere may be described by means of a hyperbolic diagram that captures the 0-section of a special Morse function, called a hyperbolic decomposition. We show that every hyperbolic decomposition of a knotted surface…
We present explicit constructions of orthogonal polynomials inside quadratic bodies of revolution, including cones, hyperboloids, and paraboloids. We also construct orthogonal polynomials on the surface of quadratic surfaces of revolution,…
We give an elementary obstruction to reducibility for knotted surfaces in the four-sphere. As a new application, we construct stably irreducible non-orientable surfaces.
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…
We introduce a relation of cobordism for knots in thickened surfaces and study cobordism invariants of such knots.
A construction of polytopes is given based on integers. These geometries are constructed through a mapping to pure numbers and have multiple applications, including statistical mechanics and computer science. The number form is useful in…
A class of exact membrane solutions is quantized.
An almost-toric hypersurface is parameterized by monomials multiplied by polynomials in one extra variable. We determine the Newton polytope of such a hypersurface, and apply this to give an algorithm for computing the implicit equation.
For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $\deg x = 3$, $\deg y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy…
In the present study we consider knotted spheres in Euclidean $4$-space $ \mathbb{E}^{4}$. Firstly, we give some basic curvature properties of knotted spheres in $ \mathbb{E}^{4}$. Further, we obtained some results related with the…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
We study complex analytic (possibly singular) projective connections on the plane. We characterize some of them in terms of their families of integral curves. We also give a beginning of classification of second order odes polynomial in the…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…