Related papers: Backtracking New Q-Newton's method, Schr\"oder's t…
A new approach to the theory of polynomial solutions of q - difference equations is proposed. The approach is based on the representation theory of simple Lie algebras and their q - deformations and is presented here for U_q(sl(n)). First a…
Bernstein-Sato polynomial of a hypersurface is an important object with numerous applications. It is known, that it is complicated to obtain it computationally, as a number of open questions and challenges indicate. In this paper we propose…
We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…
The Newton-Raphson basins of attraction, associated with the libration points (attractors), are revealed in the pseudo-Newtonian planar circular restricted three-body problem, where the primaries have equal masses. The parametric variation…
We describe in this talk three methods of constructing different links with the same Jones type invariant. All three can be thought as generalizations of mutation. The first combines the satellite construction with mutation. The second uses…
The present paper investigates the binary system of quasars in the framework of the Circular Restricted Three-Body Problem. The parametric evolution of libration points, the geometry of zero-velocity curves are one of the crucial aspects of…
This paper tackles the problem of constructing Bezout matrices for Newton polynomials in a basis-preserving approach that operates directly with the given Newton basis, thus avoiding the need for transformation from Newton basis to monomial…
In the Lagrange-Newton method, where Newton's method is applied to a Lagrangian function that includes equality constraints, all stationary points are saddle points. It is therefore not possible to use a line-search method based on the…
The Julia set of the Chebyshev's method applied to polynomials with exactly two distinct roots is shown to be connected, and its Fatou set is proved to be the union of attracting basins corresponding to the two roots. Further, if the two…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
Multiline queues are versatile combinatorial objects that play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. Specializing the results of…
A zero-finding technique for solving nonlinear equations more efficiently than they usually are with traditional iterative methods in which the order of convergence is improved is presented. The key idea in deriving this procedure is to…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
Newton's method for finding an unconstrained minimizer for strictly convex functions, generally speaking, does not converge from any starting point. We introduce and study the damped regularized Newton's method (DRNM). It converges globally…
We review the q-deformed spin network approach to Topological Quantum Field Theory and apply these methods to produce unitary representations of the braid groups that are dense in the unitary groups. Our methods are rooted in the bracket…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Recent progress in string theory has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be understood in topological terms. We describe in detail how to…
For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $\chi$ when $p$ is larger than an explicit…
To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…
Let f be a polynomial of degree at least 2 with coefficients in a number field K, let x_0 be a sufficiently general element of K, and let alpha be a root of f. We give precise conditions under which Newton iteration, started at the point…