Related papers: Connectivity Properties for Actions on Locally Fin…

The main paradigm of smoothed analysis on graphs suggests that for any large graph $G$ in a certain class of graphs, perturbing slightly the edges of $G$ at random (usually adding few random edges to $G$) typically results in a graph having…

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…

Let M be a closed connected oriented manifold admitting a non-zero degree map to a nilmanifold. In the first part of the paper we study effective finite group actions on M. In particular, we prove that Homeo(M) is Jordan, we bound the…

In this paper we find all solvable subgroups of Diff^omega(S^1) and classify their actions. We also investigate the C^r local rigidity of actions of the solvable Baumslag-Solitar groups on the circle. The investigation leads to two novel…

If $G$ is a group acting on a tree $X$, and ${\mathcal S}$ is a $G$-equivariant sheaf of vector spaces on $X$, then its compactly-supported cohomology is a representation of $G$. Under a finiteness hypothesis, we prove that if $H_c^0(X,…

Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x\rangle\subseteq \langle y\rangle$ or $\langle y\rangle\subseteq…

While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when…

In this paper we generalize some results of Richard Palais to the case of Lie supergroups and Lie superalgebras. More precisely, let $G$ be a Lie supergroup, $\mathfrak g$ its Lie superalgebra and let $\rho$ be an infinitesimal action (a…

Consider a smooth, locally free, codimension-one action of a higher-rank, simple, split Lie group $G$ on a closed manifold $M$. Let $P$ be a minimal parabolic subgroup of $G$. If the action admits a $P$-invariant probability measure that is…

Let M be a closed, connected, orientable topological 4-manifold, and G be a finite group acting topologically and locally linearly on M. In this paper we investigate the Borel spectral sequence for the G-equivariant cohomology of M, and…

Tree-based methods are powerful nonparametric techniques in statistics and machine learning. However, their effectiveness, particularly in finite-sample settings, is not fully understood. Recent applications have revealed their surprising…

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most $e^{o(\sqrt{\log n})}$. If $G$ is a digraph on $n$ vertices with minimum semidegree $\delta^0(G)\geq(\frac12+o(1))n$, then $G$ contains $T$ as a spanning tree, as…

When 1 -> H -> G -> Q -> 1 is a short exact sequence of three infinite, word-hyperbolic groups, Mahan Mitra (Mj) has shown that the inclusion map from H to G extends continuously to a map between the Gromov boundaries of H and G. This…

We consider a family of local search algorithms for the minimum-weight spanning tree, indexed by a parameter $\rho$. One step of the local search corresponds to replacing a connected induced subgraph of the current candidate graph whose…

On a locally finite point set, a navigation defines a path through the point set from one point to another. The set of paths leading to a given point defines a tree known as the navigation tree. In this article, we analyze the properties of…

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…