Related papers: Dominant sets for model spaces in several variable…

We introduce connections between the Cuntz relations and the Hardy space H_2 of the open unit disk . We then use them to solve a new kind of multipoint interpolation problem in H_2, where for instance, only a linear combination of the…

In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…

We study composition operators on the Hardy space $\mathcal{H}^2$ of Dirichlet series with square summable coefficients. Our main result is a necessary condition, in terms of a Nevanlinna-type counting function, for a certain class of…

We study Hardy spaces for Fourier--Bessel expansions associated with Bessel operators on $((0,1), x^{2\nu+1}\, dx)$ and $((0,1), dx)$. We define Hardy spaces $H^1$ as the sets of $L^1$-functions for which their maximal functions for the…

This paper is devoted to introduce and investigate the notion of monotone sets in Hadamard spaces. First, flat Hadamard spaces are introduced and investigated. It is shown that an Hadamard space $X$ is flat if and only if $X\times…

In this paper, we study numerical invariants associated with a homogeneous submodule of the Hardy module over the bidisk. We focus on the submodule generated by the polynomial $(z-w)^2$ and obtain explicit formulas for the corresponding…

Let $G=(V(G),E(G))$ be a simple graph. A set $D\subseteq V(G)$ is a strong dominating set of $G$, if for every vertex $x\in V(G)\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

Orthogonal sets of idempotents are used to design sets of unitary matrices, known as constellations, such that the modulus of the determinant of the difference of any two distinct elements is greater than $0$. It is shown that unitary…

This paper deals with representing in concrete fashion those Hilbert spaces that are vector subspaces of the Hardy spaces $H^p(\bb D^n) \ (1\le p\le \infty)$ that remain invariant under the action of coordinate wise multiplication by an…

A Bernstein-type inequality in the standard Hardy space H^{2} of the unit disc \mathbb{D}=\{z\in\mathbb{C}:\,|z|<1\}, for rational functions in \mathbb{D} having at most n poles all outside of \frac{1}{r}\mathbb{D}, 0

Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…

WE determine the existence of exact (efficient) doubly dominating sets in three famous structures and in their complement for arbitrary graphs.

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

The Hardy space H^2(R) for the upper half plane together with a unimodular function group representation u(\lambda) = \exp(i(\lambda_1\psi_1 + ... + \lambda_n\psi_n)) for \lambda in R^n, gives rise to a manifold M of orthogonal projections…

It is known that the structure of invariant subspaces of the Hardy space $H^2(\mathbb D^n)$ on the polydisc $\mathbb{D}^n$ is very complicated; hence, we need good examples help us to understand the structure of invariant subspaces of…

We study the structure of a minimum dominating set of $C_{2n+1}^n$, the Cartesian product of $n$ copies of the cycle of size $2n+1$, where $2n+1$ is a prime.

For a undirected simple graph $G$, let $d_i(G)$ be the number of $i$-element dominating vertex set of $G$. The domination polynomial of the graph $G$ is defined as $$D(G, x) = \sum_{i = 1}^n d_i(G)x^i.$$ Alikhani and Peng conjectured that…

The commonly used spatial entropy $h_{r}(\mathcal{U})$ of the multi-dimensional shift space $\mathcal{U}$ is the limit of growth rate of admissible local patterns on finite rectangular sublattices which expands to whole space…

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…