Related papers: Parry condition, existence and uniqueness of alter…
We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the R\'enyi system with one real base. We focus on the so-called…
For alternate Cantor real base numeration systems we generalize the result of Frougny and~Solomyak on~arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness…
Expansions in non-integer bases have been extensively investigated since a pioneering work of R\'enyi. We introduce a more general framework of alphabet-base systems that also includes Pedicini's general alphabets and the multiple-base…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…
Positional numeration systems are a large family of numeration systems used to represent natural numbers. Whether the set of all representations forms a regular language or not is one of the most important questions that can be asked of…
In this paper we study the expansions of real numbers in positive and negative real base as introduced by R\'enyi, and Ito & Sadahiro, respectively. In particular, we compare the sets $\mathbb{Z}_\beta^+$ and $\mathbb{Z}_{-\beta}$ of…
Expansions in noninteger positive bases have been intensively investigated since the pioneering works of R\'enyi (1957) and Parry (1960). The discovery of surprising unique expansions in certain noninteger bases by Erd\H os, Horv\'ath and…
In this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an…
In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
In this paper, we consider the positional numeration system, called the Cantor real expansion, on the unit interval $[\gamma, \gamma+1]$, where $\gamma \in \mathbb{R}$, with respect to an alternate base (i.e., a base which is a purely…
Let $R$ be a commutative ring with identity. A unit $u$ of $R$ is called exceptional if $1-u$ is also a unit. When $R$ is a finite commutative ring, we determine the additive and multiplicative structures of its exceptional units; and then…
Arbitrarily sparse sets A of integers are constructed with the property that every integer can be represented uniquely in the form n = a + a', where a and a' belong to the set A and a < a' or a = a'. Some related open problems are stated.
Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains…
Categorical studies of recursive data structures and their associated reasoning principles have mostly focused on two extremes: initial algebras and induction, and final coalgebras and coinduction. In this paper we study their in-betweens.…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…