相关论文: A method to find ideal points from ideal triangula…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
We study some representations of symmetric groups arising from a certain ideal in the coordinate ring of affine n-space. Our results give graded and representation-theoretic enhancements of sequence 337 of the Online Encyclopaedia of…
This notes explores angle structures on ideally triangulated compact $3$-manifolds with high genus boundary. We show that the existence of angle structures implies the existence of a hyperbolic metric with totally geodesic boundary, and…
The I-patch is a multi-sided surface representation, defined as a combination of implicit ribbon and bounding surfaces, whose pairwise intersections determine the natural boundaries of the patch. Our goal is to show how a collection of…
Let $M$ be a compact 3-manifold with a triangulation $\tau$. We give an inequality relating the Euler characteristic of a surface $F$ normally embedded in $M$ with the number of normal quadrilaterals in $F$. This gives a relation between a…
Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.
In this paper, we analyze the time complexity of finding regular polygons in a set of n points. We combine two different approaches to find regular polygons, depending on their number of edges. Our result depends on the parameter alpha,…
In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
We describe the resolution of singularities of a threefold which has minimal Picard number. We describe the relation between this minimal resolution and an arbitrary resolution of singularities.
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
We consider 3-dimensional pseudo-manifolds M with a given set of marked point V such that M-V is the interior of a compact 3-manifold with boundary. An ideal triangulation T of (M, V ) has V as its set of vertices. A branching (T, b)…
For a tensor triangulated category and any regular cardinal $\alpha$ we study the frame of $\alpha$-localizing tensor ideals and its associated space of points. For a well-generated category and its frame of localizing tensor ideals we…
In this work we present a unified method of relative camera pose estimation from points and lines correspondences. Given a set of 2D points and lines correspondences in three views, of which two are known, a method has been developed for…
Classical problem of random triangle in square is solved by simple and transparent geometrical method.
We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…
We are interested in the structure of almost complete intersection ideals of grade 3. We give three constructions of these ideals and their free resolutions: one from the commutative algebra point of view, an equivariant construction giving…
In this paper we survey Eckardt points on a smooth complex cubic threefold with an approach aimed at computing all Eckardt points of a cubic threefold. In addition, we construct cubic threefolds with no Eckardt points but containing triple…
In this paper, we give an algorithm to infer the positions of the vertices of an unknown tetrahedron, given a sample of points which are uniformly distributed within the tetrahedron. The accuracy of the algorithm is demonstrated using some…
In this work, we present a novel approach for solving stochastic shape optimization problems. Our method is the extension of the classical stochastic gradient method to infinite-dimensional shape manifolds. We prove convergence of the…