相关论文: Problems and progress: survey on fat points in P2
This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…
In many practical applications of constrained optimization, scale and solving time limits make traditional optimization solvers prohibitively slow. Thus, the research question of how to design optimization proxies -- machine learning models…
Using typical solution strategies to compute the solution curve of challenging problems often leads to the break down of the algorithm. To improve the solution process, numerical continuation methods have proved to be a very efficient tool.…
This short note provides a quick introduction to relative canonical resolutions of curves on rational normal scrolls. We present our Macaulay2-package which computes the relative canonical resolution associated to a curve and a pencil of…
Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…
Motivated by newly discovered properties of instantons on non-compact spaces, we realised that certain analytic invariants of vector bundles detect fine geometric properties. We present numerical algorithms, implemented in Macaulay 2, to…
We introduce a very natural generalization of the well-known problem of simultaneous congruences. Instead of searching for a positive integer $s$ that is specified by $n$ fixed remainders modulo integer divisors $a_1,\dots,a_n$ we consider…
A combinatorial formula to generate U(N) character expansions is presented. It is shown that the resulting character expansion formulas greatly simplify a number of problems where integrals over the group manifolds need to be calculated.…
Binary optimization, a representative subclass of discrete optimization, plays an important role in mathematical optimization and has various applications in computer vision and machine learning. Usually, binary optimization problems are…
The interval subset sum problem (ISSP) is a generalization of the well-known subset sum problem. Given a set of intervals $\left\{[a_{i,1},a_{i,2}]\right\}_{i=1}^n$ and a target integer $T,$ the ISSP is to find a set of integers, at most…
A determination of the fixed components, base points and irregularity is made for arbitrary numerically effective divisors on any smooth projective rational surface having an effective anticanonical divisor. All of the results are proven…
Machine learning models can assist with metamaterials design by approximating computationally expensive simulators or solving inverse design problems. However, past work has usually relied on black box deep neural networks, whose reasoning…
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
We study the problem of decomposing (i.e. partitioning and covering) polygons into components that are $\alpha$-fat, which means that the aspect ratio of each subpolygon is at most $\alpha$. We consider decompositions without Steiner…
We improve an $L^2\times L^2\to L^2$ estimate for a certain bilinear operator in the finite field of size $p$, where $p$ is a prime sufficiently large. Our method carefully picks the variables to apply the Cauchy-Schwarz inequality. As a…
We provide a formula that expresses the number of (n-2)-gaps of a generic digital n-object. Such a formula has the advantage to involve only a few simple intrinsic parameters of the object and it is obtained by using a combinatorial technic…
Searching for structural reasons behind old results and conjectures of Chudnovksy regarding the least degree of a nonzero form in an ideal of fat points in projective N-space, we make conjectures which explain them, and we prove the…
Let $n \ge 2$ be an integer and consider the defining ideal of the Fermat configuration of points in $\mathbb{P}^2$: $I_n=(x(y^n-z^n),y(z^n-x^n),z(x^n-y^n)) \subset R=\mathbb{C}[x,y,z]$. In this paper, we compute explicitly the least degree…
Various approaches to the numerical representation of the Incomplete Gamma Function F_m(z) for complex arguments z and small integer indexes m are compared with respect to numerical fitness (accuracy and speed). We consider power series,…