Search
Search Results
-
Disjoint subspace-hypercyclic operators on separable Banach spaces
In this paper, we initially introduce the concept of disjoint subspace-hypercyclic operators and illustrate that disjoint subspace-hypercyclic...
-
-
Disjoint Linear Dynamical Properties of Elementary Operators
In this paper, we characterize disjoint hypercyclic finite sequences of elementary operators. We provide sufficient conditions for a finite sequence...
-
Disjoint hypercyclic and supercyclic composition operators on discrete weighted Banach spaces
In this paper, we characterize the disjoint hypercyclic and disjoint supercyclic composition operators on the little weighted Banach space
... -
Non-disjoint strong external difference families can have any number of sets
Strong external difference families (SEDFs) are much-studied combinatorial objects motivated by an information security application. A well-known...
-
-
Disjoint and common hypercyclic algebras
Over time the concept of hypercyclicity has been explored in different manners and contexts, gaining new forms and applications. In particular when...
-
-
Exact separation theorem for disjoint closed sets in Hilbert spaces
Using techniques of variational analysis and in terms of proximal normal cones, we establish exact separation results for finitely many disjoint...
-
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles
Let G be an n -node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC’17) for bimodular integer programs...
-
-
Disjoint Edges in Geometric Graphs
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line...
-
-
On the Equitable Choosability of the Disjoint Union of Stars
Equitable k -choosability is a list analogue of equitable k -coloring that was introduced by Kostochka et al. (J Graph Theory 44:166–177, 2003). It is...
-
-
On Disjoint Cycles of the Same Length in Tournaments
A tournament is an orientation of the complete graph. Tournaments form perhaps the most interesting class of digraphs and it has a great potential...