New Characterization of the Factor Refinement Algorithm with Applications

DOI10.1145/3597066.3597108MaRDI QIDQ6081973zbMATH OpenOpenAlexWikidataFDO

Authors Aditya Narayan Ravi, Ilya Volkovich

Publication date 3 November 2023

Published in Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3597066.3597108

zbMATH Keywords

arithmetic functionsfactor refinementGCD-free basesinteger factorizationnumber theoretic functionssquare-free decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• A new algorithm for the least-squares solution in factor analysis
• scientific article; zbMATH DE number 434791
• scientific article; zbMATH DE number 4156335
• Fast separable factorization and applications
• A new factorization technique of the matrix mask of univariate refinable functions
• Further applications of the Cauchon algorithm to rank determination and bidiagonal factorization
• On the Algorithmic Solvability of Spectral Factorization and Applications
• New perturbation analyses for the Cholesky factorization
• Factorization approach to structured low-rank approximation with applications
• A New Modified Cholesky Factorization

Cites work

• A deterministic version of Pollard's p-1 algorithm
• Computing Hermite and Smith normal forms of triangular integer matrices
• Detecting perfect powers by factoring into coprimes
• Deterministic factoring with oracles
• Factor Refinement
• Factoring into coprimes in essentially linear time
• scientific article; zbMATH DE number 4191829 (Why is no real title available?)
• scientific article; zbMATH DE number 3977110 (Why is no real title available?)
• scientific article; zbMATH DE number 1302808 (Why is no real title available?)
• scientific article; zbMATH DE number 799791 (Why is no real title available?)
• Number-theoretic functions which are equivalent to number of divisors
• On factor refinement in number fields
• Reductions among number theoretic problems
• Riemann's hypothesis and tests for primality
• Some remarks on computing the square parts of integers
• Sums of Divisors, Perfect Numbers and Factoring
• The Power of Leibniz-Like Functions as Oracles

Cited in

(1)

• Factor Refinement

This page was built for publication: New Characterization of the Factor Refinement Algorithm with Applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081973)