Related papers: Simerka - Quadratic Forms and Factorization

Bounds and other relations involving variables connected with Carmichael numbers are reviewed and extended. Families of numbers or individual numbers attaining or approaching these bounds are given. A new algorithm for finding three-prime…

H. J. S. Smith proved Fermat's two-square theorem using the notion of palindromic continuants. In this paper we extend Smith's approach to proper binary quadratic form representations in some commutative Euclidean rings, including rings of…

In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…

In the mid-1960s A. Pfister discovered extraordinary, strongly multiplicative forms which are now called Pfister forms. From that time on, these forms played a dominant role in the theory of quadratic forms. One of the key properties of a…

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…

Smith normal form evaluations found by Bessenrodt and Stanley for some Hankel matrices of q-Catalan numbers are proven in two ways. One argument generalizes the Bessenrodt-Stanley results for the Smith normal form of a certain multivariate…

In this paper, we compute an explicit matrix factorization of a rank 9 Ulrich sheaf on a general cubic hypersurface of dimension at most 7, whose existence was proved by Manivel. Instead of using invariant theory, we use Shamash's…

In this article, we factor the composite $4n^2 +1$ using Fermat's factorization method. Consequently, we characterized all proper factors of composite $4n^2 +1$ in terms of its form. Furthermore, the composite Fermat's number is considered…

We present a quantum probabilistic algorithm which tests with a polynomial computational complexity whether a given composite number is of the Carmichael type. We also suggest a quantum algorithm which could verify a conjecture by…

We prove that a Schur function of rectangular shape $(M^n)$ whose variables are specialized to $x_1,x_1^{-1},...,x_n,x_n^{-1}$ factorizes into a product of two odd orthogonal characters of rectangular shape, one of which is evaluated at…

Let $n = \mathrm{p}\!\cdot\!\mathrm{q}$ (p < q) and $\Delta = \lvert p-q \rvert$, where p,q are odd integers, then, it is hypothesized that factorizing this composite n will take O(1) time once the steady state value is reached for any…

We find and prove a factorization formula for certain Macdonald Littlewood-Richardson coefficients $c_{\lambda\mu}^{\nu}(q,t)$. Namely, we consider the case that the Kostka number $K_{\mu, \nu -\lambda}$ is $1$. This settles a particular…

Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…

In this paper, a new method to compute a B\'ezier curve of degree n = 2m-1 is introduced, here formulated as a set of points whose coordinates are calculated from two Hankel forms in $\C^m$. From Vandermonde factorizations of the two…

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

This paper considers the factorization of elliptic symbols which can be represented by matrix-valued functions. Our starting point is a \textit{Fundamental Factorization Theorem}, due to Budjanu and Gohberg. We critically examine the work…

Hermann Minkowski introduced a function in 1904 which maps quadratic irrational numbers to rational numbers and this function is now known as Minkowski's question mark function since Minkowski used the notation $?(x)$. This function is a…

Almost all public secure communication relies on the inability to factor large numbers. There is no known analytic or classical numeric method to rapidly factor large numbers. Shor[1] has shown that a quantum computer can factor numbers in…

Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…