Related papers: Classifying rational polygons with small denominat…
The main result provides an algorithm for determining the minimal free resolution of ideals of fat point subschemes of ${\bf P}^2$ involving up to 8 general points with arbitrary multiplicities; the results hold over algebraically closed…
We consider the problem of computing $R(c,a)$, the number of unlabeled graded lattices of rank $3$ that contain $c$ coatoms and $a$ atoms. More specifically we do this when $c$ is fairly small, but $a$ may be large. For this task, we…
Existing algorithms for explaining the outputs of image classifiers are based on a variety of approaches and produce explanations that frequently lack formal rigour. On the other hand, logic-based explanations are formally and rigorously…
Enumeration of various types of lattice polygons and in particular polyominoes is of primary importance in many machine learning, pattern recognition, and geometric analysis problems. In this work, we develop a large deviation principle for…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
We consider the problem of minimizing a linear function over an affine section of the cone of positive semidefinite matrices, with the additional constraint that the feasible matrix has prescribed rank. When the rank constraint is active,…
We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…
We prove upper bounds for the number of rational points on non-singular cubic curves defined over the rationals. The bounds are uniform in the curve and involve the rank of the corresponding Jacobian. The method used in the proof is a…
When studying families in the moduli space of dynamical systems, choosing an appropriate representative function for a conjugacy class can be a delicate task. The most delicate questions surround rationality of the conjugacy class compared…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…
Differentiable systems in this paper means systems of equations that are described by differentiable real functions in real matrix variables. This paper proposes algorithms for finding minimal rank solutions to such systems over (arbitrary…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
New algorithms are presented for numerical conformal mapping based on rational approximations and the solution of Dirichlet problems by least-squares fitting on the boundary. The methods are targeted at regions with corners, where the…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
We consider polynomially and rationally parameterized curves, where the polynomials in the parameterization have fixed supports and generic coefficients. We apply sparse (or toric) elimination theory in order to determine the vertex…
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We…