English
Related papers

Related papers: m--isometric composition operators on directed gra…

200 papers

We study topologizability and power boundedness of weigh\-ted composition operators on (certain subspaces of) $\mathscr{D}'(X)$ for an open subset $X$ of $\mathbb{R}^d$. For the former property we derive a characterization in terms of the…

Functional Analysis · Mathematics 2020-10-30 Thomas Kalmes

In this article, we completely determine the isomorphism classes of lattice vertex operator algebras and the vertex operator subalgebras fixed by a lift of the -1-isometry of the lattice. We also provide similar results for certain even…

Quantum Algebra · Mathematics 2011-04-06 Hiroki Shimakura

Suppose $(C_t)_{t\geq0}$ is the composition semigroup induced by a one-parameter semigroup $(\varphi_t)_{t\geq0}$ of analytic self-maps of the unit disk. The main purpose of the paper is to investigate the spectrum of the infinitesimal…

Functional Analysis · Mathematics 2025-03-03 Ruishen Qian , Fanglei Wu , Hasi Wulan

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

Combinatorics · Mathematics 2026-05-13 Vilfred Kamalappan

We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…

Combinatorics · Mathematics 2025-12-19 Anton Izosimov , Pavlo Pylyavskyy

This paper aims to characterize boundedness of composition operators on Besov spaces $B^s_{p,q}$ of higher order derivatives $s>1+1/p$ on the one-dimensional Euclidean space. In contrast to the lower order case $0<s<1$, there were a few…

Functional Analysis · Mathematics 2023-05-04 Masahiro Ikeda , Isao Ishikawa , Koichi Taniguchi

Consider an electrical circuit $G$ each directed edge $e$ of which is a semiconductor with a monomial conductance function $y_e^* = f_e(y_e) = y_e^s / \mu_e^r$ if $y_e \geq 0$ and $y_e^* = 0$ if $y_e \leq 0$. Here $e$ is a directed edge,…

Combinatorics · Mathematics 2020-10-01 Vladimir Gurvich

(Induced) Subgraph Isomorphism and Maximum Common (Induced) Subgraph are fundamental problems in graph pattern matching and similarity computation. In graphs derived from time-series data or protein structures, a natural total ordering of…

Data Structures and Algorithms · Computer Science 2025-07-17 Haruya Imamura , Yasuaki Kobayashi , Yota Otachi , Toshiki Saitoh , Keita Sato , Asahi Takaoka , Ryo Yoshinaka , Tom C. van der Zanden

Using the concept of intrinsic metric on a locally finite weighted graph, we give sufficient conditions for the magnetic Schr\"odinger operator to be essentially self-adjoint. The present paper is an extension of some recent results proven…

Mathematical Physics · Physics 2012-12-07 Francoise Truc , Ognjen Milatovic

We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.

Combinatorics · Mathematics 2015-10-06 Mark Pankov

This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all…

Combinatorics · Mathematics 2018-02-26 L. H. Harper

The aim of the present paper is to introduce the notion of first order (supersymmetric) Dirac operators on discrete and metric (``quantum'') graphs. In order to cover all self-adjoint boundary conditions for the associated metric graph…

Spectral Theory · Mathematics 2007-09-03 Olaf Post

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 this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…

Combinatorics · Mathematics 2024-01-05 Serena An , Holden Mui

In this paper, we first study the definition and the continuity of the complex Hessian operator associated to an $m$-positive closed current $T$, for some classes of unbounded $m$-subharmonic functions as well as when we consider a…

Complex Variables · Mathematics 2021-05-18 Hadhami Elaini , Fredj Elkhadhra

In his seminal paper "Formality conjecture", M. Kontsevich introduced a graph complex $GC_{1ve}$ closely connected with the problem of constructing a formality quasi-isomorphism for Hochschild cochains. In this paper, we express the…

K-Theory and Homology · Mathematics 2017-11-15 Vasily A. Dolgushev , Christopher L. Rogers

Inductive $k$-independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard problem of finding maximum-weight induced $c$-colorable…

Discrete Mathematics · Computer Science 2019-02-26 Matthias Bentert , René van Bevern , Rolf Niedermeier

We study composition operators of characteristic zero on weighted Hilbert spaces of Dirichlet series. For this purpose we demonstrate the existence of weighted mean counting functions associated with the Dirichlet series symbol, and provide…

Functional Analysis · Mathematics 2023-10-20 Athanasios Kouroupis , Karl-Mikael Perfekt

Some results on fixed points related to the contractive compositions of bounded operators in complete metric spaces are discussed through the manuscript. The class of composite operators under study can include, in particular, sequences of…

Functional Analysis · Mathematics 2012-08-30 M. De la Sen

We study the directed maximum common edge subgraph problem (DMCES) for the class of directed graphs that are finite, weakly connected, oriented, and simple. We use DMCES to define a metric on partially ordered sets that can be represented…

Data Structures and Algorithms · Computer Science 2020-12-07 Robert Nerem , Peter Crawford-Kahrl , Bree Cummins , Tomas Gedeon
‹ Prev 1 4 5 6 7 8 10 Next ›