Related papers: Computationally proving triangulated 4-manifolds t…
Achieving completeness in the motion planning problem demands substantial computation power, especially in high dimensions. Recent developments in parallel computing have rendered this more achievable. We introduce an embarrassingly…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism…
Certain geometric properties of submanifolds of configuration space are numerically investigated for classical lattice phi^4 models in one and two dimensions. Peculiar behaviors of the computed geometric quantities are found only in the…
We study trisections of smooth, compact non-orientable 4-manifolds, and introduce trisections of non-orientable 4-manifolds with boundary. In particular, we prove a non-orientable analogue of a classical theorem of Laudenbach-Po\'enaru. As…
Despite spectacular advances in defining invariants for simply connected smooth and symplectic 4-dimensional manifolds and the discovery of effective surgical techniques, we still have been unable to classify simply connected smooth…
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…
We give a list of statements on the geometry of elliptic threefolds phrased only in the language of topology and homological algebra. Using only notions from topology and homological algebra, we recover existing results and prove new…
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…
Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…
This paper establishes a framework under which various aspects of prosodic morphology, such as templatic morphology and infixation, can be handled under two-level theory using an implemented multi-tape two-level model. The paper provides a…
Computer programs may go wrong due to exceptional behaviors, out-of-bound array accesses, or simply coding errors. Thus, they cannot be blindly trusted. Scientific computing programs make no exception in that respect, and even bring…
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
Computational approaches to finding non-trivial integer solutions of the equation in the title are discussed. We summarize previous work and provide several new solutions.
This paper investigates spaces equipped with a family of metric-like functions satisfying certain axioms. These functions provide a unified framework for defining topology, uniformity, and diffeology. The framework is based on a family of…
Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…
We give necessary and sufficient conditions for a closed smooth 6-manifold N to be diffeomorphic to a product of a surface F and a simply connected 4-manifold M in terms of basic invariants like the fundamental group and cohomological data.…
Recent models for discrete euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in general dimensions. As illustration we show results from simulations in four…