English
Related papers

Related papers: Domination and Closure

200 papers

A semiregular operator on a Hilbert C^*-module, or equivalently, on the C^*-algebra of `compact' operators on it, is a closable densely defined operator whose adjoint is also densely defined. It is shown that for operators on extensions of…

Operator Algebras · Mathematics 2016-09-07 Arupkumar Pal

Let $H_1,H_2$ be complex Hilbert spaces and $T:H_1\rightarrow H_2$ be a densely defined closed operator with domain $D(T)\subseteq H_1$ and $T^{\dagger}$ be the Moore-Penrose inverse of $T$. Let $S:H_1\rightarrow H_2$ be a bounded operator.…

Functional Analysis · Mathematics 2015-10-08 S. H. Kulkarni , G. Ramesh

The most famous open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal…

Functional Analysis · Mathematics 2012-12-19 Jonathan M. Borwein , Liangjin Yao

We first give a condition for a normal operator on a Hilbert space to have no nonzero periodic points, then we give a characterization of normal operators with the whole space as periodic points. We proceed to study the structure of…

Functional Analysis · Mathematics 2025-01-23 Howen Chuah

We study infinite matrices $A$ indexed by a discrete group $G$ that are dominated by a convolution operator in the sense that $|(Ac)(x)| \leq (a \ast |c|)(x)$ for $x\in G$ and some $a\in \ell ^1(G)$. This class of "convolution-dominated"…

Functional Analysis · Mathematics 2010-12-21 Gero Fendler , Karlheinz Gröchenig , Michael Leinert

In previous works, we introduced the notion of dominant vertices in the context of dynamical systems on networks. This is a set of nodes in the underlying network whose evolution determines the whole network's dynamics after a transient…

Dynamical Systems · Mathematics 2026-03-05 Andrea España , William Funez , Edgardo Ugalde

The correspondence between the monotonicity of a (possibly) set-valued operator and the firm nonexpansiveness of its resolvent is a key ingredient in the convergence analysis of many optimization algorithms. Firmly nonexpansive operators…

Optimization and Control · Mathematics 2019-02-27 Heinz H. Bauschke , Walaa M. Moursi , Xianfu Wang

We generalize Loewner's method for proving that matrix monotone functions are operator monotone. The relation x \leq y on bounded operators is our model for a definition for C*-relations of being residually finite dimensional. Our main…

Operator Algebras · Mathematics 2019-08-15 Terry A. Loring

The T-duality transformations between open and closed superstrings in different D-manifolds are generalized to curved backgrounds with commuting isometries. We address some global aspects like the occurrence of orientifold boundaries in…

High Energy Physics - Theory · Physics 2009-10-30 E. Alvarez , J. L. F. Barbon , J. Borlaf

For oriented connected closed manifolds of the same dimension, there is a transitive relation: $M$ dominates $N$, or $M \ge N$, if there exists a continuous map of non-zero degree from $M$ onto $N$. Section 1 is a reminder on the notion of…

Algebraic Topology · Mathematics 2016-09-22 Pierre de la Harpe

Some basic notions and results in Topological Dynamics are extended to continuous groupoid actions in topological spaces. We focus mainly on recurrence properties. Besides results that are analogous to the classical case of group actions,…

Dynamical Systems · Mathematics 2022-12-01 Felipe Flores , Marius Mantoiu

Discrete models have a long tradition in engineering, including finite state machines, Boolean networks, Petri nets, and agent-based models. Of particular importance is the question of how the model structure constrains its dynamics. This…

Molecular Networks · Quantitative Biology 2011-08-02 Reinhard Laubenbacher , David Murrugarra , Alan Veliz-Cuba

Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…

General Mathematics · Mathematics 2008-05-13 Elemer E Rosinger

It has been an open question as to whether the Modular Structural Operational Semantics framework can express the dynamic semantics of call/cc. This paper shows that it can, and furthermore, demonstrates that it can express the more general…

Programming Languages · Computer Science 2016-06-22 Neil Sculthorpe , Paolo Torrini , Peter D. Mosses

We consider a class of block operator matrices arising in the study of scattering passive systems, especially in the context of boundary control problems. We prove that these block operator matrices are indeed a subclass of block operator…

Functional Analysis · Mathematics 2015-02-20 Sascha Trostorff

The main result is Theorem MAT 11 which states that every finite closure operator is the ground set of a matroid. Its base sets consist of nonredundant covers of of the closure. These are minimal subsets that determine the closure operator…

Combinatorics · Mathematics 2022-11-11 Wayne E. Dick

The pull-back, push-forward and multiplication of smooth functions can be extended to distributions if their wave front set satisfies some conditions. Thus, it is natural to investigate the topological properties of these operations between…

Functional Analysis · Mathematics 2016-10-12 Christian Brouder , Nguyen Viet Dang , Frédéric Hélein

In our another recent article, we introduce a new dynamical property for linear operators called norm-unimodality which implies distributional chaos. In the present paper, we'll give a further discussion of norm-unimodality. It is showed…

Functional Analysis · Mathematics 2009-03-27 Bingzhe Hou , Geng Tian , Luoyi Shi

Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per…

Combinatorics · Mathematics 2014-07-22 William F Klostermeyer , Christina M Mynhardt

We consider optimization algorithms that are open systems, that is, with external inputs and outputs. Such algorithms arise for instance, when analyzing the effect of noise or disturbance on an algorithm, or when an algorithm is part of…

Optimization and Control · Mathematics 2026-04-02 Jaap Eising , Florian Dörfler