Related papers: Detecting bifurcation values at infinity of real p…
We give a complete characterization of polynomials in two complex variables that are cyclic with respect to the coordinate shifts acting on Dirichlet-type spaces in the bidisk, which include the Hardy space and the Dirichlet space of the…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
In this paper, we propose a metric on the space of finite sets of trajectories for assessing multi-target tracking algorithms in a mathematically sound way. The main use of the metric is to compare estimates of trajectories from different…
In a paper from 2010, Budarina, Dickinson and Levesley studied the rational approximation properties of curves parametrized by polynomials with integral coefficients in Euclidean space of arbitrary dimension. Assuming the dimension is at…
We consider a scalar parabolic partial differential equation on the interval with nonlinear boundary conditions that are asymptotically sublinear. As the parameter crosses critical values (e.g. the Steklov eigenvalues), it is known that…
We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…
We adopt A. J. Irving's sieve method to study the almost-prime values produced by products of irreducible polynomials evaluated at prime arguments. This generalizes the previous results of Irving and Kao, who separately examined the…
We show how the Eulcidean algorithm for polynomials can be used to find the intersection points, with multiplicities, of two plane algebraic curves.
A new parameterization and algorithm are proposed for seeking the primary relative maximum of the likelihood function in the three-parameter lognormal distribution. The parameterization yields the dimension reduction of the three-parameter…
A bifurcation is a qualitative change in a family of solutions to an equation produced by varying parameters. In contrast to the local bifurcations of dynamical systems that are often related to a change in the number or stability of…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
For a continuous function $f$ defined on a closed and bounded domain, there is at least one maximum and one minimum. First, we introduce some preliminaries which are necessary through the paper. We then present an algorithm, which is…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…
A solution for Smale's 17th problem, for the case of systems with bounded degree was recently given. This solution, an algorithm computing approximate zeros of complex polynomial systems in average polynomial time, assumed infinite…
The aim of this paper is to study global bifurcations of non-constant solutions of some nonlinear elliptic systems, namely the system on a sphere and the Neumann problem on a ball. We study the bifurcation phenomenon from families of…
We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ...,…
We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…
We provide a numerical method to determine the critical lengths of linear differential operators with constant real coefficients. The need for such a procedure arises when the orders increase. The interest of this article is clearly on the…