Results 31 to 40 of about 32,295 (236)
Discreteness of the spectrum of the compactified D=11 supermembrane with non-trivial winding [PDF]
, 2002 We analyze the Hamiltonian of the compactified D=11 supermembrane with non-trivial central charge in terms of the matrix model constructed recently by some of the authors.
A. Restuccia +20 more
core +2 more sources
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
From open quantum systems to open quantum maps [PDF]
, 2010 For a class of quantized open chaotic systems satisfying a natural dynamical assumption, we show that the study of the resolvent, and hence of scattering and resonances, can be reduced to the study of a family of open quantum maps, that is of finite ...
Nonnenmacher, Stéphane +2 more
core +8 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 Let us denote by $ ( , )$ the statement that $\mathbb{B}( ) = D( )^ $, i.e. the Baire space of weight $ $, has a coloring with $ $ colors such that every homeomorphic copy of the Cantor set $\mathbb{C}$ in $\mathbb{B}( )$ picks up all the $ $ colors. We call a space $X\,$ {\em $ $-regular} if it is Hausdorff and for every non-empty open set $
Juhász, István +2 more
openaire +3 more sources
Properties of Fuzzy Resolving Set
Turkish Journal of Computer and Mathematics Education (TURCOMAT), 2021 In a fuzzy graph , for a subset of , the representation of with respect to in terms of strength of connectedness of vertices are distinct then is called the fuzzy resolving set of . In this article, we discuss the properties of fuzzy resolving set and fuzzy resolving number.
openaire +2 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
Compositions and Averages of Two Resolvents: Relative Geometry of Fixed Points Sets and a Partial Answer to a Question by C. Byrne [PDF]
, 2010 We show that the set of fixed points of the average of two resolvents can be found from the set of fixed points for compositions of two resolvents associated with scaled monotone operators.
Bauschke, Heinz H., Wang, Xianfu
core +1 more source
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.
Chitra, P. Jeya Bala, Arumugam, S.
openaire +1 more source