Related papers: Integral points in rational polygons: a numerical …
We report on progress in the qualitative study of rational points on rationally connected varieties over number fields, also examining integral points, zero-cycles, and non-rationally connected varieties. One of the main objectives is to…
We study rationality problems for smooth complete intersections of two quadrics. We focus on the three-dimensional case, with a view toward understanding the invariants governing the rationality of a geometrically rational threefold over a…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
We give an upper bound for the number of rational points of height at most $B$, lying on a surface defined by a quadratic form $Q$. The bound shows an explicit dependence on $Q$. It is optimal with respect to $B$, and is also optimal for…
In this paper we compute the number of rational curves with one node passing through a given number of points, lines and tangent to a given number of planes in $\mathbb{P}^3$.
A full Lie point symmetry analysis of rational difference equations is performed. Non-trivial symmetries are derived and exact solutions using these symmetries are obtained.
In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…
We introduce explicit families of good interpolation points for interpolation on a triangle in $\mathbb{R}^2$ that may be used for either polynomial interpolation or a certain rational interpolation for which we give explicit formulas.
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…
Rational methods are intended to time integrate linear homogeneous problems. However, their scope can be extended so as to cover linear nonhomogeneous problems. In this paper the integration of semilinear problems is considered. The…
Solving algebraic word problems requires executing a series of arithmetic operations---a program---to obtain a final answer. However, since programs can be arbitrarily complicated, inducing them directly from question-answer pairs is a…
The incircle of a triangle touches the sides of the triangle in three points. It is well known that the lines from these points to the opposite vertices meet at a point known as the Gergonne point of the triangle. We use a computer to…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…
Recutting is an operation on planar polygons defined by cutting a polygon along a diagonal to remove a triangle, and then reattaching the triangle along the same diagonal but with opposite orientation. Recuttings along different diagonals…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
The arithmetic of natural numbers has a natural and simple encoding within sets, and the simplest set whose structure is not that of any natural number extends this set-theoretic representation to positive and negative integers. The…
We give a formula for counting the triangles in a picture consisting of the three sides of a triangle and some cevians. This lets us prove statements that are claimed without proof in the Online Encyclopedia of Integer Sequences and some…
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Its existence is equivalent to the existence of a perfect cuboid with all…