相关论文: MMH* with arbitrary modulus is always almost-unive…

In the problem of minimal perfect hashing, we are given a size $k$ subset $\mathcal{A}$ of a universe of keys $[n] = \{1,2, \cdots, n\}$, for which we wish to construct a hash function $h: [n] \to [k]$ such that $h(\cdot)$ maps…

The set of points where an entire function achieves its maximum modulus is known as the maximum modulus set. In 1951, Hayman studied the structure of this set near the origin. Following work of Blumenthal, he showed that, near zero, the…

The height $H(n)$ of $n$ is the least integer $i$ such that the $i$-th iterate of Euler's totient function $\varphi^{(i)}(n)$ equals $1$. H. N. Shapiro showed that this $H$ is almost completely additive. Building on the fact that this…

We improve recently published results about resources of Restricted Boltzmann Machines (RBM) and Deep Belief Networks (DBN) required to make them Universal Approximators. We show that any distribution p on the set of binary vectors of…

Let $H$ be a semisimple Hopf algebras over an algebraically closed field $k$ of characteristic $0.$ We define Hopf algebraic analogues of commutators and their generalizations and show how they are related to $H',$ the Hopf algebraic…

It has been proposed that primordial black holes (PBHs) form binaries in the radiation dominated era. Once formed, some fraction of them may merge within the age of the Universe by gravitational radiation reaction. We investigate the merger…

Particle Marginal Metropolis-Hastings (PMMH) is a general approach to Bayesian inference when the likelihood is intractable, but can be estimated unbiasedly. Our article develops an efficient PMMH method that scales up better to higher…

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

We propose a testable universality hypothesis, asserting that seemingly disparate neural network solutions observed in the simple task of modular addition are unified under a common abstract algorithm. While prior work interpreted…

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Minwise hashing (Minhash) is a widely popular indexing scheme in practice. Minhash is designed for estimating set resemblance and is known to be suboptimal in many applications where the desired measure is set overlap (i.e., inner product…

Perfect hash functions can potentially be used to compress data in connection with a variety of data management tasks. Though there has been considerable work on how to construct good perfect hash functions, there is a gap between theory…

Numbers (positive integers) are the most fundamental creatures of the human mind and the foundation to the scientific understanding of nature. Some mathematicians have suspected a link between prime numbers and secrets of creation.…

Memory-hard functions (MHF) are functions whose evaluation cost is dominated by memory cost. MHFs are egalitarian, in the sense that evaluating them on dedicated hardware (like FPGAs or ASICs) is not much cheaper than on off-the-shelf…

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

This paper builds upon J. Nilsson's classification of rank one $\mathcal{U}(\mathfrak{h})$-free modules by extending the analysis to modules without rank restrictions, focusing on the category $\mathfrak{A}$ of…

In a recent paper from SODA11 \cite{kminwise} the authors introduced a general framework for exponential time improvement of \minwise based algorithms by defining and constructing almost \kmin independent family of hash functions. Here we…

Let $H$ be a finite-dimensional Hopf algebra over an algebraically closed field of characteristic 0. If $H$ is not semisimple and $\dim(H)=2n$ for some odd integer $n$, then $H$ or $H^*$ is not unimodular. Using this result, we prove that…