Related papers: Minimal weight expansions in Pisot bases
Copeland and Erd\H{o}s showed that the concatenation of primes when written in base $10$ yields a real number that is normal to base $10$. We generalize this result to Pisot number bases in which all integers have finite expansion.
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The…
Let $\beta > 1$ be a real number and $x \in [0,1)$ be an irrational number. We denote by $k_n(x)$ the exact number of partial quotients in the continued fraction expansion of $x$ given by the first $n$ digits in the $\beta$-expansion of $x$…
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…
For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…
The spectrum of a real number $\beta>1$ is the set $X^{m}(\beta)$ of $p(\beta)$ where $p$ ranges over all polynomials with coefficients restricted to ${\mathcal A}=\{0,1,\dots,m\}$. For a quadratic Pisot unit $\beta$, we determine the…
A sharp upper bound for the maximum integer not belonging to an ideal of a numerical semigroup is given and the ideals attaining this bound are characterized. Then the result is used, through the so-called Feng-Rao numbers, to bound the…
In this paper, we consider some additive properties of integers with restricted digit expansions. Let $b\geq 3$ be an integer and $B_b$ be the set of integers whose base $b$ expansions have only digits $\{0,1\}.$ Let $a,b,c$ be three…
Let $A$ be an expanding $2 \times 2$ matrix with rational entries and $\mathbb{Z}^2[A]$ be the smallest $A$-invariant $\mathbb{Z}$-module containing $\mathbb{Z}^2$. Let $\mathcal{D}$ be a finite subset of $\mathbb{Z}^2[A]$ which is a…
In this paper, we first introduce a lower bound technique for the state complexity of transformations of automata. Namely we suggest first considering the class of full automata in lower bound analysis, and later reducing the size of the…
It is known that if $x\in[0,1]$ is polynomial time random (i.e. no polynomial time computable martingale succeeds on the binary fractional expansion of $x$) then $x$ is normal in any integer base greater than one. We show that if $x$ is…
We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…
A folklore conjecture in number theory states that the only integers whose expansions in base $3,4$ and $5$ contain solely binary digits are $0, 1$ and $82000$. In this paper, we present the first progress on this conjecture. Furthermore,…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
A set of non-negative integers is an additive basis with range $n$, if its sumset covers all consecutive integers from 0 to $n$, but not $n+1$. If the range is exactly twice the largest element of the basis, the basis is restricted.…
We derive a series expansion by Hermite polynomials for the price of an arithmetic Asian option. This series requires the computation of moments and correlators of the underlying price process, but for a polynomial jump-diffusion, these are…
The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our…
We compute the logarithmic asymptotics of the non-existence probability (and more generally the lower-tail probability) for a wide variety of combinatorial problems for a range of parameters in the `critical regime' between the regime…
The generic limit set of a dynamical system is the smallest set that attracts most of the space in a topological sense: it is the smallest closed set with a comeager basin of attraction. Introduced by Milnor, it has been studied in the…
In this work, we study the minimization of nonlinear functionals in dimension $d\geq 1$ that depend on a degenerate radial weight $w$. Our goal is to prove the existence of minimizers in a suitable functional class here introduced and to…