Related papers: General Divisibility Criteria
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…
All the already known results on self descriptive numbers, together with the demonstration of the uniqueness for bases greater than 6, are here obtained through a systematic scheme of proof and not trial and error. The proof is also…
We give separability criteria for general multi-qubit states in terms of diagonal and anti-diagonal entries. We define two numbers which are obtained from diagonal and anti-diagonal entries, respectively, and compare them to get criteria.…
Each linear code can be described by a code ideal given as the sum of a toric ideal and a non-prime ideal. In this way, several concepts from the theory of toric ideals can be translated into the setting of code ideals. It will be shown…
The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and…
The separability problem is one of the basic and emergent problems in the present and future quantum information processing. The latter focuses on information and computing based on quantum mechanics and uses quantum bits as its basic…
The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…
We propose a sufficient and necessary separability criterion for pure states in multipartite and high dimensional systems. Its main advantage is operational and computable. The obvious expressions of this criterion can be given out by the…
We investigate the average order of the divisor function at values of totally reducible binary cubic forms and discuss some applications.
In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…
This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…
Using a recently introduced framework, we derive criteria for quantum k-separability, which are very easily computed. In the case k = 2, our criteria are equally strong to the best methods known so far, while in all other cases there are…
The divisibility of truncated binomial series by their exponent n is analyzed. Divisibility is shown to depends on the divisibility characteristics of the integers constituting the binomials. Series division by the highest possible powers…
High dimensional data can have a surprising property: pairs of data points may be easily separated from each other, or even from arbitrary subsets, with high probability using just simple linear classifiers. However, this is more of a rule…
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable…
We establish two strong senses of universality of logarithmic loss as a distortion criterion in lossy compression: For any fixed length lossy compression problem under an arbitrary distortion criterion, we show that there is an equivalent…
We provide a necessary and sufficient condition for separability of Gaussian states of bipartite systems of arbitrarily many modes. The condition provides an operational criterion since it can be checked by simple computation. Moreover, it…
A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…
Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…
We give a criterion for a real divisor to be rational and semiample.