Related papers: On the parallel lines for nondegenerate conics
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between elliptic curves efficiently. For ordinary curves of the same…
We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree. We are able to compute the Grobner basis and Markov basis of the toric…
We develop geometric approach to A-infinity algebras and A-infinity categories based on the notion of formal scheme in the category of graded vector spaces. Geometric approach clarifies several questions, e.g. the notion of homological unit…
We show that Hilbert schemes of planar curve singularities and their parabolic variants can be interpreted as certain generalized affine Springer fibers for $GL_n$, as defined by Goresky-Kottwitz-MacPherson. Using a generalization of affine…
Solving systems of polynomial equations is a central problem in nonlinear and computational algebra. Since Buchberger's algorithm for computing Gr\"obner bases in the 60s, there has been a lot of progress in this domain. Moreover, these…
In this paper, we provide an elementary, geometric, and unified framework to analyze conic programs that we call the strict complementarity approach. This framework allows us to establish error bounds and quantify the sensitivity of the…
Properties of the recently reported homogeneous Hilbert curves are deduced and reported. The nature of the affine transformations involved in the construction of the Hilbert curves is explored. The analytical representation of proper and…
We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
We prove that if $\{f_t\}$ is a family of line singularities with constant L\^e numbers and such that $f_0$ is a homogeneous polynomial, then $\{f_t\}$ is equimultiple. This extends to line singularities a well known theorem of A. M.…
We consider a general conic mixed-binary set where each homogeneous conic constraint $j$ involves an affine function of independent continuous variables and an epigraph variable associated with a nonnegative function, $f_j$, of common…
Meshing of geometric domains having curved boundaries by affine simplices produces a polytopial approximation of those domains. The resulting error in the representation of the domain limits the accuracy of finite element methods based on…
We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…
We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…
In this paper we use Groebner bases theory in order to determine planarity of intersections of two algebraic surfaces in ${\bf R}^3$. We specially considered plane sections of certain type of conoid which has a cubic egg curve as one of the…
In this article we study congruences of lines in $\mathbb{P}^n$, and in particular of order one. After giving general results, we obtain a complete classification in the case of $\mathbb{P}^4$ in which the fundamental surface $F$ is in fact…
The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…
This paper proposes a new design method to determine the feasible set of parameters of translational or position/orientation decoupled parallel robots for a prescribed singularity-free workspace of regular shape. The suggested method uses…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…