Results 21 to 30 of about 870 (267)
Wronskians, dualities and FZZT-Cardy branes
Nuclear Physics B, 2016 The resolvent operator plays a central role in matrix models. For instance, with utilizing the loop equation, all of the perturbative amplitudes including correlators, the free-energy and those of instanton corrections can be obtained from the spectral ...
Chuan-Tsung Chan +3 more
doaj +1 more source
Graph convergence with an application for system of variational inclusions and fixed-point problems
Journal of Inequalities and Applications, 2022 This paper aims at proposing an iterative algorithm for finding an element in the intersection of the solutions set of a system of variational inclusions and the fixed-points set of a total uniformly L-Lipschitzian mapping. Applying the concepts of graph
Javad Balooee, Jen-Chih Yao
doaj +1 more source
Kyoto Journal of Mathematics, 1986 We want to add here another two proofs that the resolvent set of a linear operator is open. The first proof depends on the Hahn-Banach theorem and the second on the Neumann series construction of a linear isomorphism between Ran(A-\(\lambda)\) and Ran(A-\(\mu)\).
Ikebe, Teruo, Yoshioka, Takashi
openaire +3 more sources
Eigenvalue problem for differential Cauchy-Riemann operator with nonlocal boundary conditions
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2014 We consider the reduced spectral problem for the Cauchy-Riemann operator with nonlocal boundary conditions to Fredholm linear integral equation of the second kind with a continuous kernel. The corresponding Fredholm determinant is defined for all spectral
Nurlan N Imanbaev
doaj +1 more source
Resolving sets for Johnson and Kneser graphs
European Journal of Combinatorics, 2013 A set of vertices $S$ in a graph $G$ is a {\em resolving set} for $G$ if, for any two vertices $u,v$, there exists $x\in S$ such that the distances $d(u,x) \neq d(v,x)$. In this paper, we consider the Johnson graphs $J(n,k)$ and Kneser graphs $K(n,k)$, and obtain various constructions of resolving sets for these graphs. As well as general constructions,
Robert F. Bailey +6 more
openaire +4 more sources
Spectrum of a family of operators [PDF]
Surveys in Mathematics and its Applications, 2011 Having as start point the classic definitions of resolvent set and spectrum of a linear bounded operator on a Banach space, we introduce the resolvent set and spectrum of a family of linear bounded operators on a Banach space.
Simona Macovei
doaj
Resolving Sets without Isolated Vertices
Procedia Computer Science, 2015 AbstractLet G be a connected graph. Let W = (w1, w2, ..., wk ) be a subset of V with an order imposed on it. For any v ∈ V, the vector r(v|W) = (d(v, w1), d(v, w2), ..., d(v, wk )) is called the metric representation of v with respect to W. If distinct vertices in V have distinct metric representations, then W is called a resolving set of G.
P. Jeya Bala Chitra, S. Arumugam 0001
openaire +1 more source
A Minimum Doubly Resolving Set and Strong Resolving Set for the Crystal Cubic Carbon
, 2022 Personal reasons, Professor Jia Bao Liu asked us not to mention his name in the article and to thank him only in the acknowledgments ...
Zafari, Ali, Alikhani, Saeid
openaire +2 more sources
Minimum weight resolving sets of grid graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2016 For a simple graph [Formula: see text] and for a pair of vertices [Formula: see text], we say that a vertex [Formula: see text] resolves [Formula: see text] and [Formula: see text] if the shortest path from [Formula: see text] to [Formula: see text] is of a different length than the shortest path from [Formula: see text] to [Formula: see text].
Andersen, Patrick +2 more
openaire +2 more sources
Coloring Cantor sets and resolvability of pseudocompact spaces [PDF]
Commentationes Mathematicae Universitatis Carolinae, 2019 8 ...
Juhász, István +2 more
openaire +3 more sources