相关论文: A Generalized Numeration Base

We study unital groups with a distinguished family of compressions called a compression base. A motivating example is the partially ordered additive group of a von Neumann algebra with all Naimark compressions as the compression base.

This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…

We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…

In this article, we consider weighted sums of generalized polygonal numbers with coefficients $1$ or $2$. We show that for any $m\ge10$, those weighted sums of generalized $m$-gonal numbers represent every non-negative integers if they only…

The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…

Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, ...). Composition is a more complex task. We isolate a large class of power series for which composition can be performed…

We define the finite number ring ${\Bbb Z}_n [\sqrt [m] r]$ where $m,n$ are positive integers and $r$ in an integer akin to the definition of the Gaussian integer ${\Bbb Z}[i]$. This idea is also introduced briefly in [7]. By definition,…

A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $\sigma_k^*$ is a multiplicative arithmetic function defined so that…

In this paper we construct a generating polynomial over the rationals for the generic Newton polygon for the L function of exponential sums of the family of f = x^d+ a x^s parameterized by a, and prove some of its key properties. The…

This work has the purpose of applying the concept of Geometric Calculus (Clifford Algebras) to the Fibre Bundle description of Quantum Mechanics. Thus, it is intended to generalize that formulation to curved spacetimes [the base space of…

We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

In this work we define a unified generating functions for 9 different kinds of set partitions including cyclically ordered set partitions. Such generating function depends on 4 parameters. We consider property of this function and provide…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

The recent discoveries of new forms of quantum statistics require a close look at the under-lying Fock space structure. This exercise becomes all the more important in order to provide a general classification scheme for various forms of…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

In this paper, we define new generalized k-Mersenne numbers and give a formula of generalized Mersenne polynomials and further we study their properties. Moreover, we define Gaussian Mersenne numbers and obtain some identities like Binet…

The present research deals with generalizations of the Salem function with arguments defined in terms of certain alternating expansions of real numbers. The special attention is given to modelling such functions by systems of functional…

The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection…

Motivated by recent results on the minimal base of a permutation group, we introduce a new local invariant attached to arbitrary finite groups. More precisely, a subset Delta of a finite group G is called a p-base (where p is a prime) if…