Related papers: Alphabets, rewriting trails and periodic represent…

In this article, we investigate the $\beta$-expansions of real algebraic numbers. In particular, we give new lower bounds for the number of digit exchanges in the case where $\beta$ is a Pisot or Salem number. Moreover, we define a new…

Two confluent rewriting systems in noncommutatives polynomials are constructed using the equations allowing the identification of the local coordinates (of second kind) of the graphs of the $\zeta$ polymorphism as being (shuffle or…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

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 greedoid is a generalization of a matroid allowing for more flexible analyses and modeling of combinatorial optimization problems. However, these structures decimate many matroid properties contributing to their pervasive nature. A…

Let $0 < \theta \leqslant 1$. A sequence of positive integers $(b_n)_{n=1}^\infty$ is called a weak greedy approximation of $\theta$ if $\sum_{n=1}^{\infty}1/b_n = \theta$. We introduce the weak greedy approximation algorithm (WGAA), which,…

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral…

Given a finite set of bases $b_1$, $b_2$, \dots, $b_r$ (integers greater than $1$), a multi-base representation of an integer~$n$ is a sum with summands $db_1^{\alpha_1}b_2^{\alpha_2} \cdots b_r^{\alpha_r}$, where the $\alpha_j$ are…

In a recent letter, new representations were proposed for the pair of sequences ($\gamma,\delta$), as defined formally by Bailey in his famous lemma. Here we extend and prove this result, providing pairs ($\gamma,\delta$) labelled by the…

For the generalized Jacobi, Laguerre and Hermite polynomials $P_n^{(\alpha_n, \beta_n)} (x), L_n^{(\alpha_n)} (x),$\break $H_n^{(\gamma_n)} (x)$ the limit distributions of the zeros are found, when the sequences $\alpha_n$ or $\beta_n$ tend…

We study $\alpha$-adic expansions of numbers in an extension field, that is to say, left infinite representations of numbers in the positional numeration system with the base $\alpha$, where $\alpha$ is an algebraic conjugate of a Pisot…

Consider $\beta > 1$ and $\lfloor \beta \rfloor$ its integer part. It is widely known that any real number $\alpha \in \Bigl[0, \frac{\lfloor \beta \rfloor}{\beta - 1}\Bigr]$ can be represented in base $\beta$ using a development in series…

We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\phi(0)=0^a1$, $\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with quadratic non-simple…

We prove that $\beta_p(I(G)) = \beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=\pd(I(G))$ and $r:=\reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibi's conjecture is true for the Betti numbers in the last columm…

Let $\mathbb{Q}(\alpha)$ and $\mathbb{Q}(\beta)$ be algebraic number fields. We describe a new method to find (if they exist) all isomorphisms, $\mathbb{Q}(\beta) \rightarrow \mathbb{Q}(\alpha)$. The algorithm is particularly efficient if…

Let $K$ be a field, $S$ a polynomial ring and $E$ an exterior algebra over $K$, both in a finite set of variables. We study rigidity properties of the graded Betti numbers of graded ideals in $S$ and $E$ when passing to their generic…

Let $d\geq 2$ and $k\geq 1$ be fixed. We prove that, for every $\epsilon>0$ and every real $\beta$, there exist integers $1\leq b_1,\ldots,b_k\leq N$ such that \[ \left\|\sum_{j=1}^k b_j^{1/d}-\beta\right\| \ll_{d,k,\epsilon}…

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

For $\beta > 1$, a sequence $(c_n)_{n \geq 1} \in \mathbb{Z}^{\mathbb{N}^+}$ with $0 \leq c_n < \beta$ is the \emph{beta expansion} of $x$ with respect to $\beta$ if $x = \sum_{n = 1}^\infty c_n\beta^{-n}$. Defining $d_\beta(x)$ to be the…

We present a simple greedy procedure to compute an $(\alpha,\beta)$-spanner for a graph $G$. We then show that this procedure is useful for building fault-tolerant spanners, as well as spanners for weighted graphs. Our first main result is…