Related papers: Counting overlattices in automorphism groups of tr…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

We show that a tree of order $n$ has at most $O(5^{n/4})$ nonisomorphic subtrees, and that this bound is best possible. We also prove an analogous result for the number of nonisomorphic rooted subtrees of a rooted tree.

We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

We find new upper bounds on the size of a minimum totally dominating set for random regular graphs and for regular graphs with large girth. These bounds are obtained through the analysis of a local algorithm using a method due to Hoppen and…

We derive the asymptotic distribution of the total length $L_n$ of a $\operatorname {Beta}(2-\alpha,\alpha)$-coalescent tree for $1<\alpha<2$, starting from $n$ individuals. There are two regimes: If $\alpha\le1/2(1+\sqrt{5})$, then $L_n$…

The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…

We give a sharp bound on the number of triangles in a graph with fixed number of edges. We also characterize graphs that achieve the maximum number of triangles. Using the upper bound on number of triangles, we prove that if $G$ is a…

We discuss the possibility of very regular subgroups of a Lie group, in presence of an index figure. Further, representations that reduce action to a very regular boundary.

Let $X$ be a compact Riemann surface of genus $g\geq 2$. Let $Aut(X)$ be its group of automorphisms and $G\subseteq Aut(X)$ a subgroup. Sharp upper bounds for $|G|$ in terms of $g$ are known if $G$ belongs to certain classes of groups, e.g.…

For a group G with trivial center there is a natural embedding of G into its automorphism group, so we can look at the latter as an extension of the group. So an increasing continuous sequence of groups, the automorphism tower, is defined,…

For any finitely generated group $G$, two complexity functions $\alpha_G$ and $\beta_G$ are defined to measure the maximal possible gap between the norm of an automorphism (respectively outer automorphism) of $G$ and the norm of its…

We identify natural conditions for a countable group acting on a countable tree which imply that the orbit equivalence relation of the induced action on the Gromov boundary is Borel hyperfinite. Examples of this condition include…

We give a sharp bound on the number of automorphisms of a stable curve of a given genus and describe all curves attaining this bound.

This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…

For an undirected tree with $n$ edges labelled by single letters, we consider its substrings, which are labels of the simple paths between pairs of nodes. We prove that there are $O(n^{1.5})$ different palindromic substrings. This solves an…

We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…

Let $F_n$ be the free group on $n \geq 2$ generators. We show that for all $1 \leq m \leq 2n-3$ (respectively for all $1 \leq m \leq 2n-4$) there exists a subgroup of $\operatorname{Aut}(F_n)$ (respectively $\operatorname{Out}(F_n)$) which…

In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of…

In this paper, we refer to a asymptotic degree sequence as $\mathscr{D}=(d_1,d_2,\dots,d_n)$. The examination of topological indices on trees gives us a general overview through bounds to find the maximum and minimum bounds which reflect…