相关论文: A unified Pietsch domination theorem
Here we provide a unifying treatment of the convergence of a general form of sampling type operators, given by the so-called Durrmeyer sampling type series. In particular we provide a pointwise and uniform convergence theorem on…
Our aim was to generalize some theorems about the saturation of ultra-powers to reduced powers. Naturally, we deal via saturation for types consisting of atomic formulas. We succeed to generalize the theory of dense linear is maximal and so…
We review the basic theory of More Sums Than Differences (MSTD) sets, specifically their existence, simple constructions of infinite families, the proof that a positive percentage of sets under the uniform binomial model are MSTD but not if…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…
We prove a converse Lyapunov theorem for boundedness of reachability sets for a general class of control systems whose flow is Lipschitz continuous on compact intervals with respect to trajectory-dominated inputs. We show that this…
A total dominating set in a graph is a set of vertices such that every vertex of the graph has a neighbor in the set. We introduce and study graphs that admit non-negative real weights associated to their vertices such that a set of…
We present a new and simple proof of a theorem due to Kaplansky which unifies theorems of Kolchin and Levitzki on triangularizability of semigroups of matrices. We also give two different extensions of the theorem. As a consequence, we…
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
In this paper, we investigate classes of Lip-linear operators constructed using the composition ideal method. We focus on two fundamental linear operator ideals, $p$-summing and strongly $p$-summing operators, and extend them to define the…
A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…
This article is devoted to completing some aspects of the classical Cauchy-Lipschitz (or Picard-Lindel\"of) theory for general nonlinear systems posed on time scales, that are closed subsets of the set of real numbers. Partial results do…
We prove that in the reflexive range $1<p<q<\infty$ the algebra of all bounded linear operators on $\ell_p\oplus\ell_q$ has infinitely many closed ideals. This solves a problem raised by A. Pietsch in his book `Operator ideals'.
In a finite undirected graph $G=(V,E)$, a vertex $v \in V$ {\em dominates} itself and its neighbors. A vertex set $D \subseteq V$ in $G$ is an {\em efficient dominating set} ({\em e.d.} for short) of $G$ if every vertex of $G$ is dominated…
After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…
Suppose $w$ is a sense-preserving harmonic mapping of the unit disk $\mathbb{D}$ such that $w(\mathbb{D})\subseteq\mathbb{D}$ and $w$ has a zero of order $p\geq1$ at $z=0$. In this paper, we first improve the Schwarz lemma for $w$, and…
This paper introduces the concept of compliant vertices and compliant graphs, with a focus on the total domination degree (TDD) of a vertex in compliant graphs. The TDD is systematically calculated for various graph classes, including path…
In this paper, we introduce new concepts of domination and packing functions in graphs, which generalize, respectively, the labelled dominating and packing functions defined by Lee and Chang in 2008, and Hinrichsen et al. in 2019. These…
Grothendieck's theorem asserts that every continuous linear operator from $\ell_{1}$ to $\ell_{2}$ is absolutely $\left( 1;1\right) $-summing. In this note we prove that the optimal constant $g_{m}$ so that every continuous $m$-linear…
We prove when a Banach ideal of linear operators defined, or characterized, by the transformation of vector-valued sequences is maximal. Known results are recovered as particular cases and new information is obtained. To accomplish this…