Related papers: Algebraic methods for computing smallest enclosing…
We address the study of some curvature equations for distinguished submanifolds in para-K\"ahler geometry. We first observe that a para-complex submanifold of a para-K\"ahler manifold is minimal. Next we describe the extrinsic geometry of…
We have employed Particle Swarm Optimization to address a stochastic variant of the Smallest Enclosing Sphere estimation problem. An efficient algorithm has been developed to ascertain the optimal center and radius of a sphere encompassing…
We classify ruled minimal surfaces in $\Bbb R^3$ with density $e^z.$ It is showed that there is no noncylindrical ruled minimal surface and there is a family of cylindrical ruled minimal surfaces in $\Bbb R^3$ with density $e^z.$ It is also…
We study surfaces in Euclidean space ${\mathbb R}^3$ that are minimal for a log-linear density $\phi(x,y,z)=\alpha x+\beta y+\gamma y$, where $\alpha,\beta,\gamma$ are real numbers not all zero. We prove that if a surface is $\phi$-minimal…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
We investigate complete non-orientable minimal surfaces of finite total curvature in $\mathbb{R}^3$ such that their ends are foliated by closed lines of curvature. This condition on the ends is necessary if they have a piece inside some…
In this article, we give an explicit construction of the simple modules for both non-degenerate and degenerate cyclotomic Hecke-Clifford superalgebras over an algebraically closed field of characteristic not equal to $2$ under certain…
In this paper we define and construct a new class of algebraic surfaces in three-dimensional Euclidean space generated by a curve and a congruence of circles. We study their properties and visualize them with the program Mathematica.
In this paper, a supersymmetric extension of the minimal surface equation is formulated. Based on this formulation, a Lie superalgebra of infinitesimal symmetries of this equation is determined. A classification of the one-dimensional…
In this paper, we study the problem of computing a minimum-width axis-aligned cubic shell that encloses a given set of $n$ points in a three-dimensional space. A cubic shell is a closed volume between two concentric and face-parallel cubes.…
We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…
In this paper, the optimality of ternary arithmetic is investigated under strict mathematical formulation. The arithmetic systems are presented in generic form, as the means to encode numeric values, and the choice of radix is asserted as…
We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approaches for manipulating constructible sets. In this paper, for an…
We develop a method for constructing standard complexes which turns easy the calculation of their algebraic invariants and, as well, the precise evaluation of whether these complexes are embeddable or not in a 3-manifold. This method…
We are interested in easy geometric transformations which regularize n-polygons in the non-euclidean plane. A transformation is called easy if it can be easily implemented into an algorithm. This article is motivated by preceding work on…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
We propose a method for obtaining rigorous and accurate upper and lower bounds on the eigenvalues of ordinary and partial differential operators in bounded regions of Euclidean space. It uses a boundary condition homotopy method starting…
In this paper we prove that the only algebraic constant mean curvature (cmc) surfaces in R^3 of order less than four are the planes, the spheres and the cylinders. The method used heavily depends on the efficiency of algorithms to compute…