Related papers: On the Factorization of Two Adjacent Numbers in Mu…
We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
A factorization of an element $x$ in a monoid $(M, \cdot)$ is an expression of the form $x = u_1^{z_1} \cdots u_k^{z_k}$ for irreducible elements $u_1, \ldots, u_k \in M$, and the length of such a factorization is $z_1 + \cdots + z_k$. We…
In the paper, I considered construction of algebra of fractions of algebra with conjugation. I also considered algebra of polynomials and algebra of rational mappings over algebra with conjugation.
An extension to the factorisation principle as suggested by Fermat is presented.We start from a symmetry of natural numbers and obtain the factorisation principle therefrom.Later it is extended further to test the primality of any natural…
There is a natural construction which associates to a finitely generated, countable, discrete group $G$ and a 3-cocycle $\omega$ of $G$ an inclusion of II$_1$ factors, the so-called diagonal subfactors (with cocycle). In the case when the…
We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…
In this paper, we study numbers $n$ that can be factored in four different ways as $n = A B = (A + a_1) (B - b_1) = (A + a_2) (B - b_2) = (A + a_3) (B - b_3)$ with $B \le A$, $1 \le a_1 < a_2 < a_3 \le C$ and $1 \le b_1 < b_2 < b_3 \le C$.…
When studying the properties of a ring $R$, it is often useful to compare $R$ to other rings whose properties are already known. In this paper, we define three ways in which a subring $R$ might be compared to a larger ring $T$: being…
We provide a method for factoring all bounded ratios of the form $$\det A(I_1|I_1')\det A(I_2|I_2')/\det A(J_1|J_1')\det A(J_2|J_2')$$ where $A$ is a totally positive matrix, into a product of more elementary ratios each of which is bounded…
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…
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…
This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view.
In the present paper the authors construct normal numbers in base $q$ by concatenating $q$-adic expansions of prime powers $\lfloor\alpha p^\theta\rfloor$ with $\alpha>0$ and $\theta>1$.
This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…
In his Classical approximation to the Twin prime problem, Selberg proved that for $x$ sufficiently large, there is an $n \in (x,2x)$ such that $2^{\Omega(n)}+2^{\Omega(n+2)} \leq \lambda$ with $\lambda=14$, where $\Omega(n)$ is the number…
The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a…
We define two types of the $\alpha$-Farey maps $F_{\alpha}$ and $F_{\alpha, \flat}$ for $0 < \alpha < \tfrac{1}{2}$, which were previously defined only for $\tfrac{1}{2} \le \alpha \le 1$ by R.~Natsui (2004). Then, for each $0 < \alpha <…