Related papers: Plane trees, Shabat-Zapponi polynomials and Julia …
We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a…
We study the plane automorphisms given by polynomials with certain degree decompositions.
The airplane, the basilica and the Douady rabbit (and, more generally, rabbits with more than two ears) are well-known Julia sets of complex quadratic polynomials. In this paper we study the groups of all homeomorphisms of such fractals and…
Symmetric Jacobi matrices on one sided homogeneous trees are studied. Essential selfadjointness of these matrices turns out to depend on the structure of the tree. If a tree has one end and infinitely many origin points the matrix is always…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
We present a method of obtaining a Belyi map on an elliptic curve from that on the Riemann sphere. This is done by writing the former as a radical of the latter, which we call a quadratic correspondence, with the radical determining the…
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
We introduce tree dimension and its leveled variant in order to measure the complexity of leaf sets in binary trees. We then provide a tight upper bound on the size of such sets using leveled tree dimension. This, in turn, implies both the…
An elliptic exceptional Belyi covering is a connected Belyi covering uniquely determined by its ramification scheme or the respective dessin d'enfant when the underlying compact Riemann surface has genus 1. We give our Maple algorithm and…
Four-dimensional CFTs dual to branes transverse to toric Calabi-Yau threefolds have been described by bipartite graphs on a torus (dimer models). We use the theory of dessins d'enfants to describe these in terms of triples of permutations…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
We study affine Jacobi structures on an affine bundle $\pi:A\to M$, i.e. Jacobi brackets that close on affine functions. We prove that there is a one-to-one correspondence between affine Jacobi structures on $A$ and Lie algebroid structures…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
Over the last 30 years, researchers have investigated connections between dimension for posets and planarity for graphs. Here we extend this line of research to the structural graph theory parameter tree-width by proving that the dimension…
A tool package for computing genus 0 Belyi functions is presented, including simplification routines, computation of moduli fields, decompositions, dessins d'enfant. The main algorithm for computing the Belyi functions themselves is based…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
We determine the special values at positive integers of the spectral zeta function associated with the combinatorial Laplacian on the regular tree. These values admit explicit formulas in terms of certain polynomials, which we show to be…
Riemann's Existence Theorem gives the following bijections: (1) Isomorphism classes of Belyi maps of degree $d$. (2) Equivalence classes of generating systems of degree $d$. (3) Isomorphism classes of dessins d'enfants with $d$ edges. In…
We study compact straight-line embeddings of trees. We show that perfect binary trees can be embedded optimally: a tree with $n$ nodes can be drawn on a $\sqrt n$ by $\sqrt n$ grid. We also show that testing whether a given binary tree has…
This paper is partly a survey of known results on quadratic forms that are hard to find in the literature. Our main focus is a twisted form of a construction due to Bezout. This skew Bezoutian is a symplectic (resp. quadratic) space…