Related papers: A Pseudorandom Generator for Polynomial Threshold …
In the planted bisection model a random graph $G(n,p_+,p_- )$ with $n$ vertices is created by partitioning the vertices randomly into two classes of equal size (up to $\pm1$). Any two vertices that belong to the same class are linked by an…
For Lie algebras whose Poisson semi-center is a polynomial ring we give a bound for the sum of the degrees of the generating semi-invariants. This bound was previously known in many special cases.
In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the…
We study the use of Gaussian process emulators to approximate the parameter-to-observation map or the negative log-likelihood in Bayesian inverse problems. We prove error bounds on the Hellinger distance between the true posterior…
We study the Gaussian statistical models whose log-likelihood function has a unique complex critical point, i.e., has maximum likelihood degree one. We exploit the connection developed by Am\'endola et. al. between the models having maximum…
Including O(m_c) terms in the coefficient functions and/or O(m_D) twist 3 contributions in the heavy meson distribution amplitudes leads to a non-zero transverse amplitude for exclusive neutrino production of a D pseudoscalar charmed meson…
We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…
In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…
We study subfield-subcodes of Generalized Toric (GT) codes over $\mathbb{F}_{p^s}$. These are the multidimensional analogues of BCH codes, which may be seen as subfield-subcodes of generalized Reed-Solomon codes. We identify polynomial…
The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…
We propose a mechanism for reaching pseudorandom quantum states, computationally indistinguishable from Haar random, with shallow log-n depth quantum circuits, where n is the number of qudits. We argue that $\log n$ depth 2-qubit-gate-based…
Anderson generating functions are generating series for division values of points on Drinfeld modules, and they serve as important tools for capturing periods, quasi-periods, and logarithms. They have been fundamental in recent work on…
Let $g: \{-1,1\}^k \to \{-1,1\}$ be any Boolean function and $q_1,\dots,q_k$ be any degree-2 polynomials over $\{-1,1\}^n.$ We give a \emph{deterministic} algorithm which, given as input explicit descriptions of $g,q_1,\dots,q_k$ and an…
A new class of distributions, called Generalized One Parameter Polynomial Exponential-G family of distributions is proposed for modelling lifetime data. An account of the structural and reliability properties of the new class is presented.…
In this paper we present, using the arithmetic of elliptic curves over finite fields, an algorithm for the efficient generation of a sequence of uniform pseudorandom vectors in high dimensions, that simulates a sample of a sequence of…
We introduce a class of finite dimensional nonlinear superalgebras $L = L_{\bar{0}} + L_{\bar{1}}$ providing gradings of $L_{\bar{0}} = gl(n) \simeq sl(n) + gl(1)$. Odd generators close by anticommutation on polynomials (of degree $>1$) in…
We show that there is a randomized algorithm that, when given a small constant-depth Boolean circuit $C$ made up of gates that compute constant-degree Polynomial Threshold functions or PTFs (i.e., Boolean functions that compute signs of…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
There are various notions of quantum pseudorandomness, such as pseudorandom unitaries (PRUs), pseudorandom state generators (PRSGs) and pseudorandom function-like state generators (PRFSGs). Unlike classical pseudorandomness, where different…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…