English
Related papers

Related papers: A Short Proof for Gap Independence of Simultaneous…

200 papers

We consider the probability of having two intervals (gaps) without eigenvalues in the bulk scaling limit of the Gaussian Unitary Ensemble of random matrices. We describe uniform asymptotics for the transition between a single large gap and…

Functional Analysis · Mathematics 2020-03-19 Benjamin Fahs , Igor Krasovsky

In connection with Rokhlin's question on an automorphism with a homogeneous nonsimple spectrum, we indicate a class of measure-preserving maps $T$ such that $T\times T$ has a homogeneous spectrum of multiplicity 2. The automorphisms in…

Dynamical Systems · Mathematics 2012-06-28 V. V. Ryzhikov

The problem of parallel thread mapping is studied for the case of discrete orthogonal $m$-simplices. The possibility of a $O(1)$ time recursive block-space map $\lambda: \mathbb{Z}^m \mapsto \mathbb{Z}^m$ is analyzed from the point of view…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-10-25 Cristóbal A. Navarro , Benjamín Bustos , Nancy Hitscheld

We show that unitary representations of simply connected, semisimple algebraic groups over local fields of characteristic zero obey a spectral gap absorption principle: that is, that spectral gap is preserved under tensor products. We do…

Group Theory · Mathematics 2025-04-11 Yuval Gorfine

We present a number of second order maps, which pass the singularity confinement test commonly used to identify integrable discrete systems, but which nevertheless are non-integrable. As a more sensitive integrability test, we propose the…

solv-int · Physics 2009-10-30 Jarmo Hietarinta , Claude Viallet

We consider the following fundamental problems: (1) Constructing $k$-independent hash functions with a space-time tradeoff close to Siegel's lower bound. (2) Constructing representations of unbalanced expander graphs having small size and…

Data Structures and Algorithms · Computer Science 2015-06-12 Tobias Christiani , Rasmus Pagh , Mikkel Thorup

This work deals with two groups of spectral analysis results for matrices arising in fully implicit Runge-Kutta methods used for linear time-dependent partial differential equations. These were applied for different formulations of the same…

Numerical Analysis · Mathematics 2025-10-27 Michal Outrata

An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…

Computational Physics · Physics 2023-04-19 Johan Lundgren , Kurt Schab , Miloslav Capek , Mats Gustafsson , Lukas Jelinek

A recent trend in parameterized algorithms is the application of polytope tools (specifically, LP-branching) to FPT algorithms (e.g., Cygan et al., 2011; Narayanaswamy et al., 2012). However, although interesting results have been achieved,…

Data Structures and Algorithms · Computer Science 2014-06-12 Yoichi Iwata , Magnus Wahlström , Yuichi Yoshida

We provide a simplified proof of the existence, under some assumptions, of a spectral gap for the Perron-Frobenius operator of piecewise uniformly expanding maps on Riemannian manifolds when acting on some Sobolev spaces. Its consequences…

Dynamical Systems · Mathematics 2010-06-15 Damien Thomine

A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…

Computational Complexity · Computer Science 2017-03-28 Lucy Ham

Accurate evaluation of nearly singular integrals plays an important role in many boundary integral equation based numerical methods. In this paper, we propose a variant of singularity swapping method to accurately evaluate the layer…

Numerical Analysis · Mathematics 2023-05-11 Gang Bao , Wenmao Hua , Jun Lai , Jinrui Zhang

The two-to-two four-dimensional scattering amplitude of identical scalars obeys rigorous two-sided non-perturbative bounds derived via the modern numerical S-matrix bootstrap. These bounds carve out an allowed region with a rich boundary…

High Energy Physics - Theory · Physics 2026-05-08 Joan Elias Miro , Andrea Guerrieri , Mehmet Asim Gumus

In this note, we investigate iterations of consistency, local and uniform reflection over $\mathbf{HA}$ (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem…

Logic · Mathematics 2026-03-11 Emanuele Frittaion

We give a proof, using harmonic maps from disks to real trees, of Skora's theorem (Morgan-Otal (1993), Skora (1990), originally conjectured by Shalen): if G is the fundamental group of a surface of genus at least 2, then any small minimal…

Differential Geometry · Mathematics 2007-05-23 Benson Farb , Michael Wolf

The independent set problem, ISP for short, asks for the maximal number of vertices in a (large) graph which can be occupied such that none of them are neighbors. We address the question from a statistical mechanics perspective, in the case…

Combinatorics · Mathematics 2015-12-17 Nicola Kistler , Marius A. Schmidt

We consider the problem of independence testing for two univariate random variables in a sequential setting. By leveraging recent developments on safe, anytime-valid inference, we propose a test with time-uniform type I error control and…

Methodology · Statistics 2024-01-29 Alexander Henzi , Michael Law

Given $\lambda\in(0, 1)$, let $E_\lambda$ be the self-similar set generated by the iterated function system $\{x/3,(x+\lambda)/3,(x+2)/3\}$. Then $E_\lambda$ is a self-similar set with overlaps. We obtain the necessary and sufficient…

Dynamical Systems · Mathematics 2018-10-22 Karma Dajani , Derong Kong , Yuanyuan Yao

In this paper, we establish some general forms of the law of the iterated logarithm for independent random variables in a sub-linear expectation space, where the random variables are not necessarily identically distributed. Exponential…

Probability · Mathematics 2021-12-30 Li-Xin Zhang

The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…

Machine Learning · Computer Science 2023-12-19 Elad Hazan , Adam Tauman Kalai , Varun Kanade , Clara Mohri , Y. Jennifer Sun
‹ Prev 1 8 9 10 Next ›