English
Related papers

Related papers: Estimates for spectral density functions of matric…

200 papers

We prove an analogue of Sadullaev's theorem concerning the size of the set where a maximal totally real manifold can meet a pluripolar set. The manifold has to be of class C-1 only. This readily leads to a version of Shcherbina's theorem…

Complex Variables · Mathematics 2008-10-28 Armen Edigarian , Jan Wiegerinck

The scattering matrix of the Schrodinger operator with smooth short-range electric and magnetic potentials is considered. The asymptotic density of the eigenvalues of this scattering matrix in the high energy regime is determined. An…

Spectral Theory · Mathematics 2012-08-22 Daniel Bulger , Alexander Pushnitski

For a broad class of unitary ensembles of random matrices we demonstrate the universal nature of the Janossy densities of eigenvalues near the spectral edge, providing a different formulation of the probability distributions of the limiting…

Probability · Mathematics 2008-04-08 Brian Rider , Xin Zhou

By considering the general properties of approximate units in differentiable algebras, we are able to present a unified approach to characterising completeness of spectral metric spaces, existence of connections on modules, and the lifting…

Operator Algebras · Mathematics 2016-10-24 Bram Mesland , Adam Rennie

The spectral densities of ensembles of non-Hermitian sparse random matrices are analysed using the cavity method. We present a set of equations from which the spectral density of a given ensemble can be efficiently and exactly calculated.…

Disordered Systems and Neural Networks · Physics 2009-11-13 Tim Rogers , Isaac Perez Castillo

We study the moduli space of the spectral curves $y^2=W'(z)^2+f(z)$ which characterize the vacua of $\mathcal{N}=1$ U(n) supersymmetric gauge theories with an adjoint Higgs field and a polynomial tree level potential $W(z)$. It is shown…

Mathematical Physics · Physics 2015-06-12 Boris Konopelchenko , Luis Martínez Alonso , Elena Medina

The paper is devoted to the properties of a complex matrix ``twisted,'' otherwise called ``spectral,'' cocycle, associated with substitution dynamical systems. Following a recent finding of Rajabzadeh and Safaee [arXiv:2501.16824] of an…

Dynamical Systems · Mathematics 2025-08-21 Boris Solomyak

We prove limit equalities between the sharp constants in weighted Nikolskii-type inequalities for multivariate polynomials on an $m$-dimensional cube and ball and the corresponding constants for entire functions of exponential type.

Classical Analysis and ODEs · Mathematics 2022-12-26 Michael I. Ganzburg

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

We formulate a general sufficiency criterion for discreteness of the spectrum of both supersymmmetric and non-su-persymmetric theories with a fermionic contribution. This criterion allows an analysis of Hamiltonians in complete form rather…

High Energy Physics - Theory · Physics 2012-10-26 Lyonell Boulton , Maria Pilar Garcia del Moral , Alvaro Restuccia

We develop a scattering theory for CMV matrices, similar to the Faddeev--Marchenko theory. A necessary and sufficient condition is obtained for the uniqueness of the solution of the inverse scattering problem. We also obtain two sufficient…

Spectral Theory · Mathematics 2010-08-20 L. Golinskii , A. Kheifets , F. Peherstorfer , P. Yuditskii

Contains a further development of the V.G. Maz'ya concept of polynomial capacities.A different different approach is given together with new results. The primary application is for Hardy inequalities. This is treated in a later report. Here…

Analysis of PDEs · Mathematics 2007-05-23 Andreas Wannebo

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study…

Classical Analysis and ODEs · Mathematics 2016-06-27 Z. Ditzian , A. Prymak

Thiran and Detaille give an explicit formula for the asymptotics of the sup-norm of the Chebyshev polynomials on a circular arc. We give the so-called $\textrm{Szeg\H o}$-Widom asymptotics for this domain, i.e., explicit expressions for the…

Classical Analysis and ODEs · Mathematics 2016-07-26 Benjamin Eichinger

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

Number Theory · Mathematics 2016-09-07 Igor Rivin

Using a semiclassical approach we show that the spectrum of a smooth Anosov vector field V on a compact manifold is discrete (in suitable anisotropic Sobolev spaces) and then we provide an upper bound for the density of eigenvalues of the…

Mathematical Physics · Physics 2015-05-18 Frédéric Faure , Johannes Sjoestrand

We consider hilbert spaces of holomorphic functions in Cartan domains (in particular in ball and polydisk) and operator of restriction of holomorphic function to a submanifold in Shilov boundary. We discuss conditions when this operator…

funct-an · Mathematics 2013-01-15 Yurii A. Neretin

The Novikov-Shubin numbers are defined for open manifolds with bounded geometry, the Gamma-trace of Atiyah being replaced by a semicontinuous semifinite trace on the C*-algebra of almost local operators. It is proved that they are invariant…

Differential Geometry · Mathematics 2007-05-23 Daniele Guido , Tommaso Isola

We define a graph to be $S$-regular if it contains an equitable partition given by a matrix $S$. These graphs are generalizations of both regular and bipartite, biregular graphs. An $S$-regular matrix is defined then as a matrix on an…

Combinatorics · Mathematics 2023-11-15 Matthew B. Crawford , David J. Marchette , William Maxwell , Samuel S. Mendelson

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

Rings and Algebras · Mathematics 2018-09-19 Gyula Károlyi , Csaba Szabó