Related papers: General Divisibility Criteria

We give a relatively short proof of one of the central cases of the main theorem from the paper "The distribution of integers with a divisor in a given interval", math.NT/0401223. Namely, we determine the order of magnitude of the number of…

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

The denominator of the Hilbert series of a finitely generated R-module M does not always divide the denominator of the Hilbert series of R. For this reason, we define the universal denominator. The universal denominator of a module M is the…

Criteria are presented for testing whether every trajectory of a dynamic integer system converges to the same fixed point

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…

Generalized Cullen Numbers are positive integers of the form $C_b(n):=nb^n+1$. In this work we generalize some known divisibility properties of Cullen Numbers and present two primality tests for this family of integers. The first test is…

We propose a criterion of equidistribution by the differentiability of certain arithmetic invariants. Combined with the slope method and the asymptotic measures, this criterion gives a new "conceptual" proof to equidistribution results…

We present a general scheme that allows for construction of scalar separability criteria from positive but not completely positive maps. The concept is based on a decomposition of every positive map $\Lambda$ into a difference of two…

A notable result from analysis of Boolean functions is the Basic Invariance Principle (BIP), a quantitative nonlinear generalization of the Central Limit Theorem for multilinear polynomials. We present a generalization of the BIP for…

The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

A conceptually simpler proof of the separability criterion for two-qubit systems, which is referred to as "Hefei inequality" in literature, is presented. This inequality gives a necessary and sufficient separability criterion for any mixed…

A general and computable criterion for k-(in)separability in continuous multipartite quantum systems is presented. The criterion can be experimentally implemented with a finite and comparatively low number of local observables. We discuss…

Let H(x,y,z) be the number of integers $\le x$ with a divisor in (y,z] and let H_1(x,y,z) be the number of integers $\le x$ with exactly one such divisor. When y and z are close, it is expected that H_1(x,y,z) H(x,y,z), that is, an integer…

Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits with respect to underlying parameters. Here, we propose the rules for differentiating…

A divisibility relation on ultrafilters on the set $\mathbb{N}$ of natural numbers is defined as follows: ${\cal F}\hspace{1mm}\widetilde{\mid}\hspace{1mm}{\cal G}$ if and only if every set in $\cal F$ upward closed for divisibility also…

The pentagonal number theorem is extended to the sequence of the number of integer partitions with all parts equal. The new pentagonal number theorem implies that the distribution of the primes is just a specific detail of the application…

We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…