Related papers: Binary Signed-Digit Integers and the Stern Polynom…

We study a recently introduced base $b$ polynomial analog of Stern's diatomic sequence, which generalizes Stern polynomials of Klavar, Dilcher, Ericksen, Mansour, Stolarsky, and others. We lift some basic properties of base $2$ Stern…

A binary string representation of prime occurrences is a sequence of bits, where $1$ entries encode positions of prime numbers. This is a convenient representation for analysis of prime distribution, since it allows for application of a…

Let $a$ and $b$ be relatively prime positive integers. In this paper the weighted sum $\sum_{n\in{\rm NR}(a,b)}\lambda^{n-1}n^m$ is given explicitly or in terms of the Apostol-Bernoulli numbers, where $m$ is a nonnegative integer, and ${\rm…

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their…

Binary Neural Network (BNN) represents convolution weights with 1-bit values, which enhances the efficiency of storage and computation. This paper is motivated by a previously revealed phenomenon that the binary kernels in successful BNNs…

We prove that the Stern diatomic sequence is asymptotically distributed according to a normal law, on a logarithmic scale. This is obtained by studying complex moments, and the analytic properties of a transfer operator.

The signed-bit representation of real numbers is like the binary representation, but in addition to 0 and 1 you can also use -1. It lends itself especially well to the constructive (intuitionistic) theory of the real numbers. The first part…

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…

Let a(n) be the Stern's diatomic sequence, and let x1,...,xr be the distances between successive 1's in the binary expansion of the (odd) positive integer n. We show that a(n) is obtained by evaluating generalized Chebyshev polynomials when…

Stern's signature scheme is a historically important code-based signature scheme. A crucial optimization of this scheme is to generate pseudo-random vectors and a permutation instead of random ones, and most proposals that are based on…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Let $m$ be a positive integer and $b_{m}(n)$ be the number of partitions of $n$ with parts being powers of 2, where each part can take $m$ colors. We show that if $m=2^{k}-1$, then there exists the natural density of integers $n$ such that…

We derive some new signed Mahonian polynomials over the complex reflection group $G(r,1,n)=C_r\wr\mathfrak{S}_n$, where the "sign" is taken to be any of the $2r$ $1$-dim characters and the "Mahonian" statistics are the $\mathsf{lmaj}$…

For each integer $d\ge 4$, we study the sequence of positive integers which are represented by one at least of the cyclotomic binary forms $\Phi_n(X,Y)$, with $n$ a positive integer satisfying $\varphi(n)\ge d$. The case $d=2$ was studied…

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

Sylvester showed that the partition of an integer into a set of positive integers can be represented as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. The wave itself is a weighted sum of the…

We study two positional numeration systems which are known for allowing very efficient addition and multiplication of complex numbers. The first one uses the base $\beta = \imath - 1$ and the digit set $\mathcal{D} = \{ 0, \pm 1, \pm \imath…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d \geq 3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. In 2019 Stewart and Xiao proved that…