Related papers: General Divisibility Criteria
The article is about a "desingularization principle" common to various canonical desingularization algorithms in characteristic zero, and the roles played by the exceptional divisors in the underlying local construction. We compare…
We show that all density operators of 2$\times N$--dimensional quantum systems that remain invariant after partial transposition with respect to the first system are separable. Based on this criterion, we derive a sufficient separability…
In these notes, we comment on the standard indistinguishability criterion often used in the gravitational wave community to set accuracy requirements on waveforms. Revisiting the hypotheses under which it is derived, we propose a correction…
The paper first covers several properties of the extension of the divisibility relation to a set ${}^*\hspace{-0.5mm}N$ of nonstandard integers. After that, a connection is established with the divisibility in the Stone-\v{C}ech…
We give a short proof of the cross norm characterization of separability due to O. Rudolph and show how its computation, for a fixed chosen error, can be reduced to a linear programming problem whose dimension grows polynomially with the…
We provide two simple universality criteria. Our first criterion states that $\mathcal{S}\subset G_d:=U(d)$ is universal if and only if $\mathcal{S}$ forms a $\delta$-approximate $t(d)$-design, where $t(2)=6$ and $t(d)=4$ for $d\geq3$. Our…
The necessary and sufficient conditions for a function to be totally or partially separable are derived. It is shown that a function is totally separable if and only if each component of the gradient vector of depends only on the…
While studying a characteristic number of manifolds we noticed that the calculation was simply computing a multiple of a multinomial coefficient. We were, at the time, interested in computing the greatest common divisor of these…
The problem of optimally discriminating between two completely unknown qubit states is generalized by allowing an error margin. It is visualized as a device---the programmable discriminator---with one data and two program ports, each fed…
A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…
The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…
The integer division of a numerator n by a divisor d gives a quotient q and a remainder r. Optimizing compilers accelerate software by replacing the division of n by d with the division of c * n (or c * n + c) by m for convenient integers c…
Proposed is a new formal approach for solution of extreme multi-criteria problems transforming them into single-criterion mathematical models, without any additional information. Transforming rules are based on comparison standards and…
The closure and the partitioning principles have been used to build various multiple testing procedures in the past three decades. The essence of these two principles is based on parameter space partitioning. In this article, we propose a…
Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs)…
We present a method to derive separability criteria for the different classes of multiparticle entanglement, especially genuine multiparticle entanglement. The resulting criteria are necessary and sufficient for certain families of states.…
The known families of difference sets can be subdivided into three classes: difference sets with Singer parameters, cyclotomic difference sets, and difference sets with gcd$(v,n)>1$. It is remarkable that all the known difference sets with…
We present several methods to construct or identify families of free divisors such as those annihilated by many Euler vector fields, including binomial free divisors, or divisors with triangular discriminant matrix. We show how to create…
I survey recent progress on a classic and challenging problem in social choice: the fair division of indivisible items. I discuss how a computational perspective has provided interesting insights into and understanding of how to divide…
We consider the problem of universal decoding for arbitrary unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average…