相关论文: On the parallel lines for nondegenerate conics
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
The purpose of this paper is twofold. An immediate practical use of the presented algorithm is its applicability to the parametric solution of underdetermined linear ordinary differential equations (ODEs) with coefficients that are…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
The main result of the present paper is the construction of fundamental solutions for a class of multidimensional elliptic equations with several singular coefficients. These fundamental solutions are directly connected with multiple…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
Hyperplanes and hyperplane complements in the Segre product of partial linear spaces are investigated . The parallelism of such a complement is characterized in terms of the point-line incidence. Assumptions, under which the automorphisms…
In this paper, we study the persistent homology of the offset filtration of algebraic varieties. We prove the algebraicity of two quantities central to the computation of persistent homology. Moreover, we connect persistent homology and…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…
We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…
We use constructions of surfaces as abelian covers to write down exceptional collections of line bundles of maximal length for every surface $X$ in certain families of surfaces of general type with $p_g=0$ and $K_X^2=3,4,5,6,8$. We also…
In this paper we denote a type of affine homogeneous real hypersurface of $\mathbb{C}^3$ and present a classification of homogeneous surfaces of the type (1/2,0). The result was obtained by reducing the classification problem mentioned…
The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…
We give an effective method to determine the multiplier ideals and jumping numbers associated with a curve singularity $C$ in a smooth surface. We characterize the multiplier ideals in terms of certain Newton polygons, generalizing a…
We present two parallel optimization algorithms for a convex function $f$. The first algorithm optimizes over linear inequality constraints in a Hilbert space, $\mathbb H$, and the second over a non convex polyhedron in $\mathbb R^n$. The…
This work is devoted to the development and analysis of a linearization algorithm for microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…