English
Related papers

Related papers: Positive spectrahedra: Invariance principles and P…

200 papers

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…

Number Theory · Mathematics 2010-01-10 Alina Ostafe

We consider pseudo-involutions in the Riordan group where the generating function $g$ for the first column of a Riordan array satisfies a palindromic or near-palindromic functional equation. For those types of equations, we find, for very…

Combinatorics · Mathematics 2022-03-29 Alexander Burstein , Louis W. Shapiro

In 1989, Zehavi and Itai conjectured that every $k$-connected graph contains $k$ independent spanning trees rooted at any prescribed vertex $r$. That is, for each vertex $v$, the unique $r$-$v$ paths within these $k$ spanning trees are…

Higher-order spectra (or polyspectra), defined as the Fourier Transform of a stationary process' autocumulants, are useful in the analysis of nonlinear and non Gaussian processes. Polyspectral means are weighted averages over Fourier…

Statistics Theory · Mathematics 2024-10-23 Dhrubajyoti Ghosh , Tucker McElroy , Soumendra Lahiri

This paper studies the inverse Steklov spectral problem for curvilinear polygons. For generic curvilinear polygons with angles less than $\pi$, we prove that the asymptotics of Steklov eigenvalues obtained in arXiv:1908.06455 determines, in…

Spectral Theory · Mathematics 2021-02-15 Stanislav Krymski , Michael Levitin , Leonid Parnovski , Iosif Polterovich , David A. Sher

The problem of testing monotonicity for Boolean functions on the hypergrid, $f:[n]^d \to \{0,1\}$ is a classic topic in property testing. When $n=2$, the domain is the hypercube. For the hypercube case, a breakthrough result of…

Data Structures and Algorithms · Computer Science 2022-11-11 Hadley Black , Deeparnab Chakrabarty , C. Seshadhri

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Number Theory · Mathematics 2015-06-26 Francois Rodier

We consider the Klein-Gordon equation in FRW-like spacetimes, with compact space sections (not necessarily isotropic neither homogeneous). The bi-scalar kernel allowing to select the positive-frequency part of any solution is developed on…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Ph. Droz-Vincent

We prove hypergraph variants of the celebrated Alon-Roichman theorem on spectral expansion of sparse random Cayley graphs. One of these variants implies that for every prime $p\geq 3$ and any $\varepsilon > 0$, there exists a set of…

Combinatorics · Mathematics 2016-11-17 Jop Briët , Shravas Rao

We introduce a notion of an algebra of generalized pseudo-differential operators and prove that a spectral triple is regular if and only if it admits an algebra of generalized pseudo-differential operators. We also provide a self-contained…

Operator Algebras · Mathematics 2011-11-11 Otgonbayar Uuye

Airy and Pearcey-like kernels and generalizations arising in random matrix theory are expressed as double integrals of ratios of exponentials, possibly multiplied with a rational function. In this work it is shown that such kernels are…

Mathematical Physics · Physics 2013-06-06 M. Adler , M. Cafasso , P. van Moerbeke

Recently, designs of pseudorandom number generators (PRNGs) using integer-valued variants of logistic maps and their applications to some cryptographic schemes have been studied, due mostly to their ease of implementation and performance.…

Combinatorics · Mathematics 2010-07-06 Koji Nuida

This paper establishes a theory of nonlinear spectral decompositions by considering the eigenvalue problem related to an absolutely one-homogeneous functional in an infinite-dimensional Hilbert space. This approach is both motivated by…

Analysis of PDEs · Mathematics 2021-09-21 Leon Bungert , Martin Burger , Antonin Chambolle , Matteo Novaga

We study the arithmetic complexity of hitting set generators, which are pseudorandom objects used for derandomization of the polynomial identity testing problem. We give new explicit constructions of hitting set generators whose outputs are…

Computational Complexity · Computer Science 2025-08-19 Robert Andrews

Stable and unstable nuclei with neutron excess ($N>Z$) show - in the isovector dipole transition strength distribution - a small hump around the neutron emission threshold energy known as Pygmy Dipole Resonance (PDR). One of its main…

Nuclear Theory · Physics 2022-02-16 Edoardo G. Lanza , Andrea Vitturi

High quality random numbers are necessary in the modern world. Ranging from encryption keys in cyber security to models and simulations for scientific use: it's important that these random numbers are of high quality and quickly attainable.…

Cryptography and Security · Computer Science 2024-05-16 Dmitriy Beznosko , Keith Driscoll , Fernando Guadarrama , Steven Mai , Nikolas Thornton

Sum-frequency generation (SFG) spectroscopy provides a versatile method for the investigation of non-centrosymmetric media and interfaces. Here, using tunable picosecond infrared (IR) pulses from a free-electron laser, the nonlinear optical…

Materials Science · Physics 2023-08-01 Riko Kiessling , Martin Wolf , Alexander Paarmann

We will discuss an extension of the pseudospectral method developed by Wineberg, McGrath, Gabl, and Scott for the numerical integration of the KdV initial value problem. Our generalization of their algorithm can be used to solve initial…

Analysis of PDEs · Mathematics 2014-09-11 Richard S. Palais

We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…

Data Structures and Algorithms · Computer Science 2016-08-16 Josh Alman , Timothy M. Chan , Ryan Williams

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-$d$ polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube and for PTFs over $\R^n$ under the…

Computational Complexity · Computer Science 2009-10-19 Ilias Diakonikolas , Prasad Raghavendra , Rocco A. Servedio , Li-Yang Tan