Related papers: Classification of weighted graphs up to blowing-up…
We show that a weighted shift on a directed tree is related to a multiplier algebra of coefficients of analytic functions. We use this relation to study spectral properties of the operators in question.
Any algebraic connection on a vector bundle on a smooth complex algebraic curve determines an irregular class and in turn a fission tree at each puncture. The fission trees are the discrete data classifying the admissible deformation…
We consider two compacta with minimal non-elementary convergence actions of a countable group. When there exists an equivariant continuous map from one to the other, we call the first a blow-up of the second and the second a blow-down of…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We define a graph Laplacian with vertex weights in addition to the more classical edge weights, which unifies the combinatorial Laplacian and the normalised Laplacian. Moreover, we give a combinatorial interpretation for the coefficients of…
This paper addresses several structural aspects of the insertion-elimination algebra, a Lie algebra that can be realized in terms of tree-inserting and tree-eliminating operations on the set of rooted trees. In particular, we determine the…
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…
We introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and…
We consider blowups at a general point of weighted projective planes and, more generally, of toric surfaces with Picard number one. We give a unifying construction of negative curves on these blowups such that all previously known families…
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…
We present an algebraic approach to the watershed adapted to edge or node weighted graphs. Starting with the flooding adjunction, we introduce the flooding graphs, for which node and edge weights may be deduced one from the other. Each node…
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples…
A treedepth decomposition of an undirected graph $G$ is a rooted forest $F$ on the vertex set of $G$ such that every edge $uv\in E(G)$ is in ancestor-descendant relationship in $F$. Given a weight function $w\colon V(G)\rightarrow…
We give a survey of the approaches to classifying foliations, starting with the Haefliger classifying spaces and the various results and examples about the secondary classes of foliations. Various dynamical properties of foliations are…
We consider relationships between cubic algebras and implication algebras. We first exhibit a functorial construction of a cubic algebra from an implication algebra. Then we consider an collapse of a cubic algebra to an implication algebra…
In this article, we present a complete classification, with normal forms, of the real algebraic curves under blow-spherical homeomorphisms at infinity.
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…
Assorted weighted shifts over finite rooted directed trees are studied. Their complex symmetry is characterized.
We define graded Hopf algebras with bases labeled by various types of graphs and hypergraphs, provided with natural embeddings into an algebra of polynomials in infinitely many variables. These algebras are graded by the number of edges and…