Related papers: Dominant sets for model spaces in several variable…
We introduce a variable exponent version of the Hardy space of analytic functions on the unit disk, we show some properties of the space, and give an example of a variable exponent $p(\cdot)$ that satisfies the $\log$-H\"older condition…
For a tournament $H$ with $h$ vertices, its typical density is $h!2^{-\binom{h}{2}}/aut(H)$, i.e. this is the expected density of $H$ in a random tournament. A family ${\mathcal F}$ of $h$-vertex tournaments is {\em dominant} if for all…
Given two smooth projective varieties X and Y over a field, we say that X motivates Y if the (suitably defined) motive of Y is contained in the category generated from X by taking sums, summands and products. This notion has appeared…
We introduce a domination polynomial of a graph G. The domination polynomial of a graph G of order n is the polynomial D(G, x) =\sum_{i=1}^n d(G, i)x^i, where d(G, i) is the number of dominating sets of G of size i. We obtain some…
We study domination of quadratic forms in the abstract setting of ordered Hilbert spaces. Our main result gives a characterization in terms of the associated forms. This generalizes and unifies various earlier works. Along the way we…
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…
In this study, we partially answer the question left open in Rudin's book "Function theory in polydiscs" on the structure of invariant subspaces of the Hardy space $H^2(U^n)$ on the polydisc $U^n$. We completely describe all invariant…
Consider a Hilbert space obtained as the completion of the polynomials C[z} in m-variables for which the mnonomials are orthogonal. If the commuting weighted shifts defined by the coordinate functions are essentially normal, then the same…
In a graph $G$, we define a set of vertices to be a \emph{strong hub set} if for any two vertices in $G$, we can find a path between them whose internal vertices are all in this set. We define the \emph{strong hub cover pebbling number} of…
We use probabilistic methods to find lower bounds on the maximum number, in a graph with domination number \gamma, of dominating sets of size \gamma. We find that we can randomly generate a graph that, w.h.p., is dominated by almost all…
In this paper, we investigate the spectra of invertible weighted composition operators with automorphism symbols, on Hardy space $H^2(\mathbb{B}_N)$ and weighted Bergman spaces $A_\alpha^2(\mathbb{B}_N)$, where $\mathbb{B}_N$ is the unit…
Based on a refinement of the notion of internal sets in Colombeau's theory, so-called strongly internal sets, we introduce the space of generalized smooth functions, a maximal extension of Colombeau generalized functions. Generalized smooth…
Let $(h_I)$ denote the standard Haar system on $[0,1]$, indexed by $I\in \mathcal D$, the set of dyadic intervals and $h_I\otimes h_J$ denote the tensor product $(s,t)\mapsto h_I(s) h_J(t)$, $I,J\in \mathcal D$. We consider a class of…
We emphasize a bridge between two areas of function theory: hilbertian M\"untz spaces and model spaces of the Hardy space of the right half plane. We give miscellaneous applications of this viewpoint to hilbertian M\"untz spaces.
The unitary group $\mathrm U(\mathcal H)$ on an infinite dimensional complex Hilbert space $\mathcal H$ in its strong topology is a topological group and has some further nice properties, e.g. it is metrizable and contractible if $\mathcal…
The main result of the paper is the construction of explicit uniformly bounded basis in the spaces of complex homogenous polynomials on the unit ball of $C^3$, extending an earlier result of the author in the $C^2$ case
A predominated graph is a pair $(G,D)$, where $G$ is a graph and the vertices in $D\subseteq V(G)$ are considered already dominated. Maker-Breaker domination game critical (MBD critical) predominated graphs are introduced as the…
A power dominating set of a graph is a set of vertices that observes every vertex in the graph by combining classical domination with an iterative propagation process arising from electrical circuit theory. In this paper, we study the power…
We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…
In this paper, we introduce the class of diagonally dominant (with respect to a given LMI region ${\mathfrak D} \subset {\mathbb C}$) matrices that possesses the analogues of well-known properties of (classical) diagonally dominant…