Abstract: We study the computational complexity of existential Presburger arithmetic with (possibly nested occurrences of) a Kleene-star operator. In addition to being a natural extension of ...

Computational topology studies the application of topological methods in computer science and is widely used in machine learning, computer graphics, coordinated mobile robotics, and more. A ...

Abstract: Several generalisations to the classical Gauss quadrature formulae have been developed over the last few years. When the integrand has singularities near the interval of integration, ...

A Python bot that renders a cubic formula into Desmos software with its possible rational roots. This project target to improve study of Rational Roots Theorem for cubic expressions resolution through ...

We call a rational map f graph critical if any critical point either belongs to an invariant finite graph G, or has minimal limit set, or is nonrecurrent and has limit set disjoint from G. We prove ...

Given a cyclic ordering of external particles and an n-point tree Feynman graph T, the tree-graph integral F_T is defined in such a way that F_T has only the poles relevant to T, that there is a ...