• Home
  • Search
  • Using basis computation to determine pseudo-multiplicative independence
  • Cite Icon6
  • https://doi.org/10.1145/800205.806340Copy DOI Icon

Using basis computation to determine pseudo-multiplicative independence

  • Jan 1, 1976
  • H I Epstein
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper describes a procedure for determining when a set of rational functions are pseudo-multiplicatively independent, i.e. when no non-trivial power product of the rational functions can be a constant. The method used is to derive a multiplicative basis of factors of the numerators and denominators of the rational functions; the basis is then used to derive a system of homogeneous linear equations which will have a non-trivial solution if and only if the rational functions are pseudo-multiplicatively dependent. Algorithms which find a basis for a set of Gaussian rational functions and the corresponding linear equations are presented in detail and bounds on their theoretical computing times are derived.

Similar Papers
  • Book Chapter

COMPUTATION OF CASIMIR INVARIANTS OF LIE ALGEBRAS

  • Jan 01, 1977
  • Computers in Nonassociative Rings and Algebras
  • C.W Conatser +1
  • Research Article
  • Citations1

Solution of a system of linear equations with given error sets for coefficients

  • Jan 01, 1982
  • Applications of Mathematics
  • František Šik
  • Research Article

The critical state and its thermodynamic stability

  • Jun 01, 1988
  • Soviet Physics Journal
  • E D Soldatova +1
  • Conference Article
  • Citations14

NP-hardness of approximately solving linear equations over reals

  • Jun 06, 2011
  • Subhash Khot +1
  • Book Chapter
  • Citations3

Siegel’s Lemma Is Sharp

  • Jan 01, 2017
  • József Beck
  • Research Article

Solving systems of homogeneous linear algebraic equations in pricing problems of an alternative financial model

  • Jan 30, 2024
  • Finance and Credit
  • Sergei S Kuznetsov +4
  • Research Article
  • Citations1

Positive integer solutions of systems of linear equations and polynomials of small weight divisible by (1 − x)r

  • Jan 01, 2014
  • Discrete Mathematics and Applications
  • Alexander S Rybakov
  • Research Article
  • Citations7

Guided-mode analysis by the Lanczos-Fourier expansion.

  • Nov 01, 2002
  • Journal of the Optical Society of America A
  • Panagiota A Koukoutsaki +2
  • Research Article

The Characterization of Sufficient Visibility in the Direct Reference Plane Approach for Multiple Views with Missing Data

  • Apr 01, 2006
  • International Journal of Computer Vision
  • Rudi Penne
  • Research Article
  • Citations8

Trapped-Energy Thickness-Extensional Mode of a Partially Electroded ZnO Thin-Film Resonator.

  • Jun 08, 2018
  • IEEE Transactions on Ultrasonics, Ferroelectrics, and Frequency Control
  • Zinan Zhao +3
  • Book Chapter

Additive Properties of Sets and Substitutive Dynamics

  • Jan 01, 2015
  • Svetlana Puzynina +1
  • Research Article
  • Citations12

Solvability of Rado systems in D-sets

  • May 13, 2009
  • Topology and its Applications
  • M Beiglböck +3
  • Research Article

Linear formulation of the inverse problem for the amplitude of seismic waves

  • Jun 01, 1982
  • Geophysical Journal International
  • Georges Jobert
  • Research Article
  • Citations2

Дифференцирование линейных алгебр с единицей над полем

  • Jan 01, 2023
  • Differential Geometry of Manifolds of Figures
  • A.Ya Sultanov +2
  • Research Article
  • Citations51

The roots of matrix pencils (Ay=λBy): existence, calculations, and relations to game theory

  • Jul 01, 1972
  • Linear Algebra and its Applications
  • Gerald L Thompson +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.