Related papers: Tools for analyzing the intersection curve between…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
The Douglas-Rachford splitting algorithm is a classical optimization method that has found many applications. When specialized to two normal cone operators, it yields an algorithm for finding a point in the intersection of two convex sets.…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…
In this paper we give an algorithm to find the 3-torsion subgroup of the Jacobian of a smooth plane quartic curve with a marked rational point. We describe $3-$torsion points in terms of cubics which triply intersect the curve, and use this…
We exploit the classical correspondence between finitely generated abelian groups and abelian complex algebraic reductive groups to study the intersection theory of translated subgroups in an abelian complex algebraic reductive group, with…
In an orientable surface with boundary, free homotopy classes of curves on surfaces are in one to one correspondence with cyclic reduced words in a set of standard generators of the fundamental group. The combinatorial length of a class is…
We describe an algorithm for solving an important geometric problem arising in computer-aided manufacturing. When cutting away a region from a solid piece of material -- such as steel, wood, ceramics, or plastic -- using a rough tool in a…
We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…
In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.
The minimum number of self-intersection points for members of a free homotopy class of curves on the punctured torus is bounded above in terms of the number L of letters required for a minimal description of the class in terms of the…
Alternating projections and their variants are classical tools for computing points in intersections of sets. Existing analyses for smooth manifolds mainly focus on local convergence rates under transversality or related regularity…
Contour integration is a crucial technique in many numeric methods of interest in physics ranging from differentiation to evaluating functions of matrices. It is often important to determine whether a given contour contains any poles or…
We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
The conic sections, as well as the solids obtained by revolving these curves, and many of their surprising properties, were already studied by Greek mathematicians since at least the fourth century B.C. Some of these properties come to the…
Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface…
We study projective surfaces in $\mathbb{P}^3$ which can be written as Hadamard product of two curves. We show that quadratic surfaces which are Hadamard product of two lines are smooth and tangent to all coordinate planes, and such…