Theta activity reflects a state of rhythmic modulation of excitability at the level of single neuron membranes, within local neuronal groups and between distant nodes of a neuronal network. A wealth of evidence has shown that during theta states distant neuronal groups synchronize, forming networks of spatially confined neuronal clusters at specific time periods during task performance. Here, w...

Grone and Merris [5] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. In this paper, we prove that this conjecture holds for a class of graphs including trees. We also show that this conjecture and its generalization to graphs with Dirichlet boundary conditions are equivalent.

for any lacunary sequence $theta = (k_{r})$, we define the concepts of $s_{theta}-$limit point and $s_{theta}-$cluster point of a sequence of fuzzy numbers $x = (x_{k})$. we introduce the new sets  $lambda^{f}_{s_{theta}}(x)$, $gamma^{f}_{s_{theta}}(x)$ and prove some inclusion relaions between these and the sets $lambda^{f}_{s}(x)$, $gamma^{f}_{s}(x)$ introduced in ~cite{ayt:slpsfn} by aytar [...

let a and b be n × m matrices. the matrix b is said to be g-row majorized (respectively g-column majorized) by a, if every row (respectively column) of b, is g-majorized by the corresponding row (respectively column) of a. in this paper all kinds of g-majorization are studied on mn,m, and the possible structure of their linear preservers will be found. also all linear operators t : mn,m ---> mn...

Answering a question raised by S. Friedland, we show that the possible eigenvalues of Hermitian matrices (or compact operators) A, B, and C with C ≤ A+B are given by the same inequalities as in Klyachko’s theorem for the case where C = A + B, except that the equality corresponding to tr(C) = tr(A) + tr(B) is replaced by the inequality corresponding to tr(C) ≤ tr(A) + tr(B). The possible types o...

We introduce the concept of weak k-majorization extending the classical notion of weak sub-majorization. For integers k and n with k n a vector x 2 R is weakly k-majorized by a vector q 2 R if the sum of the r largest components of x does not exceed the sum of the r largest components of q, for r = 1; : : : ; k. For a given q the set of vectors weakly k-majorized by q de nes a polyhedron P (q;k...

In spectral graph theory, the Grone-Merris Conjecture asserts that the spectrum of the Laplacian matrix of a finite graph is majorized by the conjugate degree sequence of this graph. We give a complete proof for this conjecture. The Laplacian of a simple graph G with n vertices is a positive semi-definite n×n matrix L(G) that mimics the geometric Laplacian of a Riemannian manifold; see §1 for d...

Abstract In this paper, we present a majorized semismooth Newton-CG augmented Lagrangian method, called SDPNAL+, for semidefinite programming (SDP) with partial or full nonnegative constraints on the matrix variable. SDPNAL+ is a much enhanced version of SDPNAL introduced by Zhao et al. (SIAM J Optim 20:1737–1765, 2010) for solving generic SDPs. SDPNAL works very efficiently for nondegenerate S...

This papers presents new maximal element type results for general majorized maps, and as an application, we consider equilibria some one-person games.