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

We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…

These notes aim to develop a tool for constructing polynomial differential $p$-forms vanishing on prescribed loci through syzygies of homogeneous ideals. Examples are provided through implementing this method in Macaulay2, particularly…

Multidimensional optimization problems where the objective function and the constraints are multiextremal non-differentiable Lipschitz functions (with unknown Lipschitz constants) and the feasible region is a finite collection of robust…

The SHGH conjecture proposes a solution to the question of how many conditions a general union of fat points imposes on the complete linear system of curves in $\mathbb P^2$ of fixed degree $d$, and it is known to be true in many cases. We…

In this paper, we address the problem of counting integer points in a rational polytope described by $P(y) = \{ x \in \mathbb{R}^m \colon Ax = y, x \geq 0\}$, where $A$ is an $n \times m$ integer matrix and $y$ is an $n$-dimensional integer…

In this paper, we study the Waldschmidt constant of a generalized fat point subscheme $Z=m_1p_1+\cdots+m_rp_r$ of $\mathbb{P}^2$, where $p_1,\cdots,p_r$ are essentially distinct points on $\mathbb{P}^2$, satisfying the proximity…

A complete and rigorously validated open-source Python framework to automate point defect calculations using density functional theory has been developed. The framework provides an effective and efficient method for defect structure…

In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…

We provide compact algebraic expressions that replace the lengthy symbolic-algebra-generated integrals I6 and I8 in Part I of this series of papers [1]. The MRSE entries of Part I, Table 4.3 are thus updated to simpler algebraic…

Feature removal from computational geometries, or defeaturing, is an integral part of industrial simulation pipelines. Defeaturing simplifies the otherwise costly or even impossible meshing process, speeds up the simulation, and lowers its…

Let $X$ be a set of $K$-rational points in $P^1 \times P^1$ over a field $K$ of characteristic zero, let $Y$ be a fat point scheme supported at $ X$, and let $R_Y$ be the bihomogeneus coordinate ring of $Y$. In this paper we investigate the…

Given a graph $G$, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of $G$ with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but---to the…

We work out the optimization problem, initiated by K. Soundararajan, for the choice of the underlying polynomial P used in the construction of the weight function in the Goldston--Pintz--Yildirim method for finding small gaps between…

Given a graph $G$, the NP-hard Maximum Planar Subgraph problem asks for a planar subgraph of $G$ with the maximum number of edges. The only known non-trivial exact algorithm utilizes Kuratowski's famous planarity criterion and can be…

We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of the network) so as to maximise coverage, considering that the…

This is an appendix to the recent paper of Favacchio and Guardo. In these notes we describe explicitly a minimal bigraded free resolution and the bigraded Hilbert function of a set of 3 fat points whose support is an almost complete…

Let Z be a finite set of double points in P^1 x P^1 and suppose further that X, the support of Z, is arithmetically Cohen-Macaulay (ACM). We present an algorithm, which depends only upon a combinatorial description of X, for the bigraded…

Let a polytope $P$ be defined by a system $A x \leq b$. We consider the problem of counting the number of integer points inside $P$, assuming that $P$ is $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank…

In this paper we develop techniques for determining the dimension of linear systems of divisors based at a collection of general fat points in P^n by partitioning the monomial basis for the vector space of global sections of O(d). The…

The purpose of this paper is to construct some special kind of subschemes in $\mathbb{P}^N$ with $ N\ge 3$, which we call them "fat flat subschemes" and compute their Waldschmidt constants. These subschemes are constructed by adding, in a…