Related papers: Succinct Representations of Permutations and Funct…

We study the problem of differentially private (DP) mechanisms for representing sets of size $k$ from a large universe. Our first construction creates $(\epsilon,\delta)$-DP representations with error probability of $1/(e^\epsilon + 1)$…

Let X = S \oplus G, where S is a countable abelian semigroup and G is a countably infinite abelian group such that {2g : g in G} is infinite. Let pi: X \to G be the projection map defined by pi(s,g) = g for all x =(s,g) in X. Let f:X \to…

We consider methods for finding high-precision approximations to simple zeros of smooth functions. As an application, we give fast methods for evaluating the elementary functions log(x), exp(x), sin(x) etc. to high precision. For example,…

An algorithm is presented for approximating arbitrary powers of a black box unitary operation, $\mathcal{U}^t$, where $t$ is a real number, and $\mathcal{U}$ is a black box implementing an unknown unitary. The complexity of this algorithm…

Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic…

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…

We study a class of functional problems reducible to computing $f^{(n)}(x)$ for inputs $n$ and $x$, where $f$ is a polynomial-time bijection. As we prove, the definition is robust against variations in the type of reduction used in its…

The conformal transformations with respect to the metric defining $o(n,\mbb{C})$ give rise to a nonhomogeneous polynomial representation of $o(n+2,\mbb{C})$. Using Shen's technique of mixed product, we generalize the above representation to…

We give a uniform realization of the minimal representation of a double cover of the conformal group SO(2,n+1)_0 in the kernel of the wave operator on flat Minkowski space as a positive energy representation H^+ for n even and odd. Using…

L. Babai has shown that a faithful permutation representation of a nonsplit extension of a group by an alternating group $A_k$ must have degree at least $k^2(\frac{1}{2}-o(1))$, and has asked how sharp this lower bound is. We prove that…

This preliminary report addresses the expressive power of unit resolution regarding input data encoded with partial truth assignments of propositional variables. A characterization of the functions that are computable in this way, which we…

In order to generate prime implicants for a given cube (minterm), most of minimization methods increase the dimension of this cube by removing one literal from it at a time. But there are two problems of exponential complexity. One of them…

Let $P^+(n)$ denote the largest prime of the integer $n$. Using the \begin{align*}\Psi\_{F\_1\cdots F\_t}\left(\mathcal{K}\cap[-N,N]^d,N^{1/u}\right):=\\#\left\{\mathcal{K}\in…

This paper describes our experience developing polynomial approximations for trigonometric functions that produce correctly rounded results for multiple representations and rounding modes using the RLIBM approach. A key challenge with…

Because of the importance of unitarity in quantum physics, work on the representations of the de Sitter group has focussed on the unitary case, which necessarily means infinite dimensional matrices for this non-compact group. Here we…

In order to reconstruct the initial conditions of the universe it is important to devise a method that can efficiently constrain the shape of the power spectrum of primordial matter density fluctuations in a model-independent way from data.…

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Given a subgroup H of a finite group G, we begin a systematic study of the partial representations of G that restrict to global representations of H. After adapting several results from [DEP00] (which correspond to the case where H is…

Semidefinite relaxations are a powerful tool for approximately solving combinatorial optimization problems such as MAX-CUT and the Grothendieck problem. By exploiting a bounded rank property of extreme points in the semidefinite cone, we…

Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…