Related papers: Hypercyclic algebras for weighted shifts on trees
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
We characterise digraphs of directed treewidth one in terms of forbidden butterfly minors. Moreover, we show that there is a linear relation between the hypertree-width of the dual of the cycle hypergraph of D, i. e. the hypergraph with…
We study multiply recurrent and hypercyclic operators as a special case of $\mathcal F$-hypercyclicity, where $\mathcal F$ is the family of subsets of the natural numbers containing arbitrarily long arithmetic progressions. We prove several…
Using representation theory techniques we prove that various spaces of derivations or one-sided multipliers over certain operator algebras are reflexive. A sample result: any bounded local derivation (local left multiplier) on an…
we study the hypercyclic and chaotic properties of the time varying weighted backward shift operator $(Tx)(t)=w(t)x(t+a)$ in $L_p(0,\infty)(1\leq p<\infty)$ and $C_0[0,\infty)$. And we also analyse the spectral structure of the operators if…
Weight-balanced trees are a popular form of self-balancing binary search trees. Their popularity is due to desirable guarantees, for example regarding the required work to balance annotated trees. While usual weight-balanced trees perform…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
In this paper, we give a brief review concerning diskcyclic operators and then we provide some further characterizations of diskcyclic operators on separable Hilbert spaces. In particular, we show that if $x\in {\mathcal H}$ has a disk…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
We study the structure of operator algebras associated with the foliations which have projectively invariant measures. When a certain ergodicity condition on the measure preserving holonomies holds, the lack of holonomy invariant transverse…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the…
This article aims to initiate a study of bilateral weighted backward shift operators defined on the spaces $\ell^p_{a,b}(\Omega_{r,R})$ and $c_{0,a,b}(\Omega_{r,R})$ which are Banach spaces of analytic functions on a suitable annulus in the…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Symmetry transformations of the space-time fields of string theory are generated by certain similarity transformations of the stress-tensor of the associated conformal field theories. This observation is complicated by the fact that, as we…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
Weighted V-line transforms map a symmetric tensor field of order $m\ge0$ to a linear combination of certain integrals of those fields along two rays emanating from the same vertex. A significant focus of current research in integral…