Results 11 to 20 of about 4,831,190 (292)
Criterion for the resolvent set of nonsymmetric tridiagonal operators [PDF]
Proceedings of the American Mathematical Society, 1995 We study nonsymmetric tridiagonal operators acting in the Hilbert space ℓ 2 {\ell ^2} and describe the spectrum and the resolvent set of such operators in terms of a continued fraction related to the ...
V. Kaliaguine +2 more
core +3 more sources
New Perturbed Proximal Point Algorithms for Set-valued Quasi Variational Inclusions [PDF]
, 2004 In this paper, by using some new and innovative techniques, some perturbed iterative algorithms for solving generalized set-valued variational inclusions are suggested and analyzed.
Li, Rong, Shi, Chaofeng
core +6 more sources
Independent resolving sets in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence of independent resolving sets in Cartesian product and corona of graphs.
B. Suganya, S. Arumugam 0001
openaire +3 more sources
Trace formulae and singular values of resolvent power differences of self-adjoint elliptic operators [PDF]
, 2013 In this note self-adjoint realizations of second order elliptic differential expressions with non-local Robin boundary conditions on a domain Ω⊂Rn with smooth compact boundary are studied. A Schatten--von Neumann type estimate for the singular values of
Lotoreichik, Vladimir +2 more
core +4 more sources
Resolving SINR Queries in a Dynamic Setting [PDF]
SIAM Journal on Computing, 2020 We consider a set of transmitters broadcasting simultaneously on the same frequency under the SINR model. Transmission power may vary from one transmitter to another, and a transmitter's signal strength at a given point is modeled by the transmitter's power divided by some constant power $α$ of the distance it traveled.
Boris Aronov +2 more
openaire +8 more sources
Resolving Sets and Semi-Resolving Sets in Finite Projective Planes [PDF]
The Electronic Journal of Combinatorics, 2012 In a graph $\Gamma=(V,E)$ a vertex $v$ is resolved by a vertex-set $S=\{v_1,\ldots,v_n\}$ if its (ordered) distance list with respect to $S$, $(d(v,v_1),\ldots,d(v,v_n))$, is unique. A set $A\subset V$ is resolved by $S$ if all its elements are resolved by $S$. $S$ is a resolving set in $\Gamma$ if it resolves $V$.
Héger, Tamás, Takáts, Marcella
openaire +5 more sources
A Predictor-Corrector Methods for Mixed Inverse Variational Inequalities [PDF]
, 2009 In this paper, a class of mixed inverse variational inequalities is introduced and studied. We prove the existence of the solution of the auxiliary problem for mixed inverse variational inequalities, suggest a predictor-corrector method for solving the ...
Shi, Chaofeng
core +6 more sources
Secure Resolving Sets in a Graph [PDF]
Symmetry, 2018 Let G = (V, E) be a simple, finite, and connected graph. A subset S = {u1, u2, …, uk} of V(G) is called a resolving set (locating set) if for any x ∈ V(G), the code of x with respect to S that is denoted by CS (x), which is defined as CS (x) = (d(u1, x), d(u2, x), .., d(uk, x)), is different for different x.
Hemalathaa Subramanian +1 more
openaire +1 more source
Certain Varieties of Resolving Sets of A Graph [PDF]
Journal of the Indonesian Mathematical Society, 2021 Let G=(V,E) be a simple connected graph. For each ordered subset S={s_1,s_2,...,s_k} of V and a vertex u in V, we associate a vector Gamma(u/S)=(d(u,s_1),d(u,s_2),...,d(u,s_k)) with respect to S, where d(u,v) denote the distance between u and v in G. A subset S is said to be resolving set of G if Gamma(u/S) not equal to Gamma(v/S) for all u, v in V-S ...
Sooryanarayana, Badekara +2 more
openaire +1 more source
Semiclassical resolvent estimates at trapped sets [PDF]
Annales de l'Institut Fourier, 2012 We extend our recent results on propagation of semiclassical resolvent estimates through trapped sets when a priori polynomial resolvent bounds hold. Previously we obtained non-trapping estimates in trapping situations when the resolvent was sandwiched between cutoffs χ
Datchev, Kiril, Vasy, András
openaire +2 more sources