Related papers: Integer Addition and Hamming Weight
We show that the normalized supercharacters of principal admissible modules over the affine Lie superalgebra $\hat{s\ell}_{2|1}$ (resp. $\hat{ps\ell}_{2|2}$) can be modified, using Zwegers' real analytic corrections, to form a modular…
To each pair consisting of a saturated fusion system over a $p$-group together with a compatible family of K\"ulshammer-Puig cohomology classes, one can count weights in a hypothetical block algebra arising from these data. When the pair…
The investigation of primes in certain arithmetic sequences is one of the fundamental problems in number theory and especially, finding blocks of distinct primes has gained a lot of attention in recent years. In this context, we prove the…
Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
In Weighted Model Counting (WMC) we assign weights to Boolean literals and we want to compute the sum of the weights of the models of a Boolean function where the weight of a model is the product of the weights of its literals. WMC was…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper we elaborate on the implication of these parameters and we devise a method to estimate…
In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…
Let $A$ and $B$ be unital rings. An additive map $T:A\to B$ is called a weighted Jordan homomorphism if $c=T(1)$ is an invertible central element and $cT(x^2) = T(x)^2$ for all $x\in A$. We provide assumptions, which are in particular…
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in…
The investigation of partitions of integers plays an important role in combinatorics and number theory. Among the many variations, partitions into powers $0<\alpha<1$ were of recent interest. In the present paper we want to extend our…
Loops of inflationary gravitons are known to induce large temporal and spatial logarithms which can cause perturbation theory to break down. Nonlinear sigma models possess the same kind of derivative interactions and induce the same sorts…
We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…
This work is an attempt to classify and quantify instances when a weighted sum of two squares of positive integers, $3n_{1}^2+n_{2}^2$, can be realized in more than one way. Our project was inspired by a particular study of two-dimensional…
Even though weight multiplicity formulas, such as Kostant's formula, exist their computational use is extremely cumbersome. In fact, even in cases when the multiplicity is well understood, the number of terms considered in Kostant's formula…
The additive monoid $R_+(x)$ is defined as the set of all nonnegative integer linear combinations of binomial coefficients $\binom{x}{n}$ for $n \in \mathbb Z_+$. This paper is concerned with the inquiry into the structure of $R_+(\alpha)$…
Quantum modular adders are one of the most fundamental yet versatile quantum computation operations. They help implement functions of higher complexity, such as subtraction and multiplication, which are used in applications such as quantum…