Results 41 to 50 of about 613,974 (314)
The Topological Entropy Conjecture
Mathematics, 2021 For a compact Hausdorff space X, let J be the ordered set associated with the set of all finite open covers of X such that there exists nJ, where nJ is the dimension of X associated with ∂. Therefore, we have Hˇp(X;Z), where 0≤p≤n=nJ.
Lvlin Luo
doaj +1 more source
New Multicritical Random Matrix Ensembles [PDF]
, 2002 In this paper we construct a class of random matrix ensembles labelled by a real parameter $\alpha \in (0,1)$, whose eigenvalue density near zero behaves like $|x|^\alpha$.
Akemann +22 more
core +2 more sources
International Mathematics Research Notices, 2002 We estimate the eigenvalues of connection Laplacians in terms of the non-triviality of the holonomy.
Gilles Carron +2 more
openaire +3 more sources
A New Family of Chaotic Systems with Different Closed Curve Equilibrium
Mathematics, 2019 Chaotic systems with hidden attractors, infinite number of equilibrium points and different closed curve equilibrium have received much attention in the past six years.
Xinhe Zhu, Wei-Shih Du
doaj +1 more source
The fine structure of spectral properties for random correlation matrices: an application to financial markets [PDF]
, 2011 We study some properties of eigenvalue spectra of financial correlation matrices. In particular, we investigate the nature of the large eigenvalue bulks which are observed empirically, and which have often been regarded as a consequence of the supposedly
Alfarano, S., Livan, G., Scalas, E.
core +5 more sources
Numerical construction of structured matrices with given eigenvalues
Special Matrices, 2019 We consider a structured inverse eigenvalue problem in which the eigenvalues of a real symmetric matrix are specified and selected entries may be constrained to take specific numerical values or to be nonzero.
Sutton Brian D.
doaj +1 more source
A Shift Selection Strategy for Parallel Shift-invert Spectrum Slicing in Symmetric Self-consistent Eigenvalue Computation [PDF]
, 2020 © 2020 ACM. The central importance of large-scale eigenvalue problems in scientific computation necessitates the development of massively parallel algorithms for their solution.
Beckman, PG, Williams-Young, DB, Yang, C
core +1 more source
Eigenvalues and the diameter of graphs [PDF]
Linear and Multilinear Algebra, 1995 Using eigenvalue interlacing and Chebyshev polynomials we find upper bounds for the diameter of regular and bipartite biregular graphs in terms of their eigenvalues. This improves results of Chung and Delorme and Sole. The same method gives upper bounds for the number of vertices at a given minimum distance from a given vertex set.
van Dam, E.R., Haemers, W.H.
openaire +8 more sources
On Trees as Star Complements in Regular Graphs
Discussiones Mathematicae Graph Theory, 2020 Let G be a connected r-regular graph (r ---gt--- 3) of order n with a tree of order t as a star complement for an eigenvalue µ ∉ {−1, 0}. It is shown that n ≤ 1/2 (r + 1)t − 2. Equality holds when G is the complement of the Clebsch graph (with µ = 1, r =
Rowlinson Peter
doaj +1 more source
On Eigenvalue spacings for the 1-D Anderson model with singular site distribution
, 2013 We study eigenvalue spacings and local eigenvalue statistics for 1D lattice Schrodinger operators with Holder regular potential, obtaining a version of Minami's inequality and Poisson statistics for the local eigenvalue spacings.
C. Shubin +4 more
core +1 more source