相关论文: An algorithm to detect laminar 3-manifolds

We prove estimates and existence results for some fully nonlinear elliptic equations on Riemannian manifolds. These equations are not arbitrary, but arise naturally in the study of conformal geometry.

Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…

We prove a local rigidity result for infinitesimally rigid capillary surfaces in some Riemannian $3$-manifolds with mean convex boundary. We also derive bounds on the genus, number of boundary components and area of any compact two-sided…

We study compact complex 3-manifolds admitting holomorphic Riemannian metrics. We prove a uniformization result: up to a finite unramified cover, such a manifold admits a holomorphic Riemannian metric of constant sectionnal curvature.

Analytical formulas for some useful three-particles integrals are derived. Many of these integrals include Bessel and/or trigonometric functions of one and two interparticle (relative) coordinates $r_{32}, r_{31}$ and $r_{21}$. The formulas…

We introduce a diagrammatic language for compact, orientable 3-dimensional manifolds with boundary. A diagrammatic calculus (both integral and rational version) appropriate for this language is introduced and its completeness is proved in…

In this article we establish the relation between the spines of 3-manifolds and the polyhedra with identified faces. We do this by showing that the spines of the closed, connected, orientable 3-manifolds can be presented through polyhedra…

We survey recent progress on the birational geometry of foliations on complex varieties. We focus on the MMP viewpoint: singularities, adjunction and applications to the MMP for foliations on surfaces and to the existence of flips on…

We use a tensor unfolding technique to prove a new identifiability result for discrete bipartite graphical models, which have a bipartite graph between an observed and a latent layer. This model family includes popular models such as…

It is classical that given any Seifert structure on N, Reidemeister-Schreier's algorithm produces a presentation of all index 2 subgroups of the fundamental group of N, described as the fundamental group of some Seifert manifolds. The new…

Correlation is a common technique for the detection of shifts. Its generalization to the multidimensional geometric correlation in Clifford algebras has been proven a useful tool for color image processing, because it additionally contains…

A Heegaard diagram for a 3-manifold is regarded as a pair of simplexes in the complex of curves on a surface and a Heegaard splitting as a pair of subcomplexes generated by the equivalent diagrams. We relate geometric and combinatorial…

We develop a general method for constructing random manifolds and submanifolds in arbitrary dimensions. The method is based on associating colors to the vertices of a triangulated manifold, as in recent work for curves in 3-dimensional…

In this survey we discuss how geometric methods can be used to study topological properties of 3-manifolds such as their Heegaard genus or the rank of their fundamental group. On the other hand, we also discuss briefly some results relating…

A random group contains many subgroups which are isomorphic to the fundamental group of a compact hyperbolic 3-manifold with totally geodesic boundary. These subgroups can be taken to be quasi-isometrically embedded. This is true both in…

We briefly recall a fundamental exterior differential system introduced by the author and then apply it to the case of three dimensions. Here we find new global tensors and intrinsic invariants of oriented Riemaniann 3-manifolds. The system…

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

Whether it is object detection, model reconstruction, laser odometry, or point cloud registration: Plane extraction is a vital component of many robotic systems. In this paper, we propose a strictly probabilistic method to detect finite…

A canonical branched covering over each sufficiently good simplicial complex is constructed. Its structure depends on the combinatorial type of the complex. In this way, each closed orientable 3-manifold arises as a branched covering over…

Many machine learning problems involve regressing variables on a non-Euclidean manifold -- e.g. a discrete probability distribution, or the 6D pose of an object. One way to tackle these problems through gradient-based learning is to use a…