Related papers: On two algebraic parametrizations for rational sol…
We give an algebraic identity for cubic polynomials which generalizes Brahmagupta's identity and facilitates arithmetic in cubic fields. We also pose a question about a relationship between the elements of a cubic field of fixed trace and…
A rational triangle is a triangle with sides of rational lengths. In this short note, we prove that there exists a unique pair of a rational right triangle and a rational isosceles triangle which have the same perimeter and the same area.…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
We determine exactly which positive rational numbers occur as squared edge lengths of regular $d$-simplices with vertices in $\mathbb{Q}^n$. The answer exhibits a sharp stabilization phenomenon: once $n-d\geq 3$, every positive rational…
Let $\mathbb K$ be a perfect field of characterstic $p\ge 0$ and let $R\in \mathbb K(x)$ be a rational function. This paper studies the number $\Delta_{\alpha, R}(n)$ of distinct solutions of $R^{(n)}(x)=\alpha$ over the algebraic closure…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
It is proved that on a smooth algebraic variety, fibered into cubic surfaces over the projective line and sufficiently ``twisted'' over the base, there is only one pencil of rational surfaces -- that is, this very pencil of cubics. In…
The analogue of Hilbert's tenth problem over $\mathbb{Q}$ asks for an algorithm to decide the existence of rational points in algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability…
In this paper we elucidate the advantage of examining the connections between Hilbert-Kamke equations and geometric designs, or Chebyshev-type quadrature, for classical orthogonal polynomials. We first establish that if a $5$-design with…
Two generalizations of the Minkowski ?(x) function are given. As ?(x) maps quadratic irrationals to rational numbers, it is shown that both generalizations send natural classes of pairs of cubic irrational numbers in the same cubic number…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
In this exposition-type note we present detailed proofs of certain assertions concerning several algebraic properties of the cone and cylinder algebras. These include a determination of the maximal ideals, the solution of the B\'ezout…
In a nutshell, we show that polynomials and nested polytopes are topological, algebraic and algorithmically equivalent. Given two polytops $A\subseteq B$ and a number $k$, the Nested Polytope Problem (NPP) asks, if there exists a polytope…
Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…
A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…
Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial depending on coprime integers $p\neq q>0$. Writing $Q_{p,q}(t)$ as a quintic in $t^{2}$ produces an associated monic quintic polynomial. After…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…
We study properties of rational curves on complete intersections in positive characteristic. It has long been known that in characteristic 0, smooth Calabi-Yau and general type varieties are not uniruled. In positive characteristic,…