Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
The extremal spectral radii of $k$-uniform supertrees  [PDF]
Honghai Li,Jiayu Shao,Liqun Qi
Mathematics , 2014,
Abstract: In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $k$-uniform hypergraph a supertree. We introduce the operation of "moving edges" for hypergraphs, together with the two special cases of this operation: the edge-releasing operation and the total grafting operation. By studying the perturbation of these kinds of spectral radii of hypergraphs under these operations, we prove that for all these three kinds of spectral radii, the hyperstar $\mathcal{S}_{n,k}$ attains uniquely the maximum spectral radius among all $k$-uniform supertrees on $n$ vertices. We also determine the unique $k$-uniform supertree on $n$ vertices with the second largest spectral radius (for these three kinds of spectral radii). We also prove that for all these three kinds of spectral radii, the loose path $\mathcal{P}_{n,k}$ attains uniquely the minimum spectral radius among all $k$-th power hypertrees of $n$ vertices. Some bounds on the incidence $Q$-spectral radius are given. The relation between the incidence $Q$-spectral radius and the spectral radius of the matrix product of the incidence matrix and its transpose is discussed.
Maximizing spectral radii of uniform hypergraphs with few edges  [PDF]
Yi-Zheng Fan,Ying-Ying Tan,Xi-Xi Peng,An-Hong Liu
Mathematics , 2015,
Abstract: In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.
On the spectral radii of bicyclic graphs with fixed independence number  [PDF]
Xiying Yuan
Mathematics , 2014,
Abstract: Bicyclic graph is a connected graph in which the number of edges equals the number of vertices plus one. In this paper, we determine the graph which alone maximizes the spectral radii among all the bicyclic graphs on $n$ vertices with fixed independence number.
Spectral Radii of Bounded Operators on Topological Vector Spaces  [PDF]
Vladimir G. Troitsky
Mathematics , 2000,
Abstract: In this paper we develop a version of spectral theory for bounded linear operators on topological vector spaces. We show that the Gelfand formula for spectral radius and Neumann series can still be naturally interpreted for operators on topological vector spaces. Of course, the resulting theory has many similarities to the conventional spectral theory of bounded operators on Banach spaces, though there are several important differences. The main difference is that an operator on a topological vector space has several spectra and several spectral radii, which fit a well-organized pattern.
Mather sets for sequences of matrices and applications to the study of joint spectral radii  [PDF]
Ian D. Morris
Mathematics , 2011, DOI: 10.1112/plms/pds080
Abstract: The joint spectral radius of a compact set of d-times-d matrices is defined ?to be the maximum possible exponential growth rate of products of matrices drawn from that set. In this article we investigate the ergodic-theoretic structure of those sequences of matrices drawn from a given set whose products grow at the maximum possible rate. This leads to a notion of Mather set for matrix sequences which is analogous to the Mather set in Lagrangian dynamics. We prove a structure theorem establishing the general properties of these Mather sets and describing the extent to which they characterise matrix sequences of maximum growth. We give applications of this theorem to the study of joint spectral radii and to the stability theory of discrete linear inclusions. These results rest on some general theorems on the structure of orbits of maximum growth for subadditive observations of dynamical systems, including an extension of the semi-uniform subadditive ergodic theorem of Schreiber, Sturman and Stark, and an extension of a noted lemma of Y. Peres. These theorems are presented in the appendix.
Some Spectral Properties and Characterizations of Connected Odd-bipartite Uniform Hypergraphs  [PDF]
Jia-Yu Shao,Hai-Ying Shan,Bao-feng Wu
Mathematics , 2014,
Abstract: A $k$-uniform hypergraph $G=(V,E)$ is called odd-bipartite ([5]), if $k$ is even and there exists some proper subset $V_1$ of $V$ such that each edge of $G$ contains odd number of vertices in $V_1$. Odd-bipartite hypergraphs are generalizations of the ordinary bipartite graphs. We study the spectral properties of the connected odd-bipartite hypergraphs. We prove that the Laplacian H-spectrum and signless Laplacian H-spectrum of a connected $k$-uniform hypergraph $G$ are equal if and only if $k$ is even and $G$ is odd-bipartite. We further give several spectral characterizations of the connected odd-bipartite hypergraphs. We also give a characterization for a connected $k$-uniform hypergraph whose Laplacian spectral radius and signless Laplacian spectral radius are equal, thus provide an answer to a question raised in [9]. By showing that the Cartesian product $G\Box H$ of two odd-bipartite $k$-uniform hypergraphs is still odd-bipartite, we determine that the Laplacian spectral radius of $G\Box H$ is the sum of the Laplacian spectral radii of $G$ and $H$, when $G$ and $H$ are both connected odd-bipartite.
Counting Spectral Radii of Matrices with Positive Entries  [PDF]
J. A. Dias da Silva,Pedro J. Freitas
Mathematics , 2013,
Abstract: The sum-product conjecture of Erd\H os and Szemer\'edi states that, given a finite set $A$ of positive numbers, one can find asymptotic lower bounds for $\max\{|A+A|,|A\cdot A|\}$ of the order of $|A|^{1+\delta}$ for every $\delta <1$. In this paper we consider the set of all spectral radii of $n\times n$ matrices with entries in $A$, and find lower bounds for the cardinality of this set. In the case $n=2$, this cardinality is necessarily larger than $\max\{|A+A|,|A\cdot A|\}$.
Laplacian and signless Laplacian spectral radii of graphs with fixed domination number  [PDF]
Rundan Xing,Bo Zhou
Mathematics , 2013,
Abstract: In this paper, we determine the maximal Laplacian and signless Laplacian spectral radii for graphs with fixed number of vertices and domination number, and characterize the extremal graphs respectively.
Lower bounds for the spectral radii of adjacency operators on Baumslag-Solitar groups  [PDF]
Ken Dykema,Daniel Redelmeier
Mathematics , 2010,
Abstract: We will use free probability techniques to find lower bounds for the spectral radii of the adjacency operators on the Caley graphs of some non-amenable Baumslag-Solitar groups with the standard generators.
An algorithm computing non solvable spectral radii of $p$-adic differential equations  [PDF]
Andrea Pulita
Mathematics , 2013,
Abstract: We obtain an algorithm computing explicitly the values of the non solvable spectral radii of convergence of the solutions of a differential module over a point of type 2, 3 or 4 of the Berkovich affine line.
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.