Related papers: Thurston's algorithm and rational maps from quadra…
We investigate the combinatorial and dynamical properties of so-called nearly Euclidean Thurston maps, or NET maps. These maps are perturbations of many-to-one folding maps of an affine two-sphere to itself. The close relationship between…
In this work, we examine the process of Tropical Polynomial Division, a geometric method which seeks to emulate the division of regular polynomials, when applied to those of the max-plus semiring. This is done via the approximation of the…
Graphs are widely used to model complicated data semantics in many application domains. In this paper, two novel and efficient algorithms Fast-ON and Fast-P are proposed for solving the subgraph isomorphism problem. The two algorithms are…
In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation…
Topological learning is a wide research area aiming at uncovering the mutual spatial relationships between the elements of a set. Some of the most common and oldest approaches involve the use of unsupervised competitive neural networks.…
We present a framework for deterministically rounding a dynamic fractional matching. Applying our framework in a black-box manner on top of existing fractional matching algorithms, we derive the following new results: (1) The first…
In this paper, we present novel deterministic algorithms for multiplying two $n \times n$ matrices approximately. Given two matrices $A,B$ we return a matrix $C'$ which is an \emph{approximation} to $C = AB$. We consider the notion of…
We study a parametric family of piecewise rotations of the torus, in the limit in which the rotation number approaches the rational value 1/4. There is a region of positive measure where the discontinuity set becomes dense in the limit; we…
Is Fully Polynomial-time Randomized Approximation Scheme (FPRAS) for a problem via an MCMC algorithm possible when it is known that rapid mixing provably fails? We introduce several weight-preserving maps for the eight-vertex model on…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
We describe a "top down" approach for automated theorem proving (ATP). Researchers might usefully investigate the forms of the theorems mathematicians use in practice, carefully examine how they differ and are proved in practice, and code…
Given a $d$-dimensional torus map $F(z)=Mz+G(z)\bmod 1$, where $M$ is an integer-matrix and and $G$ is a periodic function, we find conditions on $M$ under which $F$ is semi-conjugate to a linear torus map, independently of $G$. We also…
Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure. In this work,…
Designing the topology of three-dimensional structures is a challenging problem due to its memory and time consumption. In this paper, we present a robust and efficient algorithm for solving large-scale 3D topology optimization problems.…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
This work is on constrained large-scale non-convex optimization where the constraint set implies a manifold structure. Solving such problems is important in a multitude of fundamental machine learning tasks. Recent advances on Riemannian…
We show the resolution of indeterminacy of rational maps from a regular surface to a tame stack locally of finite type over an excellent scheme. The proof uses the valuative criterion for proper tame morphisms, which was proved by Bresciani…
A Thurston map $f\colon (S^2, A) \to (S^2, A)$ with marking set $A$ induces a pullback relation on isotopy classes of Jordan curves in $(S^2, A)$. If every curve lands in a finite list of possible curve classes after iterating this pullback…