Related papers: Positional numeral systems over polyadic rings
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
Parallel addition, i.e., addition with limited carry propagation, has been so far studied for complex bases and integer alphabets. We focus on alphabets consisting of integer combinations of powers of the base. We give necessary conditions…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
The additive monoid $R_+(x)$ is defined as the set of all nonnegative integer linear combinations of binomial coefficients $\binom{x}{n}$ for $n \in \mathbb Z_+$. This paper is concerned with the inquiry into the structure of $R_+(\alpha)$…
In this paper we consider the Waring rank of monomials over the real and the rational numbers. We give a new upper bound for it by establishing a way in which one can take a structured apolar set for any given monomial…
The usual dictionary between geometry and commutative algebra is not appropriate for Arithmetic geometry because addition is a singular operation at the "Real prime". We replace Rings, with addition and multiplication, by Props (=strict…
While the number of polyominoes is known to be supermultiplicative by a simple concatenation argument, it is still unknown whether the same applies to polyiamonds. This article proves that if $\ell,m$ are not both $1$, then $T(\ell+m)\ge…
Decision Diagrams(DDs) are one of the most popular representations for boolean functions. They are widely used in the design and verification of circuits. Different types of DDs have been proven to represent important functions in…
This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…
We consider numeration systems where digits are integers and the base is an algebraic number $\beta$ such that $|\beta|>1$ and $\beta$ satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases…
The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…
Alternate bases are a numeration system that generalizes the R\'enyi numeration system. It is common in this context to construct examples or counter-examples by specifying the expansions of $1$ in the desired system. While it is easy to…
We consider positional numeration system with negative base $-\beta$, as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when $\beta$ is a quadratic Pisot number. We study a class of roots…
A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…
We introduce a new approach for generating combinatorial identities and formulas by the application of Kronecker substitution to polynomial expansions within quotient rings. Our main result enables the derivation of elementary arithmetic…
Let $\mathcal{R}$ be a unital ring with involution. The notions of 1MP-inverse and MP1-inverse are extended from $M_{m,n}(\mathbb{C)}$, the set of all $m\times n $ matrices over $\mathbb{C}$, to the set $\mathcal{R}% ^{\dagger}$ of all…
For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…
Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…
In this paper we study standard bases for submodules of a mixed power series and polynomial ring $R[[t_1,\ldots,t_m]][x_1,\ldots,x_n]^s$ respectively of their localization with respect to a $t$-local monomial ordering for a certain class of…