Related papers: Dominant sets for model spaces in several variable…
The boundedness and compactness of weighted composition operators on the Hardy space ${\mathcal H}^2$ of the unit disc is analysed. Particular reference is made to the case when the self-map of the disc is an inner function. Schatten-class…
We give a geometric description for the dominant characteristic of a nilpotent orbit in an arbitrary finite-dimensional rational G-module. In particular, we obtain a generalization of a recent result of Gunnells-Sommers, see…
We revisit the problem of determining the independent domination number in hypercubes for which the known upper bound is still not tight for general dimensions. We present here a constructive method to build an independent dominating set…
We decompose the Hilbert space of wave functions into two subspaces, and assign to a given observable two effective representatives that act in the model space. The first serves to determine some of the eigenvalues of the full observable,…
The {\em independent domination number} $\gamma^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $\gamma^i$ is equal…
Inner functions play a central role in function theory and operator theory on the Hardy space over the unit disk. Motivated by recent works of C. B\'en\'eteau et al. and of D. Seco, we discuss inner functions on more general weighted Hardy…
This paper is concerned with polynomially generated multiplier invariant subspaces of the weighted Bergman space $A_{\boldsymbol{\beta}}^2$ in infinitely many variables. We completely classify these invariant subspaces under the unitary…
Many problems in additive number theory, such as Fermat's last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set $A \subset \mathbb{Z}$ is considered sum-dominant if…
With a simple generic approach, we develop a classification that encodes and measures the strength of completeness (or compactness) properties in various types of spaces and ordered structures. The approach also allows us to encode notions…
Functions in Hardy spaces on multiply-connected domains in the plane are given an explicit characterization in terms of a boundary condition inspired by the two-dimensional Ising model. The key underlying property is the positivity of a…
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the…
Let $G=(V,E)$ be a graph. A set $S\subseteq V(G)$ is a dominating set, if every vertex in $V(G)\backslash S$ is adjacent to at least one vertex in $S$. The $k$-dominating graph of $G$, $D_k (G)$, is defined to be the graph whose vertices…
Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…
We initiate a systematic study of intrinsic dimensional versions of classical functional inequalities which capture refined properties of the underlying objects. We focus on model spaces: Euclidean space, Hamming cube, and manifolds of…
We characterize the space of multipliers from the Hardy space of Dirichlet series $\mathcal H_p$ into $\mathcal H_q$ for every $1 \leq p,q \leq \infty$. For a fixed Dirichlet series, we also investigate some structural properties of its…
Let $L$ be a one-to-one operator of type $\omega$ in $L^2(\mathbb{R}^n)$, with $\omega\in[0,\,\pi/2)$, which has a bounded holomorphic functional calculus and satisfies the Davies-Gaffney estimates. Let $p(\cdot):\ \mathbb{R}^n\to(0,\,1]$…
A dominating set in a graph is a set of vertices with the property that every vertex in the graph is either in the set or adjacent to something in the set. The domination sequence of the graph is the sequence whose $k$th term is the number…
This paper deals with the maximum value of the difference between the determining number and the metric dimension of a graph as a function of its order. Our technique requires to use locating-dominating sets, and perform an independent…
We prove that the pointwise product of two holomorphic functions of the upper half-plane, one in the Hardy space $\mathcal H^1$, the other one in its dual, belongs to a Hardy type space. Conversely, every holomorphic function in this space…
A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…