相关论文: Problems and progress: survey on fat points in P2

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…

Mixed-integer linear programming (MILP) is widely employed for modeling combinatorial optimization problems. In practice, similar MILP instances with only coefficient variations are routinely solved, and machine learning (ML) algorithms are…

It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…

Alexander and Hirschowitz determined the Hilbert function of a generic union of fat points in a projective space when the number of fat points is much bigger than the greatest multiplicity of the fat points. Their method is based on a lemma…

In this workshop, we discuss several algorithms for mathematical programs with equilibrium constraints (MPECs). The unifying theme is that MPECs are optimization problems whose feasible set contains a lower-level equilibrium system, often…

This paper is a natural sequel to [22] in that it tackles problems of the same nature. Here one aims at the ideal theoretic and homological properties of a class of ideals of general plane fat points whose second symbolic powers hold…

We study the postulation of 0-dimensional schemes given by unions of 2-superfat points in general position in the plane, i.e., the union of local schemes defined by the intersection of two distinct double lines. We prove that such schemes…

This note describes a \emph{Macaulay2} package for computations in prime characteristic commutative algebra. This includes Frobenius powers and roots, $p^{-e}$-linear and $p^{e}$-linear maps, singularities defined in terms of these maps,…

A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…

We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…

In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…

The problem to find an upper bound for the regularity index of fat points has been dealt with by many authors. In this paper we give a lower bound for the regularity index of fat points. It is useful for determining the regularity index.

Integration-by-parts (IBP) reduction is one of the essential steps in evaluating Feynman integrals. A modern approach to IBP reduction uses modular arithmetic evaluations with parameters set to numerical values at sample points, followed by…

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…

Motivated by applications in instance selection, we introduce the star discrepancy subset selection problem, which consists of finding a subset of m out of n points that minimizes the star discrepancy. First, we show that this problem is…

A numerical code is described for constructing Doppler maps from the orbital variation of line profiles of (mass transfering) binaries. It uses an algorithm related to Richardson-Lucy iteration, and is much faster than the standard…

We present an efficient multi-accuracy algorithm for the computations of a set of special functions of a complex argument, z=x+iy. These functions include the complex probability function w(z), and closely related functions such as the…

The point placement problem is to determine the positions of a set of $n$ distinct points, P = {p1, p2, p3, ..., pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points.…