Related papers: General Divisibility Criteria
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same…
Defined by Borel, a real number is normal to an integer base $b$, greater than or equal to $2$, if in its base-$b$ expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider…
Recently in Reference [ quant-ph/0202121] a computational criterion of separability induced by greatest cross norm is proposed by Rudolph. There, Rudolph conjectured that the new criterion is not weaker than positive partial transpose…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
There is an increasing interest in algorithms to learn invariant correlations across training environments. A big share of the current proposals find theoretical support in the causality literature but, how useful are they in practice? The…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.
A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…
The recently introduced framework of universal inference provides a new approach to constructing hypothesis tests and confidence regions that are valid in finite samples and do not rely on any specific regularity assumptions on the…
Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…
On a metric graph we introduce the notion of a free divisor as a replacement for the notion of a base point free complete linear system on a curve. By means of an example we show that the Clifford inequality is the only obstruction for the…
We establish generalizations of Saito's criterion for the freeness of divisors in projective spaces that apply both to sequences of several homogeneous polynomials and to divisors on other complete varieties. As an application, the new…
In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and…
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
Cluster analysis is a popular unsupervised learning tool used in many disciplines to identify heterogeneous sub-populations within a sample. However, validating cluster analysis results and determining the number of clusters in a data set…
This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily…
In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the…
Let $b$ be a numeration base. A $b$-Niven number is one that is divisible by the sum of its base $b$ digits. We introduce high degree $b$-Niven numbers. These are $b$-Niven numbers that have a power greater than $1$ that is $b$-Niven…