Related papers: Canonical form of modular hyperbolas with an appli…
A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…
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…
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
We characterize the generating function of the number of representations described in the title in terms of the theory of modular forms. Appealing to this characterization we obtain explicit formulas for the representation numbers as…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…
The method of obtaining the set of noncanonical hypercomplex number systems by conversion of infinite hypercomplex number system to finite hypercomplex number system depending on multiplication rules and factorization method is described.…
Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
Two classes of infinite series involving harmonic numbers and the binomial coefficient $C(3n,n)$ are evaluated in closed form using integrals. Several remarkable integral values and difficult series identities are stated as special cases of…
We prove that the number of geometrically indecomposable representations of fixed dimension vector d of a canonical algebra C defined over a finite field Fq is given by a polynomial in q (depending on C and d). We prove a similar result for…
In this paper, we present an approach to integer factorization using distributed representations formed with Vector Symbolic Architectures. The approach formulates integer factorization in a manner such that it can be solved using neural…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
The paper proposes a polynomial formula for solution quadratic congruences in $\mathbb{Z}_p$. This formula gives the correct answer for quadratic residue and zeroes for quadratic nonresidue. The general form of the formula for $p=3…