Related papers: A geometric approach to integer factorization
This paper presents a mathematical framework for analyzing machine learning models through the geometry of their induced partitions. By representing partitions as Riemannian simplicial complexes, we capture not only adjacency relationships…
A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for theevaluation of Feynman diagrams. We describe the operational rules and illustrate the method…
In a previous work we showcased the factorization method to find the symmetries of superintegrable systems with spherical separability in flat spaces. Here we analyze the same problem, but in constant curvature spaces along the examples of…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
This study reexamines diffusive representations for fractional integrals with the goal of pioneering new variants of such representations. These variants aim to offer highly efficient numerical algorithms for the approximate computation of…
This paper presents a unified approach for localizing some relevant graph topological indices via majorization techniques. Through this method, old and new bounds are derived and numerical examples are provided, showing how former results…
In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of…
We consider a particular approach to the regularization of the inverse problem of computerized tomography. This approach is based on notions pertaining to Fourier synthesis. It refines previous contributions, in which the preprocessing of…
We consider a geometrization, i.e., we identify geometrical structures, for the space of density states of a quantum system. We also provide few comments on a possible application of this geometrization for composite systems.
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…
We study the factorization of the numbers $N = X^2+c$, where $c$ is a fixed constant, and this independently of the value of gcd$(X,c)$. We prove the existence of a family of sequences with arithmetic difference $(U_n, Z_n)$ generating…
In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…
We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
A path-integral quantization on a homogeneous space G/H is proposed based on the guiding principle `first lift to G and then project to G/H'. It is then shown that this principle gives a simple procedure to obtain the inequivalent…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…