Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTransitivity and bundle shifts
65
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A subalgebra $A$ of the algebra $B(mathcal{H})$ of bounded linear operators on a separable Hilbert space $mathcal{H}$ is said to be catalytic if every transitive subalgebra $mathcal{T}subset B(mathcal{H})$ containing it is strongly dense. We show that for a hypo-Dirichlet or logmodular algebra, $A=H^{infty}(m)$ acting on a generalized Hardy space $H^{2}(m)$ for a representing measure $m$ that defines a reproducing kernel Hilbert space is catalytic. For the case of a nice finitely-connected domain, we show that the holomorphic functions of a bundle shift yields a catalytic algebra, thus generalize a result of Bercovici, Foias, Pearcy and the first author[7].
rate research
Read More
Following upon results of Putinar, Sun, Wang, Zheng and the first author, we provide models for the restrictions of the multiplication by a finite Balschke product on the Bergman space in the unit disc to its reducing subspaces. The models involve a generalization of the notion of bundle shift on the Hardy space introduced by Abrahamse and the first author to the Bergman space. We develop generalized bundle shifts on more general domains. While the characterization of the bundle shift is rather explicit, we have not been able to obtain all the earlier results appeared, in particular, the facts that the number of the minimal reducing subspaces equals the number of connected components of the Riemann surface $B(z)=B(w)$ and the algebra of commutant of $T_{B}$ is commutative, are not proved. Moreover, the role of the Riemann surface is not made clear also.
An action of a group $G$ is highly transitive if $G$ acts transitively on $k$-tuples of distinct points for all $k geq 1$. Many examples of groups with a rich geometric or dynamical action admit highly transitive actions. We prove that if a group $G$ admits a highly transitive action such that $G$ does not contain the subgroup of finitary alternating permutations, and if $H$ is a confined subgroup of $G$, then the action of $H$ remains highly transitive, possibly after discarding finitely many points. This result provides a tool to rule out the existence of highly transitive actions, and to classify highly transitive actions of a given group. We give concrete illustrations of these applications in the realm of groups of dynamical origin. In particular we obtain the first non-trivial classification of highly transitive actions of a finitely generated group.
In this note we study sub-Hardy Hilbert spaces on which the the action of the operator of multiplication by the coordinate function z is assumed to be weaker than that of an isometry. We identify such operators with a class of weighted shifts. The well known results of de Branges and Beurling are deduced as corollaries .
We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth for a restricted family of automaton semigroups.
We consider existential rules (aka Datalog+) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these classes cannot express transitivity of binary relations, a frequently used modelling construct. In this paper, we address the issue of whether transitivity can be safely combined with decidable classes of existential rules. First, we prove that transitivity is incompatible with one of the simplest decidable classes, namely aGRD (acyclic graph of rule dependencies), which clarifies the landscape of `finite expansion sets of rules. Second, we show that transitivity can be safely added to linear rules (a subclass of guarded rules, which generalizes the description logic DL-Lite-R) in the case of atomic CQs, and also for general CQs if we place a minor syntactic restriction on the rule set. This is shown by means of a novel query rewriting algorithm that is specially tailored to handle transitivity rules. Third, for the identified decidable cases, we pinpoint the combined and data complexities of query entailment.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
