Related papers: Small Connections are cyclic
Local connection forms provide a very useful tool for handling connections on principal bundles, because they ignore any complexities of the total space and, essentially, involve only two fundamental features of the structure group, namely…
In this paper we examine an inverse problem in the modular theory of von Neumann algebras in the case of finite factors. First we give a characterization of cyclic and separating vectors for finite factors in terms of operators associated…
In this article we prove the existence of pl-flipping and divisorial contractions and pl flips in dimension $n$ for compact K\"ahler varieties, assuming results of the minimal model program in dimension $n-1$. We also give a self contained…
The clique graph $kG$ of a graph $G$ has as its vertices the cliques (maximal complete subgraphs) of $G$, two of which are adjacent in $kG$ if they have non-empty intersection in $G$. We say that $G$ is clique convergent if $k^nG\cong k^m…
A. Avil\'es and C. Brech proved a intriguing result about the existence and uniqueness of certain injective Boolean algebras or Banach spaces. Their result refines the standard existence and uniqueness of saturated models. They express a…
We study density properties of orbits for a hypercyclic operator $T$ on a separable Banach space $X$, and show that exactly one of the following four cases holds: (1) every vector in $X$ is asymptotic to zero with density one; (2) generic…
Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…
A famous theorem of Dirac states that any graph on $n$ vertices with minimum degree at least $n/2$ has a Hamilton cycle. Such graphs are called Dirac graphs. Strengthening this result, we show the existence of rainbow Hamilton cycles in…
In this paper, we study the hypercyclic composition operators on weighted Banach spaces of functions defined on discrete metric spaces. We show that the only such composition operators act on the "little" spaces. We characterize the bounded…
It is well known that every sufficiently large connected graph has, as an induced subgraph, $K_n$, $K_{1,n}$, or an $n$-vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoidable induced subgraphs of…
Let $X$ and $Y$ be separable Banach spaces. Suppose $Y$ either has a shrinking basis or $Y$ is isomorphic to $C(2^\mathbb{N})$ and $A$ is a subset of weakly compact operators from $X$ to $Y$ which is analytic in the strong operator…
Cyclic monotone independence is an algebraic notion of noncommutative independence, introduced in the study of multi-matrix random matrix models with small rank. Its algebraic form turns out to be surprisingly close to monotone…
In this note, at first we prove that the existence of best proximity points for cyclic relatively nonexpansive mappings is equivalent to the existence of best proximity pairs for noncyclic relatively nonexpansive mappings in the setting of…
We characterize model polynomials that are cyclic in Dirichlet-type spaces in the unit ball of $\mathbb{C}^n$, and we give a sufficient capacity condition in order to identify non-cyclic vectors.
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected…
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cycles possesses an acyclic set of size at least $3n/5$. We…
We use the method of atomic decomposition and a new family of Banach spaces to study the action of transfer operators associated to piecewise-defined maps. It turns out that these transfer operators are quasi-compact even when the…
In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables. Indeed,…
Causal discovery, the problem of inferring the direction of causality, is generally ill-posed. We use the language of structural causal models (SCM) to show that assuming that the causal relations are acyclic and invariant across multiple…