English
Related papers

Related papers: A unified Pietsch domination theorem

200 papers

A classical result by J. Diestel establishes that the composition of a summing operator with a (strongly measurable) Pettis integrable function gives a Bochner integrable function. In this paper we show that a much more general result is…

Functional Analysis · Mathematics 2015-10-06 Daniel Pellegrino , Pilar Rueda , Enrique Sánchez-Pérez

We introduce a domination argument which asserts that: if we can dominate theparameters of a quadratic backward stochastic differential equation (QBSDE) with continuousgenerator from above and from below by those of two BSDEs having ordered…

Probability · Mathematics 2019-03-28 Khaled Bahlali

In this paper, we study efficient domination in regular graphs.

Combinatorics · Mathematics 2019-08-02 Misa Nakanishi

We prove some noncommutative analogues of a theorem by Plotkin and Rudin about isometries between subspaces of Lp-spaces. Let 0<p<\infty, p not an even integer. The main result of this paper states that in the category of unital subspaces…

Operator Algebras · Mathematics 2017-11-07 Mikael de la Salle

We investigate the domination polynomial of the co-maximal graph $\Gamma(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Explicit formulas are derived for \( n = p^{n_1} \) and \( n = p^{n_1}q^{n_2} \), demonstrating that the…

Combinatorics · Mathematics 2026-03-11 Bilal Ahmad Rather

We study linear control systems in infinite--dimensional Banach spaces governed by analytic semigroups. For $p\in[1,\infty]$ and $\alpha\in\RR$ we introduce the notion of $L^p$--admissibility of type $\alpha$ for unbounded observation and…

Optimization and Control · Mathematics 2007-05-23 Bernhard H. Haak , Peer Christian Kunstmann

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

Combinatorics · Mathematics 2022-12-12 Alireza Mofidi

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Category Theory · Mathematics 2007-05-23 Roman R. Zapatrin

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

Group Theory · Mathematics 2023-12-27 Kasia Jankiewicz , Kevin Schreve

A vertex set $D$ in a finite undirected graph $G$ is an efficient dominating set (e.d.s. for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The Efficient Domination (ED) problem, which asks for the existence…

Discrete Mathematics · Computer Science 2019-05-01 Andreas Brandstädt , Raffaele Mosca

Let $G=(V,E)$ be a graph without isolated vertices. A matching in $G$ is a set of independent edges in $G$. A perfect matching $M$ in $G$ is a matching such that every vertex of $G$ is incident to an edge of $M$. A set $S\subseteq V$ is a…

Combinatorics · Mathematics 2015-06-02 Ruo-Wei Hung , Chih-Chia Yao

Assume that $A$ is a closed linear operator defined on all of a Hilbert space $H$. Then $A$ is bounded. A new short proof of this classical theorem is given on the basis of the uniform boundedness principle. The proof can be easily extended…

Functional Analysis · Mathematics 2016-01-13 A. G. Ramm

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…

Combinatorics · Mathematics 2021-11-03 Shengtong Zhang

A vertex subset $S$ of a graph $G$ is a perfect (resp. quasiperfect) dominating set in $G$ if each vertex $v$ of $G\setminus S$ is adjacent to only one vertex ($d_v\in\{1,2\}$ vertices) of $S$. Perfect and quasiperfect dominating sets in…

Combinatorics · Mathematics 2009-04-03 Italo J. Dejter

Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…

Operator Algebras · Mathematics 2025-02-26 Huaxin Lin

In this paper, we show several vanishing type theorems for $p$-harmonic $\ell$-forms on Riemannian manifolds ($p\geq2$). First of all, we consider complete non-compact immersed submanifolds $M^n$ of ${N}^{n+m}$ with flat normal bundle, we…

Differential Geometry · Mathematics 2017-04-18 Nguyen Thac Dung , Pham Trong Tien

Several properties of the Harnack domination of linear operators acting on Hilbert space with norm less or equal than one are studied. Thus, the maximal elements for this relation are identified as precisely the singular unitary operators,…

Functional Analysis · Mathematics 2018-06-05 Catalin Badea , Laurian Suciu , Dan Timotin

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

Functional Analysis · Mathematics 2014-01-03 M. El Azhari

The relative index theorem is proved for general first-order elliptic operators that are complete and coercive at infinity over measured manifolds. This extends the original result by Gromov-Lawson for generalised Dirac operators as well as…

Analysis of PDEs · Mathematics 2022-10-31 Lashi Bandara

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

Functional Analysis · Mathematics 2008-12-09 Geraldo Botelho , Daniel Pellegrino , Pilar Rueda
‹ Prev 1 8 9 10 Next ›