English
Related papers

Related papers: A Geometric Algorithm for the Factorization of Spi…

200 papers

We prove a theorem on algebraic osculation and we apply our result to the Computer Algebra problem of polynomial factorization. We consider X a smooth completion of the complex plane and D an effective divisor supported on the boundary of…

Algebraic Geometry · Mathematics 2009-04-14 Martin Weimann

A superintegrable system is, roughly speaking, a system that allows more integrals of motion than degrees of freedom. This review is devoted to finite dimensional classical and quantum superintegrable systems with scalar potentials and…

Mathematical Physics · Physics 2015-06-17 Willard Miller , Sarah Post , Pavel Winternitz

Non-negative Matrix Factorization (NMF) asks to decompose a (entry-wise) non-negative matrix into the product of two smaller-sized nonnegative matrices, which has been shown intractable in general. In order to overcome this issue, the…

Data Structures and Algorithms · Computer Science 2019-07-15 Zhihuai Chen , Yinan Li , Xiaoming Sun , Pei Yuan , Jialin Zhang

This paper studies the unitary diagonalization of matrices over formal power series rings. Our main result shows that a normal matrix is unitarily diagonalizable if and only if its minimal polynomial completely splits over the ring and the…

Commutative Algebra · Mathematics 2026-02-10 Zihao Dai , Hao Liang , Jingyu Lu , Lihong Zhi

In a previous work, both the constants of motion of a classical system and the symmetries of the corresponding quantum version have been computed with the help of factorizations. As their expressions were not polynomial, in this paper the…

Mathematical Physics · Physics 2014-04-29 J. A. Calzada , Ş. Kuru , J. Negro

In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…

Numerical Analysis · Mathematics 2016-05-30 Oliver J. D. Barrowclough , Tor Dokken

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

Number Theory · Mathematics 2017-09-19 Amalaswintha Wolfsdorf

Tropical geometry is a degeneration of classical geometry which loose the property of unique factorization for polynomials. In this paper we explore a structure that is known to be a semi-degeneration between the classical algebra and the…

Algebraic Geometry · Mathematics 2014-01-03 Erez Sheiner

The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…

Dynamical Systems · Mathematics 2016-03-04 Laura Menini , Corrado Possieri , Antonio Tornambè

A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…

Numerical Analysis · Mathematics 2025-03-19 Charlotte Vermeylen , Marc Van Barel

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Exactly Solvable and Integrable Systems · Physics 2009-11-11 F. Musso , A. Shabat

Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary…

Data Structures and Algorithms · Computer Science 2013-10-21 Dóra Erdős , Pauli Miettinen

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

General Mathematics · Mathematics 2007-05-23 Aleksandr Golubchik

We present new algorithms to detect and correct errors in the lower-upper factorization of a matrix, or the triangular linear system solution, over an arbitrary field. Our main algorithms do not require any additional information or…

Symbolic Computation · Computer Science 2019-01-31 Jean-Guillaume Dumas , Joris Van Der Hoeven , Clément Pernet , Daniel Roche

We consider problems of dimensionality reduction and learning data representations for continuous spaces with two or more independent degrees of freedom. Such problems occur, for example, when observing shapes with several components that…

Machine Learning · Computer Science 2021-05-31 Sharon Zhang , Amit Moscovich , Amit Singer

We develop the algebraic polynomial theory for "supertropical algebra," as initiated earlier over the real numbers by the first author. The main innovation there was the introduction of "ghost elements," which also play the key role in our…

Commutative Algebra · Mathematics 2009-12-07 Zur Izhakian , Louis Rowen

The three dimensional superintegrable systems with quadratic integrals of motion have five functionally independent integrals, one among them is the Hamiltonian. Kalnins, Kress and Miller have proved that in the case of non degenerate…

Mathematical Physics · Physics 2009-02-03 Y. Tanoudis , C. Daskaloyannis

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

Symbolic Computation · Computer Science 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

Regularization techniques are widely employed in optimization-based approaches for solving ill-posed inverse problems in data analysis and scientific computing. These methods are based on augmenting the objective with a penalty function,…

Optimization and Control · Mathematics 2021-06-08 Yong Sheng Soh , Venkat Chandrasekaran