相关论文: Factorization of integers and arithmetic functions
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.
Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
A characterization of multiplicative (and additive) arithmetical functions is given. Using this characterization, we show that the group of multiplicative arithmetical functions is isomorphic to the group of additive arithmetical functions.
We present a formal system, E, which provides a faithful model of the proofs in Euclid's Elements, including the use of diagrammatic reasoning.
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
Factorization of an $n\times n$ unitary matrix as a product of $n$ diagonal matrices containing only phases interlaced with $n-1$ orthogonal matrices each one generated by a real vector as well as an explicit form for the Weyl factorization…
We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…
We prove a uniqueness theorem for an entire function, which shares certain values with its higher order derivatives.
We give a proof for the fundamental theorem of algebra,using the Fredholm index phenomena
We show that the Dirac factorization method can be successfully employed to treat problems involving operators raised to a fractional power. The technique we adopt is based on an extension of the Pauli matrices and the properties of the…
Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…
We prove a generalization of Orlov's theorem for matrix factorizations with $n$ steps. Let $X$ be a regular scheme, $W\colon X\to \mathbb{A}^1$ a flat morphism and $D:=W^{-1}(0)$ its central fiber. We construct an appropriate triangulated…
In this paper we give a purely categorical construction of d-fold matrix factorizations of a natural transformation, for any even integer d. This recovers the classical definition of those for regular elements in commutative rings due to…
We prove Cuntz-Krieger and graded uniqueness theorems for Steinberg algebras. We also show that a Steinberg algebra is basically simple if and only if its associated groupoid is both effective and minimal. Finally we use results of…
In this paper, we develop the theory of the necklace ring and the logarithmic function. Regarding the necklace ring, we introduce the necklace ring functor $Nr$ from the category of special $\ld$-rings into the category of special…