相关论文: On the Jacobian Question

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

Dual Bernstein polynomials find many applications in approximation theory, computational mathematics, numerical analysis and computer-aided geometric design. In this context, one of the main problems is fast and accurate evaluation both of…

The rank two Jacobi algebra $\mathcal{J}_2$ is used to provide an interpretation of the two-variable Jacobi polynomials $J_{n,k}^{(a,b,c)}(x,y)$ on the triangle, as overlaps between two representation bases. The subalgebra structure of…

In this paper we propose a method of solving the Jacobi inversion problem in terms of multiply periodic $\wp$ functions, also called Kleinian $\wp$ functions. This result is based on the recently developed theory of multivariable sigma…

In this thesis quadratic and cubic algebras, which are extensions of SU(1,1) and SU(2) are studied in detail, with particular attention being given to their construction, their finite and infinite dimensional irreducible representations and…

We present a method to decompose a set of multivariate real polynomials into linear combinations of univariate polynomials in linear forms of the input variables. The method proceeds by collecting the first-order information of the…

In this paper, we introduce the notion of the complete joint Jacobi polynomial of two linear codes of length $n$ over $\mathbb{F}_q$ and $\mathbb{Z}_k$. We give the MacWilliams type identity for the complete joint Jacobi polynomials of…

Variable projection methods prove highly efficient in solving separable nonlinear least squares problems by transforming them into a reduced nonlinear least squares problem, typically solvable via the Gauss-Newton method. When solving…

We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…

The Jacobian Conjecture uses the equation $det(Jac(F))\in k^*$, which is a very short way to write down many equations putting restrictions on the coefficients of a polynomial map $F$. In characteristic $p$ these equations do not suffice to…

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

The polynomial and the adversary methods are the two main tools for proving lower bounds on query complexity of quantum algorithms. Both methods have found a large number of applications, some problems more suitable for one method, some for…

We introduce a new method in the attempt to prove the Jacobian conjecture. In the complex dimension 2 case, we apply this method to prove some new results related the Jacobian conjecture.

This article is about polynomial maps with a certain symmetry and/or antisymmetry in their Jacobians, and whether the Jacobian Conjecture is satisfied for such maps, or whether it is sufficient to prove the Jacobian Conjecture for such…

We investigate the computational problem of determining whether a bivariate polynomial with non-negative coefficients and no constant term can attain a prime value. While classical conjectures such as Bouniakowsky's provide necessary…

This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the…

It was first pointed out by Weil that we can use classical invariant theory to compute the Jacobian of a genus one curve. The invariants required for curves of degree n = 2,3,4 were already known to the nineteenth centuary invariant…

In this paper, we investigate numerical solutions for inverse singular value problems (for short, ISVPs) arising in various applications. Inspired by the methodologies employed for inverse eigenvalue problems, we propose a Cayley-free…

We describe a suite of fast algorithms for evaluating Jacobi polynomials, applying the corresponding discrete Sturm-Liouville eigentransforms and calculating Gauss-Jacobi quadrature rules. Our approach is based on the well-known fact that…

Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order methods for variational inequalities require precise…