Some topics in the dynamics of group actions on rooted trees

This article combines the features of a survey and a research paper. It presents a review of some results obtained during the last decade in problems related to the dynamics of branch and self-similar groups on the boundary of a spherically homogeneous rooted tree and to the combinatorics and asymptotic properties of Schreier graphs associated with a group or with its action. Special emphasis is placed on the study of essentially free actions of selfsimilar groups, which are antipodes to branch actions. At the same time, the theme “free versus nonfree” runs through the paper. Sufficient conditions are obtained for the essential freeness of an action of a self-similar group on the boundary of a tree. Specific examples of such actions are given. Constructions of the associated dynamical system and the Schreier dynamical system generated by a Schreier graph are presented. For groups acting on trees, a trace on the associated C*-algebra generated by a Koopman representation is introduced, and its role in the study of von Neumann factors, the spectral properties of groups, Schreier graphs, and elements of the associated C*-algebra is demonstrated. The concepts of asymptotic expander and asymptotic Ramanujan graph are introduced, and examples of such graphs are given. Questions related to the notion of the cost of action and the notion of rank gradient are discussed.     

Further results on random cubic planar graphs

We provide precise asymptotic estimates for the number of several classes of labeled cubic planar graphs, and we analyze properties of such random graphs under the uniform distribution. This model was first analyzed by Bodirsky and coworkers. We revisit their work and obtain new results on the enumeration of cubic planar graphs and on random cubic planar graphs. In particular, we determine the exact probability of a random cubic planar graph being connected, and we show that the distribution of the number of triangles in random cubic planar graphs is asymptotically normal with linear expectation and variance. To the best of our knowledge, this is the first time one is able to determine the asymptotic distribution for the number of copies of a fixed graph containing a cycle in classes of random planar graphs arising from planar maps.     

A Munn tree type representation for the elements of the bifree locally inverse semigroup

The Munn tree representation for the elements of the free inverse monoid is an elegant and useful tool in the theory of inverse semigroups. It has been the starting point for many of the subsequent developments in this theory. In the present paper we generalize this representation for the elements of the bifree locally inverse semigroup. We will represent each element of the bifree locally inverse semigroup as an undirected tree whose vertices, called blocks, are special vertex-labeled graphs themselves. Another distinctive characteristic of these graphs is that they have different types of edges.

     

Quilted Gabor frames – A new concept for adaptive time-frequency representation

Certain signal classes such as audio signals call for signal representations with the ability to adapt to the signalʼs properties. In this article we introduce the new concept of quilted frames, which aim at adaptivity in time-frequency representations. As opposed to Gabor or wavelet frames, this new class of frames allows for the adaptation of the signal analysis to the local requirements of signals under consideration. Quilted frames are constructed directly in the time-frequency domain in a signal-adaptive manner. Validity of the frame property guarantees the possibility to reconstruct the original signal. The frame property is shown for specific situations and the Bessel property is proved for the general setting. Strategies for reconstruction from coefficients obtained with quilted Gabor frames and numerical simulations are provided as well.     

Atomic representations of rank 2 graph algebras

We provide a detailed analysis of atomic ∗-representations of rank 2 graphs on a single vertex. They are completely classified up to unitary equivalence, and decomposed into a direct sum or direct integral of irreducible atomic representations. The building blocks are described as the minimal ∗-dilations of defect free representations modelled on finite groups of rank 2.     

Generalised Weyl–Heisenberg frame operators

We seek to characterise, in simple and unsophisticated terms, frame operators of Weyl–Heisenberg frames. We succeed only partially, using the newly introduced concepts of window operators and tile vertices. However, we are able to completely characterise the frame operator in each of two newly introduced classes: window Weyl–Heisenberg frames (a special class of Weyl–Heisenberg frames) and generalised Weyl–Heisenberg frames (a class more general than Weyl–Heisenberg frames).     

An algorithm for constructing star-shaped drawings of plane graphs

A straight-line planar drawing of a plane graph is called a convex drawing if every facial cycle is drawn as a convex polygon. Convex drawings of graphs is a well-established aesthetic in graph drawing, however not all planar graphs admit a convex drawing. Tutte [W.T. Tutte, Convex representations of graphs, Proc. of London Math. Soc. 10 (3) (1960) 304–320] showed that every triconnected plane graph admits a convex drawing for any given boundary drawn as a convex polygon. Thomassen [C. Thomassen, Plane representations of graphs, in: Progress in Graph Theory, Academic Press, 1984, pp. 43–69] gave a necessary and sufficient condition for a biconnected plane graph with a prescribed convex boundary to have a convex drawing.In this paper, we initiate a new notion of star-shaped drawing of a plane graph as a straight-line planar drawing such that each inner facial cycle is drawn as a star-shaped polygon, and the outer facial cycle is drawn as a convex polygon. A star-shaped drawing is a natural extension of a convex drawing, and a new aesthetic criteria for drawing planar graphs in a convex way as much as possible. We give a sufficient condition for a given set A of corners of a plane graph to admit a star-shaped drawing whose concave corners are given by the corners in A, and present a linear time algorithm for constructing such a star-shaped drawing.     

Representation of the inverse of a frame multiplier

Certain mathematical objects appear in a lot of scientific disciplines, like physics, signal processing and, naturally, mathematics. In a general setting they can be described as frame multipliers, consisting of analysis, multiplication by a fixed sequence (called the symbol), and synthesis. In this paper we show a surprising result about the inverse of such operators, if any, as well as new results about a core concept of frame theory, dual frames. We show that for semi-normalized symbols, the inverse of any invertible frame multiplier can always be represented as a frame multiplier with the reciprocal symbol and dual frames of the given ones. Furthermore, one of those dual frames is uniquely determined and the other one can be arbitrarily chosen. We investigate sufficient conditions for the special case, when both dual frames can be chosen to be the canonical duals. In connection to the above, we show that the set of dual frames determines a frame uniquely. Furthermore, for a given frame, the union of all coefficients of its dual frames is dense in ?²${?}^2$. We also introduce a class of frames (called pseudo-coherent frames), which includes Gabor frames and coherent frames, and investigate invertible pseudo-coherent frame multipliers, allowing a classification for frame-type operators for these frames. Finally, we give a numerical example for the invertibility of multipliers in the Gabor case.     

Intersection graphs of paths in a tree

The intersection graph for a family of sets is obtained by associating each set with a vertex of the graph and joining two vertices by an edge exactly when their corresponding sets have a nonempty intersection. Intersection graphs arise naturally in many contexts, such as scheduling conflicting events, and have been widely studied.We present a unified framework for studying several classes of intersection graphs arising from families of paths in a tree. Four distinct classes of graphs arise by considering paths to be the sets of vertices or the edges making up the path, and by allowing the underlying tree to be undirected or directed; in the latter case only directed paths are allowed. Two further classes are obtained by requiring the directed tree to be rooted. We introduce other classes of graphs as well. The rooted directed vertex path graphs have been studied by Gavril; the vertex path graphs have been studied by Gavril and Renz; the edge path graphs have been studied by Golumbic and Jamison, Lobb, Syslo, and Tarjan.The main results are a characterization of these graphs in terms of their “clique tree” representations and a unified recognition algorithm. The algorithm repeatedly separates an arbitrary graph by a (maximal) clique separator, checks the form of the resultant nondecomposable “atoms,” and finally checks that each separation step is valid. In all cases, the first two steps can be performed in polynomial time. In all but one case, the final step is based on a certain two-coloring condition and so can be done efficiently; in the other case the recognition problem can be shown to be NP-complete since a certain three-coloring condition is needed.The strength of this unified approach is that it clarifies and unifies virtually all of the important known results for these graphs and provides substantial new results as well. For example, the exact intersecting relationships among these graphs, and between these graphs and chordal and perfect graphs fall out easily as corollaries. A number of other results, such as bounds on the number of (maximal) cliques, related optimization problems on these graphs, etc., are presented along with open problems.     

Properties of unique realizations—a survey

A graph is called simple if it is the only realization of its degree sequences. The simple graphs which are not blocks are characterized. Results on the radius and diameter of simple blocks are given.     

A metaheuristic approach to the dominating tree problem

This paper considers a recently introduced NP-hard problem on graphs, called the dominating tree problem. In order to solve this problem, we develop a variable neighborhood search (VNS) based heuristic. Feasible solutions are obtained by using the set of vertex permutations that allow us to implement standard neighborhood structures and the appropriate local search procedure. Computational experiments include two classes of randomly generated test instances and benchmark test instances from the literature. Optimality of VNS solutions on small size instances is verified with CPLEX.     

Locally-finite connected-homogeneous digraphs

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that the digraph embeds a triangle we give a complete classification, obtaining a family of tree-like graphs constructed by gluing together directed triangles. In the triangle-free case we show that these digraphs are highly arc-transitive. We give a classification in the two-ended case, showing that all examples arise from a simple construction given by gluing along a directed line copies of some fixed finite directed complete bipartite graph. When the digraph has infinitely many ends we show that the descendants of a vertex form a tree, and the reachability graph (which is one of the basic building blocks of the digraph) is one of: an even cycle, a complete bipartite graph, the complement of a perfect matching, or an infinite semiregular tree. We give examples showing that each of these possibilities is realised as the reachability graph of some connected-homogeneous digraph, and in the process we obtain a new family of highly arc-transitive digraphs without property Z.     

Vertex partitions of r-edge-colored graphs

Let G be an edge-colored graph.The monochromatic tree partition problem is to find the minimum number of vertex disjoint monochromatic trees to cover the all vertices of G.In the authors' previous work,it has been proved that the problem is NP-complete and there does not exist any constant factor approximation algorithm for it unless P=NP.In this paper the authors show that for any fixed integer r≥5,if the edges of a graph G are colored by r colors,called an r-edge-colored graph,the problem remains NP-complete.Similar result holds for the monochromatic path(cycle)partition problem.Therefore,to find some classes of interesting graphs for which the problem can be solved in polynomial time seems interesting. A linear time algorithm for the monochromatic path partition problem for edge-colored trees is given.     

Enumeration of weak isomorphism classes of signed graphs

A signed graph is a graph in which each line has a plus or minus sign. Two signed graphs are said to be weakly isomorphic if their underlying graphs are isomorphic through a mapping under which signs of cycles are preserved, the sign of a cycle being the product of the signs of its lines. Some enumeration problems implied by such a definition, including the problem of self-dual configurations, are solved here for complete signed graphs by methods of linear algebra over the two-element field. It is also shown that weak isomorphism classes of complete signed graphs are equal in number to other configurations: unlabeled even graphs, two-graphs and switching classes.     

Admissible Domains for Higher Order Differential Equations

This paper analyzes the geometric structure of certain domains in the complex plane which arise in the asymptotic theory of linear ordinary differential equations containing a parameter. These domains, called admissible, are domains in which an asymptotic representation of the solution of the differential equation may be found and across whose boundaries these representations may undergo a rapid change of asymptotic behavior (the Stokes phenomenon). A knowledge of the disposition of those domains associated with a particular differential equation is necessary for a satisfactory asymptotic theory of the equation. The main analysis gives necessary and sufficient conditions for identifying admissible domains and gives a procedure for obtaining particular admissible subdomains of a given domain. Sufficient conditions are established to determine the maximality of admissible domains. A section of examples is included to highlight the salient features of this theory. In all of the results, criteria involving only purely local properties of the boundary are needed to determine the global properties of admissibility and maximal admissibility .     

两类四正则图的完全亏格分布

一个图G的完全亏格多项式表征了图G的亏格(可定向,不可定向)分布情况.本文利用刘彦佩提出的嵌入的联树模型,得出了两类新的四正则图的完全亏格多项式,并推导出已有结果的两类图的完全亏格多项式.此处的结果形式更为简单.