On the Geometric Means of an Entire Function Represented by Dirichlet Series.
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
Preconditioners and Korovkin-type theorems for infinite-dimensional bounded linear operators via completely positive maps
The classical as well as noncommutative Korovkin-type theorems deal with the convergence of positive linear maps with respect to different modes of convergence, like norm or weak operator convergence etc. In this article, new versions of Korovkin-type theorems are proved using the notions of convergence induced by strong, weak and uniform eigenvalue clustering of matrix sequences with growing order. Such modes of convergence were originally considered for the special case of Toeplitz matrices and...
Structure of the set of all minimal total dominating functions of some classes of graphs
In this paper we study some of the structural properties of the set of all minimal total dominating functions () of cycles and paths and introduce the idea of function reducible graphs and function separable graphs. It is proved that a function reducible graph is a function separable graph. We shall also see how the idea of function reducibility is used to study the structure of for some classes of graphs.
A Note on a Discrete Version of Borg's Theorem via Toeplitz-Laurent Operators with Matrix-Valued Symbols
Consider a one dimensional Schrödinger operator with a periodic potential , defined on a suitable subspace of . Its spectrum is the union of closed intervals, and in general these intervals are separated by open intervals (spectral gaps). The Borg theorem states that we have no gaps if and only if the periodic potential is constant almost everywhere. In this paper we consider families of Finite Difference approximations of the operator , which depend upon two parameters , i.e., the number...
Page 1