Related papers: Degree-optimal moving frames for rational curves
The problem of computing saddle points is important in certain problems in numerical partial differential equations and computational chemistry, and is often solved numerically by a minimization problem over a set of mountain passes. We…
In this brief paper, we provide a mathematical framework that exploits the relationship between the maximum principle and dynamic programming for characterizing optimal learning trajectories in a class of learning problem, which is related…
An algorithm and associated strategy for solving polynomial systems within the optimization framework is presented. The algorithm and strategy are named, respectively, the penetrating gradient algorithm and the deepest descent strategy. The…
In this paper we propose two proximal gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either…
Suppose $\mathcal{X}$ is an $n$-correct set of nodes in the plane, that is, it admits a unisolvent interpolation with bivariate polynomials of total degree less than or equal to $n.$ Then an algebraic curve $q$ of degree $k\le n$ can pass…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…
We get three basic results in algebraic dynamics: (1). We give the first algorithm to compute the dynamical degrees to arbitrary precision. (2). We prove that for a family of dominant rational self-maps, the dynamical degrees are lower…
In [Q. Liao et al., Commun. Math. Sci., 20(2022)], a linear-time Sinkhorn algorithm is developed based on dynamic programming, which significantly reduces the computational complexity involved in solving optimal transport problems. However,…
Neuroscientific studies of drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole. This…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
Optimal mass transport, also known as the earth mover's problem, is an optimization problem with important applications in various disciplines, including economics, probability theory, fluid dynamics, cosmology and geophysics to cite a few.…
The modularity theorem implies that for every elliptic curve $E /\mathbb{Q}$ there exist rational maps from the modular curve $X_0(N)$ to $E$, where $N$ is the conductor of $E$. These maps may be expressed in terms of pairs of modular…
For a dominant rational self-map on a smooth projective variety defined over a number field, Kawaguchi and Silverman conjectured that the (first) dynamical degree is equal to the arithmetic degree at a rational point whose forward orbit is…
The Degree Realization problem requires, given a sequence $d$ of $n$ positive integers, to decide whether there exists a graph whose degrees correspond to $d$, and to construct such a graph if it exists. A more challenging variant of the…
The notion of Bezout matrix is an essential tool in studying broad variety of subjects: zeroes of polynomials, stability of differential equations, rational transformations of algebraic curves, systems of commuting nonselfadjoint operators,…
We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
For physical theories, the degree of arbitrariness of a system is of great importance, and is often closely linked to the concept of degree of freedom, and for most systems this number is far from obvious. In this paper we present an easy…