Related papers: Growing uniform planar maps face by face
We present a simple randomized scheme for triangulating a set $P$ of $n$ points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of $P$ move continuously along piecewise algebraic…
We revisit the scaling properties of growing spheres randomly seeded in d=2,3 and 4 dimensions using a mean-field approach. We model the insertion probability without assuming a priori a functional form for the radius distribution. The…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
As is well-known, given the complex sphere P^1 minus two points, there exist nonconstant holomorphic maps from the plane into this set, the simplest example of which is given by applying the exponential map and then composing with a…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed…
Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…
Learning 3D representations that generalize well to arbitrarily oriented inputs is a challenge of practical importance in applications varying from computer vision to physics and chemistry. We propose a novel multi-resolution convolutional…
We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…
We use the method of equivariant moving frames to revisit the problem of normal forms and equivalence of nondegenerate real hypersurfaces M \subset C^2 under the pseudo-group action of holomorphic transformations. The moving frame…
In the past many papers have appeared which simulated surface growth with different growth models. The results showed that, if models differed only slightly in their `growth' rules, the resulting surfaces may belong to different…
We give a general framework for uniform, constant-time one-and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus 2 curves that operate by projecting to the x-line or Kummer surface, where we can…
We consider the problem of finding an inductive construction, based on vertex splitting, of triangulated spheres with a fixed number of additional edges (braces). We show that for any positive integer $b$ there is such an inductive…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…
In 1962, Tutte provided a formula for the number of combinatorial triangulations, that is, maximal planar graphs with a fixed triangular face and $n$ additional vertices. In this note, we study how many ways a combinatorial triangulation…
Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…
We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.
We present a class of mappings between the fields of the Cremmer-Sherk and pure BF models in 4D. These mappings are established by two distinct procedures. First a mapping of their actions is produced iteratively resulting in an expansion…
A tessellation of the plane is face-homogeneous if for some integer $k\geq3$ there exists a cyclic sequence $\sigma=[p_0,p_1,\ldots,p_{k-1}]$ of integers $\geq3$ such that, for every face $f$ of the tessellation, the valences of the…