Related papers: Minimal weight expansions in Pisot bases
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in the space of…
This paper presents a detailed, self-contained proof of a BBP-type formula for $\pi^2$ expressed in the golden ratio base, $\phi$. The formula was discovered empirically by the author in 2004. The proof presented herein is built upon a…
This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal…
The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least…
This paper deals with the set of $\alpha\in{\mathbb{R}}$ such that $\alpha \zeta^{n} \bmod 1$ tends to $0$ for a fixed $\zeta\in{\mathbb{R}}$, which we call $\mathscr{M}_{\zeta}$. Predominately the case of Pisot numbers $\zeta$ is studied.…
Define the minimal excludant of an overpartition $\pi$, denoted $ \overline{\text{mex}}(\pi)$, to be the smallest positive integer that is not a part of the non-overlined parts of $\pi$. For a positive integer $n$, the function…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…
A finite automaton is called bideterministic if it is both deterministic and codeterministic -- that is, if it is deterministic and its transpose is deterministic as well. The study of such automata in a weighted setting is initiated. All…
Let $\beta>1$ and let $m>\be$ be an integer. Each $x\in I_\be:=[0,\frac{m-1}{\beta-1}]$ can be represented in the form \[ x=\sum_{k=1}^\infty \epsilon_k\beta^{-k}, \] where $\epsilon_k\in\{0,1,...,m-1\}$ for all $k$ (a $\beta$-expansion of…
If $\omega_t > \beta$ for every $t \in \mathbb{N}$ and for some $\beta > 0$, then the sequence $\{\omega_t\}_{t \in \mathbb{N}}$ represents a weighted sequence of real numbers. In this article, we primarily introduce the concepts of rough…
Major progress has been made in the previous decade to characterize the asymptotic behavior of regularized M-estimators in high-dimensional regression problems in the proportional asymptotic regime where the sample size $n$ and the number…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
It is shown that any Hermitian operator can be expanded in terms of a set of operators formed from biorthogonal basis, and the expansion coefficients are given as products of weight functions and weak values, shedding a new light on the…
We introduce and study series expansions of real numbers with an arbitrary Cantor real base $\boldsymbol{\beta}=(\beta_n)_{n\in\mathbb{N}}$, which we call $\boldsymbol{\beta}$-representations. In doing so, we generalize both representations…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…
We consider the minimum weight and smallest weight minimum-size dominating set problems in vertex-weighted graphs and networks. The latter problem is a two-objective optimization problem, which is different from the classic minimum weight…
The beta-encoder was recently proposed as a quantization scheme for analog-to-digital conversion; in contrast to classical binary quantization, in which each analog sample x in [-1,1] is mapped to the first N bits of its base-2 expansion,…
In this paper we study the distribution of the sequence $(\alpha \zeta^{n})_{n\geq 1}$ mod $1$, where $\alpha,\zeta$ are fixed positive real numbers, with special focus on the accumulation point $0$. For this purpose we introduce…