Related papers: Computing Pretropisms for the Cyclic n-Roots Probl…
We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
We discuss and prove a number of results for calculating characteristic cycles, or graded, enriched characteristic cycles. We concentrate particularly on results related to hypersurfaces.
We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hypersurfaces, moduli of…
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…
This paper presents a methodology for finding numerically, by means of curve-following, all real solutions of a general system of $n$ nonlinear equations in $n$ unknowns, within a given $n$-dimensional box. The main idea behind our method…
We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the…
In this paper, we study the computation of curvatures at the singular points of algebraic curves and surfaces. The idea is to convert the problem to compute the curvatures of the corresponding regular parametric curves and surfaces, which…
Cone regression is a particular case of quadratic programming that minimizes a weighted sum of squared residuals under a set of linear inequality constraints. Several important statistical problems such as isotonic, concave regression or…
Duality of curves is one of the important aspects of the ``classical'' algebraic geometry. In this paper, using this foundation, the duality of tropical polynomials is constructed to introduce the duality of Non-Archimedean curves. Using…
In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…
A class of two-dimensional linear differential systems is considered. The box-counting dimension of the graphs of solution curves is calculated. Criteria to obtain the box-counting dimension of spirals are also established.
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
The roots of a smooth curve of hyperbolic polynomials may not in general be parameterized smoothly, even not $C^{1,\alpha}$ for any $\alpha > 0$. A sufficient condition for the existence of a smooth parameterization is that no two of the…
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
There exist efficient algorithms to project a point onto the intersection of a convex cone and an affine subspace. Those conic projections are in turn the work-horse of a range of algorithms in conic optimization, having a variety of…
This note provides a complete solution to a certain version of the edge-isoperimetric problem for powers of a cycle graph. Namely, it shows that the maximum number of edges inside a vertex subset of $C_n^s$ of size $k$ is achieved by a set…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…