Related papers: Extension of m-isometric weighted composition oper…
We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…
Fix a metric space $M$ and let $\mathrm{Lip}_0(M)$ be the Banach space of complex-valued Lipschitz functions defined on $M$. A weighted composition operator on $\mathrm{Lip}_0(M)$ is an operator of the kind $wC_f : g \mapsto w \cdot g \circ…
We characterize strong continuity of general operator semigroups on some Lebesgue spaces. In particular, a characterization of strong continuity of weighted composition semigroups on classical Hardy spaces and weighted Bergman spaces with…
Inspired by recent works on $m$-isometric and $n$-symmetric multivariables operators on Hilbert spaces, in this paper we introduce the class of $(m, n)$-isosymmetric multivariables operators. This new class of operators emerges as a…
Let $\phi$ be an analytic self-map and $u$ be a fixed analytic function on the open unit disk $D$ in the complex plane $\CC.$ The weighted composition operator is defined\break by \begin{equation*} uC_\phi f =u \cdot (f\circ \phi), f \in…
A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…
We consider non-selfadjoint operator algebras $\mathfrak{L}(G,\lambda)$ generated by weighted creation operators on the Fock-Hilbert spaces of countable directed graphs $G$. These algebras may be viewed as noncommutative generalizations of…
We discuss resonances for Schr\"odinger operators on metric graphs which consists of a finite compact part and a finite number of halflines attached to it; the vertex coupling is assumed to be of the $\delta$-type or certain modifications…
In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to three special types of vertex-weighted oriented $m$-partite graphs. These formulas are functions of the weight and…
We construct weighted GJMS operators on smooth metric measure spaces, and prove that they are formally self-adjoint. We also provide factorization formulas for them in the case of quasi-Einstein spaces and under Gover--Leitner conditions.
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
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…
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k=m-n.
In the paper we give the results about the spectra of non-invertible weighted composition operators induced by automorphisms on several Hilbert spaces, such as Hardy-Hilbert space $H^2(\mathbb{D})$ and weighted Bergman spaces…
We give explicit descriptions of all path connected components and isolated points of both spaces of composition operators and nonzero weighted composition operators acting from a Fock space $\mathcal{F}^p(\mathbb{C}^n)$ to another one…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily…
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…
We revise the notion of the quasi-sectorial contractions. Our main theorem establishes a relation between semigroups of quasi-sectorial contractions and a class of m-sectorial generators. We discuss a relevance of this kind of contractions…