English
Related papers

Related papers: The spectrum of the Grigoriev-Laurent pseudomoment…

200 papers

We introduce a new method for building higher-degree sum-of-squares lower bounds over the hypercube $\mathbf{x} \in \{\pm 1\}^N$ from a given degree 2 lower bound. Our method constructs pseudoexpectations that are positive semidefinite by…

Data Structures and Algorithms · Computer Science 2020-09-16 Dmitriy Kunisky

We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…

Data Structures and Algorithms · Computer Science 2016-02-11 Adam Kurpisz , Samuli Leppänen , Monaldo Mastrolilli

Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as…

Quantum Physics · Physics 2009-11-07 Zafar Ahmed , Sudhir R. Jain

In this paper, we develop machinery which makes it much easier to prove sum of squares lower bounds when the problem is symmetric under permutations of $[1,n]$ and the unsatisfiability of our problem comes from integrality arguments, i.e.…

Computational Complexity · Computer Science 2018-12-17 Aaron Potechin

Let $G$ be a connected semisimple real algebraic group and $\Gamma<G$ be its Zariski dense discrete subgroup. We prove that if $\Gamma\backslash G$ admits any finite Bowen-Margulis-Sullivan measure, then $\Gamma$ is virtually a product of…

Dynamical Systems · Mathematics 2025-04-30 Mikolaj Fraczyk , Minju Lee

In a previous work we apply lattice point theorems on hyperbolic spaces obtaining asymptotic formulas for the number of integral representations of negative integers by quadratic and hermitian forms of signature (n,1) lying in Euclidean…

Number Theory · Mathematics 2015-12-24 Emilio A. Lauret

We consider compact locally symmetric spaces $\Gamma\backslash G/H$ where $G/H$ is a non-compact semisimple symmetric space and $\Gamma$ is a discrete subgroup of $G$. We discuss some features of the joint spectrum of the (commutative)…

Representation Theory · Mathematics 2021-04-13 Salah Mehdi , Martin Olbrich

Let $G$ be either the Grigorchuk $2$-group or one of the Gupta-Sidki $p$-groups. We give new upper bounds for the diameters of the quotients of $G$ by its level stabilisers, as well as other natural sequences of finite-index normal…

Group Theory · Mathematics 2017-03-20 Henry Bradford

Bogomolny-Leyvraz-Schmit (1996) and Peter (2002) proposed an asymptotic formula for the correlation of the multiplicities in length spectrum on the modular surface, and Lukianov (2007) extended its asymptotic formula to the Riemann surfaces…

Number Theory · Mathematics 2015-02-10 Yasufumi Hashimoto

A cocompact lattice in a semisimple Lie group $G$ is a discrete subgroup $\Gamma$ such that the quotient $G/\Gamma$ is compact. Does such a lattice always contain a surface group, i.e. a subgroup isomorphic to the fundamental group of a…

Group Theory · Mathematics 2022-12-09 Fanny Kassel

Given a large data matrix $A\in\mathbb{R}^{n\times n}$, we consider the problem of determining whether its entries are i.i.d. with some known marginal distribution $A_{ij}\sim P_0$, or instead $A$ contains a principal submatrix $A_{{\sf…

Computational Complexity · Computer Science 2015-02-24 Yash Deshpande , Andrea Montanari

This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…

Numerical Analysis · Mathematics 2024-05-14 Foivos Alimisis , Yousef Saad , Bart Vandereycken

GMRES is a popular Krylov subspace method for solving linear systems of equations involving a general non-Hermitian coefficient matrix. The conventional bounds on GMRES convergence involve polynomial approximation problems in the complex…

Numerical Analysis · Mathematics 2022-09-07 Mark Embree

We study the minimal unitary representations of non-compact groups and supergroups obtained by quantization of their geometric realizations as quasi-conformal groups and supergroups. The quasi-conformal groups G leave generalized…

High Energy Physics - Theory · Physics 2011-02-09 Murat Gunaydin , Oleksandr Pavlyk

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

Probability · Mathematics 2020-05-19 Jess Banks , Jorge Garza Vargas , Archit Kulkarni , Nikhil Srivastava

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

Computational Complexity · Computer Science 2021-11-18 Chris Jones , Aaron Potechin , Goutham Rajendran , Madhur Tulsiani , Jeff Xu

Let $E/F$ be a CM extension of number fields, and let $H < G$ be a unitary Gan--Gross--Prasad pair defined with respect to $E/F$ that is compact at infinity. We consider a family $\mathcal{F}$ of automorphic representations of $G \times H$…

Number Theory · Mathematics 2023-09-29 Simon Marshall

This paper is concerned with the Lyapunov spectrum for measurable cocycles over an ergodic pmp system taking values in semi-simple real Lie groups. We prove simplicity of the Lyapunov spectrum and its continuity under certain perturbations…

Dynamical Systems · Mathematics 2025-04-15 Uri Bader , Alex Furman

We consider one-dimensional difference Schroedinger equations on the discrete line with a potential generated by evaluating a real-analytic potential function V(x) on the one-dimensional torus along an orbit of the shift x-->x+nw. If the…

Dynamical Systems · Mathematics 2008-04-09 Michael Goldstein , Wilhelm Schlag

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein
‹ Prev 1 2 3 10 Next ›