Related papers: A Generalized Numeration Base
A general proposition is proved relating multiplicities (of restriction of a representation of a group to a subgroup) under basechange, and used to calculate some multiplicities for cuspidal representations which become principal series…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…
We call an integer N>1 primover to base a if it either prime or overpseudoprime to base a. We prove, in particular, that every Fermat number is primover to base 2. We also indicate a simple process of receiving of primover divisors of…
Symmetry adapted bases in quantum chemistry and bases adapted to quantum information share a common characteristics: both of them are constructed from subspaces of the representation space of the group SO(3) or its double group (i.e.,…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
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$.
A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq…
In the paper it is considered the generalized Faber polynomials defined inside and outside a regular curve on the complex plane. The weighted Smirnov spaces corresponding to bounded and unbounded regions are defined. It is proved that the…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
Let $f$ be an arithmetical function. The matrix $[f(i,j)]_{n\times n}$ given by the value of $f$ in greatest common divisor of $(i,j)$, $f\big((i,j)\big)$ as its $i,\; j$ entry is called the greatest common divisor (GCD) matrix. We consider…
Integral bases, a minimal set of solutions to $Ax\leq b, x\in\Z^n$ that generate any other solution to $Ax\leq b, x\in\Z^n$, as a nonnegative integer linear combination, are always finite and are at the core of the Integral Basis Method…
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
The cluster multiplication formulas for a generalized quantum cluster algebra of Kronecker type are explicitly given. Furthermore, a positive bar-invariant $\mathbb{Z}[q^{\pm\frac{1}{2}}]$-basis of this algebra is constructed.
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums.…
For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…
In this work we present a natural generalization of strong pseudoprime to base $b$, which we have called $q$-pseudoprime to base $b$. It allows us to present another way to define a Midy's number to base $b$ (overpseudoprime to base $b$).…