Related papers: MMH* with arbitrary modulus is always almost-unive…
Metropolis-Hastings (MH) is a foundational Markov chain Monte Carlo (MCMC) algorithm. In this paper, we ask whether it is possible to formulate and analyse MH in terms of categorical probability, using a recent involutive framework for…
A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking…
We prove that the Dirichlet $L$-functions associated with Dirichlet characters in $\mathbb{F}_{q}[x]$ are universal. That is, given a modulus of high enough degree, $L$-functions with characters to this modulus can be found that approximate…
We describe two new algorithms for the efficient and rigorous computation of Dirichlet L-functions and their use to verify the Generalised Riemann Hypothesis for all such L-functions associated with primitive characters of modulus…
Deep learning architectures are highly diverse. To prove their universal approximation properties, existing works typically rely on model-specific proofs. Generally, they construct a dedicated mathematical formulation for each architecture…
Fast nearest neighbor searching is becoming an increasingly important tool in solving many large-scale problems. Recently a number of approaches to learning data-dependent hash functions have been developed. In this work, we propose a…
Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…
We develop a scalable algorithm to learn binary hash codes for indexing large-scale datasets. Near-isometric binary hashing (NIBH) is a data-dependent hashing scheme that quantizes the output of a learned low-dimensional embedding to obtain…
CMB observations provide a precise measurement of the primordial power spectrum on large scales, corresponding to wavenumbers $10^{-3}$ Mpc$^{-1}$ < k < 0.1 Mpc$^{-1}$, [1-8]. Luminous red galaxies and galaxy clusters probe the matter power…
We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\in M_N(\mathbb R)$ having the property that $U=H/\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N). Our study includes a…
Motivated by the study of (m,n)-quasitilted algebras, which are the piecewise hereditary algebras obtained from quasitilted algebras of global dimension two by a sequence of (co)tiltings involving n-1 tilting modules and m-1 cotilting…
Minwise hashing (MinHash) is a standard algorithm widely used in the industry, for large-scale search and learning applications with the binary (0/1) Jaccard similarity. One common use of MinHash is for processing massive n-gram text…
Mutually Unbiased Bases (MUBs) constitute a fundamental geometric structure in quantum theory, known for providing an optimal measurement scheme for quantum state tomography. In prime and prime-power dimensions, analytical constructions of…
This work will appear as a chapter in a forthcoming volume titled `Topics in Probabilistic Graph Theory'. For a given graph $G$, each partition of the vertices has a modularity score, with higher values indicating that the partition better…
Given a quasi-hereditary superalgebra $A$, the first author and R. Muth have defined generalized Schur bi-superalgebras $T^A(n)$ and proved that these algebras are again quasi-hereditary. In particular, $T^A(n)$ comes with a family of…
A graph is said to be $\mathcal{H}(n, \Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. Using a `matching-based' embedding technique introduced by Alon and F\"uredi, Dellamonica, Kohayakawa,…
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…
For an integer $q\ge 2$, a perfect $q$-hash code $C$ is a block code over $[q]:=\{1,\ldots,q\}$ of length $n$ in which every subset $\{\mathbf{c}_1,\mathbf{c}_2,\dots,\mathbf{c}_q\}$ of $q$ elements is separated, i.e., there exists…
For a given graph $G$, each partition of the vertices has a modularity score, with higher values indicating that the partition better captures community structure in $G$. The modularity $q^*(G)$ of the graph $G$ is defined to be the maximum…
Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…