English
Related papers

Related papers: Positive spectrahedra: Invariance principles and P…

200 papers

Let $X_{1},\ldots,X_{n}$ be i.i.d. sample in $\mathbb{R}^{p}$ with zero mean and the covariance matrix $\mathbf{\Sigma}$. The problem of recovering the projector onto an eigenspace of $\mathbf{\Sigma}$ from these observations naturally…

Statistics Theory · Mathematics 2017-03-03 Alexey Naumov , Vladimir Spokoiny , Vladimir Ulyanov

We consider the classical problem of invariant generation for programs with polynomial assignments and focus on synthesizing invariants that are a conjunction of strict polynomial inequalities. We present a sound and semi-complete method…

Logic in Computer Science · Computer Science 2020-04-07 Krishnendu Chatterjee , Hongfei Fu , Amir Kafshdar Goharshady , Ehsan Kafshdar Goharshady

In Ref.[1] [Phys. Rev. B. {\bf 42}, 2290 (1990)] we used a rigorous projection operator collective variable formalism for nonlinear Klein-Gordon equations to prove the continuum Sine-Gordon (SG) equation has a long lived quasimode whose…

Other Condensed Matter · Physics 2009-11-11 C. R. Willis

The question of which functions acting entrywise preserve positive semidefiniteness has a long history, beginning with the Schur product theorem [Crelle 1911], which implies that absolutely monotonic functions (i.e., power series with…

Classical Analysis and ODEs · Mathematics 2023-09-07 Prateek Kumar Vishwakarma

We show that a black-box construction of a pseudorandom generator from a one-way function needs to make Omega(n/log(n)) calls to the underlying one-way function. The bound even holds if the one-way function is guaranteed to be regular. In…

Cryptography and Security · Computer Science 2012-05-22 Thomas Holenstein , Makrand Sinha

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…

Computational Complexity · Computer Science 2026-04-28 Fan Chang , Joseph Slote , Alexander Volberg , Haonan Zhang

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

The generation of pseudorandom elements over finite fields is fundamental to the time, space and randomness complexity of randomized algorithms and data structures. We consider the problem of generating $k$-independent random values over a…

Data Structures and Algorithms · Computer Science 2014-08-12 Tobias Christiani , Rasmus Pagh

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

This work addresses the Prime Geodesic Theorem for the Picard manifold $\mathcal{M} = \mathrm{PSL}_{2}(\mathbb{Z}[i]) \backslash \mathfrak{h}^{3}$, which asks for the asymptotic evaluation of a counting function for the closed geodesics on…

Number Theory · Mathematics 2024-12-30 Ikuya Kaneko

In many predictive tasks, there are a large number of true predictors with weak signals, leading to substantial uncertainties in prediction outcomes. The polygenic risk score (PRS) is an example of such a scenario, where many genetic…

Methodology · Statistics 2024-12-31 Haoxuan Fu , Jiaoyang Huang , Zirui Fan , Bingxin Zhao

This work explores new classes of nonstationary stochastic sequences associated with polynomial hypergroups. Their covariance structures are analyzed through positive definite kernels and corresponding Hilbert spaces. Novel consistent…

Functional Analysis · Mathematics 2024-11-27 Volker Hösel

We extend the result on the spectral projected gradient method by Birgin et al. in 2000 to a log-determinant semidefinite problem (SDP) with linear constraints and propose a spectral projected gradient method for the dual problem. Our…

Optimization and Control · Mathematics 2018-12-04 Takashi Nakagaki , Mituhiro Fukuda , Sunyoung Kim , Makoto Yamashita

In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the \emph{well distributed occurrences} (WELLDOC)…

Combinatorics · Mathematics 2016-10-25 Lubomira Balkova , Michelangelo Bucci , Alessandro De Luca , Jiri Hladky , Svetlana Puzynina

Goldreich suggested candidates of one-way functions and pseudorandom generators included in $\mathsf{NC}^0$. It is known that randomly generated Goldreich's generator using $(r-1)$-wise independent predicates with $n$ input variables and…

Cryptography and Security · Computer Science 2014-06-03 Ryuhei Mori , Takeshi Koshiba , Osamu Watanabe , Masaki Yamamoto

In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated…

Cryptography and Security · Computer Science 2010-12-22 Christophe Guyeux , Qianxue Wang , Jacques M. Bahi

Stochastic rounding (SR) offers an alternative to the deterministic IEEE-754 floating-point rounding modes. In some applications such as PDEs, ODEs and neural networks, SR empirically improves the numerical behavior and convergence to…

Numerical Analysis · Mathematics 2023-06-06 El-Mehdi El Arar , Devan Sohier , Pablo de Oliveira Castro , Eric Petit

Black hole spectroscopy is a powerful tool to probe the Kerr nature of astrophysical compact objects and their environment. The observation of multiple ringdown modes in gravitational waveforms could soon lead to high-precision…

General Relativity and Quantum Cosmology · Physics 2021-10-27 Kyriakos Destounis , Rodrigo Panosso Macedo , Emanuele Berti , Vitor Cardoso , José Luis Jaramillo

Our main objective in this work is to show how Sobolev orthogonal polynomials emerge as a useful tool within the framework of spectral methods for boundary-value problems. The solution of a boundary-value problem for a stationary…

Numerical Analysis · Mathematics 2026-01-23 Miguel A. Piñar

Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open…

Computational Complexity · Computer Science 2010-02-18 Ilias Diakonikolas , Daniel M. Kane , Jelani Nelson