Related papers: A Generalized Numeration Base
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…
The generalized number-theoretic transformation (NPT) is formulated on the basis of the exponential function theorem, which allows us to replace operations modulo the expression as a whole by modulo operations on the exponent of this…
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
A generalized quantum distribution function is introduced. The corresponding ordering rule for non-commuting operators is given in terms of a single parameter. The origin of this parameter is in the extended canonical transformations that…
In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…
Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$…
This lecture addresses some general ideas behind numerical computations ranging from representation of numbers in computers to stability and accuracy of standard algorithms for some simple mathematical problems.
Signature-based algorithms is a popular kind of algorithms for computing Gr\"obner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a…
Let p be a prime number. In this paper we use an old technique of Ore, based on Newton polygons, to construct in an efficient way p-integral bases of number fields defined by a p-regular equation. To illustrate the potential applications of…
The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
Our main result is that any real cubic algebraic number has a continued fraction expansion with polynomial coefficients. Some generalizations are mentioned.
We formalize the Gauss-Landau theorem, providing a unified prime factorization approach to computing the GCD and LCM of finite nonzero integer sets. Although commonly used as a heuristic or technique in elementary number theory education,…
An integer of the form $p_m(x)= \frac{(m-2)x^2-(m-4)x}{2} \ (m\ge 3)$, for some integer $x$ is called a generalized polygonal number of order $m$. A ternary sum $\Phi_{i,j,k}^{a,b,c}(x,y,z)=ap_{i+2}(x)+bp_{j+2}(y)+cp_{k+2}(z)$ of…
In this paper, we use the transference principle to investigate the representation of sufficiently large positive integers as the sum of prime powers and integer powers, where the primes are drawn from a positive density subset of the set…
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same…
A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…