English
Related papers

Related papers: Completion problem for extension of m- isometric w…

200 papers

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Spectral Theory · Mathematics 2019-04-25 Marwa Balti

We show that the problem k-Dominating Set and its several variants including k-Connected Dominating Set, k-Independent Dominating Set, and k-Dominating Clique, when parameterized by the solution size k, are W[1]-hard in either…

Computational Complexity · Computer Science 2015-03-19 Minghui Jiang , Yong Zhang

We establish necessary and sufficient conditions for the boundedness and compactness of weighted composition operators acting on weighted Dirichlet spaces and determine the spectrum of a certain class of such operators. Our results extend…

Functional Analysis · Mathematics 2026-02-10 Anirban Sen

We study a semigroup of weighted composition operators on the Hardy space of the disk $H^2(\mathbb{D})$, and more generally on the Hardy space $H^2(U)$ attached to a simply connected domain $U$ with smooth boundary. Motivated by conformal…

Functional Analysis · Mathematics 2018-12-05 Mihai Putinar , James E. Tener

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

Computational Complexity · Computer Science 2012-10-22 Leonid Malinin , Natalia Malinina

The question of self-adjoint realizations of sign-indefinite second order differential operators is discussed in terms of a model problem. Operators of the type $-\frac{d}{dx} \sgn (x) \frac{d}{dx}$ are generalized to finite, not…

Mathematical Physics · Physics 2021-03-29 Amru Hussein

In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…

Data Structures and Algorithms · Computer Science 2023-11-15 Maria Chudnovsky , Marcin Pilipczuk , Michał Pilipczuk , Stéphan Thomassé

In this paper we characterize $m$-isometric and quasi-$m$-isometric weighted conditional type (WCT) operators on the Hilbert space $L^2(\mu)$. Also, we prove that the subclasses of $m$-isometric and quasi-$m$-isometric of normal WCT…

Functional Analysis · Mathematics 2025-09-30 Y. Estaremi , M. S. Al Ghafri , S. Shamsigamchi

We study the weighted composition operators between the Lipschitz space and the space of bounded functions on the set of vertices of an infinite tree. We characterized the boundedness, the compactness, and the boundedness from below of…

Functional Analysis · Mathematics 2019-02-28 Takuya Hosokawa

We study composition operators on the weighted Banach spaces of an infinite tree. We characterize the bounded and the compact operators, as well as determine the operator norm and the essential norm. In addition, we study the isometric…

Functional Analysis · Mathematics 2022-07-26 Robert F. Allen , Matthew A. Pons

We obtain a necessary and sufficient condition for a weighted composition operator to be co-isometric on a general weighted Hardy space of analytic functions in the unit disk whose reproducing kernel has the usual natural form. This turns…

Complex Variables · Mathematics 2021-07-14 María J. Martín , Alejandro Mas , Dragan Vukotić

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

Data Structures and Algorithms · Computer Science 2016-03-08 Anatoly D. Plotnikov

In this note, we study the expander decomposition problem in a more general setting where the input graph has positively weighted edges and nonnegative demands on its vertices. We show how to extend the techniques of Chuzhoy et al. (FOCS…

Data Structures and Algorithms · Computer Science 2021-06-04 Jason Li , Thatchaphol Saranurak

In this note unbounded hyperexpansive weighted composition operators are investigated. AS a consequence unbounded hyperexpansive multiplication and composition operators are characterized.

Functional Analysis · Mathematics 2014-02-21 Yousef Estaremi

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

Combinatorics · Mathematics 2025-07-30 Alexander Grigoriev , Katherine Faulkner

We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…

Mathematical Physics · Physics 2020-02-07 Pavel Exner

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

Data Structures and Algorithms · Computer Science 2022-08-22 Khí-Uí Soo , Bakhadyr Khoussainov , Simone Linz

The aim of this work is to study the Airy and Schr\"odinger operators on looping-edge graphs, a class of metric graphs consisting of a circle and a finite number $N$ of infinite half-lines attached to a common vertex. For the Airy operator,…

Analysis of PDEs · Mathematics 2026-04-14 Jaime Angulo Pava , Alexander Muñoz

This paper studies the behaviour of iterates of weighted composition operators acting on spaces of analytic functions, with particular emphasis on the Hardy space $H^2$. Questions relating to uniform, strong and weak convergence are…

Functional Analysis · Mathematics 2020-02-11 I. Chalendar , J. R. Partington

The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire…

Discrete Mathematics · Computer Science 2014-08-26 Pavel Klavík , Jan Kratochvíl , Yota Otachi , Ignaz Rutter , Toshiki Saitoh , Maria Saumell , Tomáš Vyskočil