Related papers: Solving the Gibbs Problem with Algebraic Projectiv…
Given a set of astrometric observations of the same object, the problem of orbit determination is to compute the orbit and to assess its uncertainty and reliability. For the next generation surveys, with much larger number density of…
In this series of lectures directed towards a mainly mathematically oriented audience I try to motivate the use of operator algebra methods in quantum field theory. Therefore a title as ``why mathematicians are/should be interested in…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
We present the notion of orbit decidability into a more general framework, exploring interesting generalizations and variations of this algorithmic problem. A recent theorem by Bogopolski-Martino-Ventura gave a renovated protagonism to this…
Consider a simple algebraic group $G$ of classical type and its Lie algebra $\mathfrak{g}$. Let $(e,h,f) \subset \mathfrak{g}$ be an $\mathfrak{sl}_2$-triple and $Q_e= C_G(e,h,f)$. The torus $T_e$ that comes from the…
We review two initial orbit determination methods for too short arcs (TSAs) of optical observations of a solar system body. These methods employ the conservation laws of Kepler's problem, and allow to attempt the linkage of TSAs referring…
Many physical problems can be formulated as operator equations of the form Au = f. If these operator equations are ill-posed, we then resort to finding the approximate solutions numerically. Ill-posed problems can be found in the fields of…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the intersection of projection factor sets produced by different CAD projection orders. In other words, it computes the gcd…
This is the first paper in a series of eight where in the first three we develop a systematic approach to the geometric algebras of multivectors and extensors, followed by five papers where those algebraic concepts are used in a novel…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
In a full 3D context, we study a projectile subject to linear drag, a non-uniform gravitational field, time-dependent wind, and parameterized atmospheric thinning. In this general context, we provide integral solutions, exact to $\mathcal{…
Object Detection (OD) is an important task in Computer Vision with many practical applications. For some use cases, OD must be done on videos, where the object of interest has a periodic motion. In this paper, we formalize the problem of…
The optimal transport (OT) problem is a classical optimization problem having the form of linear programming. Machine learning applications put forward new computational challenges in its solution. In particular, the OT problem defines a…
We present a purely algebraic formulation (i.e. polynomial equations only) of the minimum-cost multi-impulse orbit transfer problem without time constraints, while keeping all the variables with a precise physical meaning. We apply general…
The Ordered Covering Problem (OCP) arises in the context of the Discretizable Molecular Distance Geometry Problem (DMDGP), where the ordering of pruning edges significantly impacts the performance of the SBBU algorithm for protein structure…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
We revisit the classical Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. It has long been known that P3P can be reduced to a quartic polynomial with…
We investigate a singularly perturbed, non-convex variational problem arising in materials science with a combination of geometrical and numerical methods. Our starting point is a work by Stefan M\"uller, where it is proven that the…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…