Related papers: Integer Addition and Hamming Weight
In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…
We study the complexity of estimating the partition function $\mathsf{Z}(\beta)=\sum_{x\in\chi} e^{-\beta H(x)}$ for a Gibbs distribution characterized by the Hamiltonian $H(x)$. We provide a simple and natural lower bound for quantum…
We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce…
In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting…
The weight decision problem, which requires to determine the Hamming weight of a given binary string, is a natural and important problem, with applications in cryptanalysis, coding theory, fault-tolerant circuit design and so on. In…
Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the…
We study combinatorial blocks of multipartitions, exploring further the notions of weight, hub and core block introduced by the author in earlier papers. We answer the question of which pairs (w,theta) occur as the weight and hub of a…
Entrywise powers of matrices have been well-studied in the literature, and have recently received renewed attention in the regularization of high-dimensional correlation matrices. In this paper, we study powers of positive semidefinite…
We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…
In quantum computation, optimizing depth and number of ancillary qubits in quantum circuits is crucial due to constraints imposed by current quantum devices. This paper presents an innovative approach to implementing arbitrary symmetric…
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…
We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…
We consider strictly increasing sequences $\left(a_{n}\right)_{n \geq 1}$ of integers and sequences of fractional parts $\left(\left\{a_{n} \alpha\right\}\right)_{n \geq 1}$ where $\alpha \in \mathbb{R}$. We show that a small additive…
In a gravitational theory with a massless photon the maximum charge-to-mass ratio of black holes approaches the prediction of the Einstein-Maxwell theory as black hole mass increases: $Q_{\rm ext}/M =1+ \alpha/M^2$ for some constant…
The number-theoretic codes are a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a…
For a class of arithmetic subgroups $\Gamma$ in SU(d,1) we prove that for every positive integer $n$ there exists a subgroup $\Gamma_n$ of finite index in $\Gamma$, which lifts to the $n$-fold connected cover of of SU(d,1). Consequently…
In this paper we analyse the role of some of the building blocks in SHA-256. We show that the disturbance correction strategy is applicable to the SHA-256 architecture and we prove that functions $\Sigma$, $\sigma$ are vital for the…