More Like this

1. Hyperbolic families and coloring graphs on surfaces

   https://doi.org/https://doi.org/10.1090/btran/26  

   Postle, Luke; Thomas, Robin (December 2018, Transactions of the American Mathematical Society. Series B)

   We develop a theory of linear isoperimetric inequalities for graphs on surfaces and apply it to coloring problems, as follows. Let $ G$ be a graph embedded in a fixed surface $$ \Sigma $$ of genus $ g$ and let $$ L=(L(v):v\in V(G))$$ be a collection of lists such that either each list has size at least five, or each list has size at least four and $ G$ is triangle-free, or each list has size at least three and $ G$ has no cycle of length four or less. An $ L$-coloring of $ G$ is a mapping $$ \phi $$ with domain $ V(G)$ such that $$ \phi (v)\in L(v)$$ for every $$ v\in V(G)$$ and $$ \phi (v)\ne \phi (u)$$ for every pair of adjacent vertices $$ u,v\in V(G)$$. We prove if every non-null-homotopic cycle in $ G$ has length $$ \Omega (\log g)$$, then $ G$ has an $ L$-coloring, if $ G$ does not have an $ L$-coloring, but every proper subgraph does (``$ L$-critical graph''), then $$ \vert V(G)\vert=O(g)$$, if every non-null-homotopic cycle in $ G$ has length $$ \Omega (g)$$, and a set $$ X\subseteq V(G)$$ of vertices that are pairwise at distance $$ \Omega (1)$$ is precolored from the corresponding lists, then the precoloring extends to an $ L$-coloring of $ G$, if every non-null-homotopic cycle in $ G$ has length $$ \Omega (g)$$, and the graph $ G$ is allowed to have crossings, but every two crossings are at distance $$ \Omega (1)$$, then $ G$ has an $ L$-coloring, if $ G$ has at least one $ L$-coloring, then it has at least $$ 2^{\Omega (\vert V(G)\vert)}$$ distinct $ L$-colorings. We show that the above assertions are consequences of certain isoperimetric inequalities satisfied by $ L$-critical graphs, and we study the structure of families of embedded graphs that satisfy those inequalities. It follows that the above assertions hold for other coloring problems, as long as the corresponding critical graphs satisfy the same inequalities. 

   more » « less
2. Universal minimal flows of extensions of and by compact groups

   https://doi.org/10.1017/etds.2022.52  

   BARTOŠOVÁ, DANA (August 2023, Ergodic Theory and Dynamical Systems)

   Abstract Every topological group G has, up to isomorphism, a unique minimal G -flow that maps onto every minimal G -flow, the universal minimal flow $M(G).$ We show that if G has a compact normal subgroup K that acts freely on $M(G)$ and there exists a uniformly continuous cross-section from $G/K$ to $G,$ then the phase space of $M(G)$ is homeomorphic to the product of the phase space of $M(G/K)$ with K . Moreover, if either the left and right uniformities on G coincide or G is isomorphic to a semidirect product $$G/K\ltimes K$$ , we also recover the action, in the latter case extending a result of Kechris and Sokić. As an application, we show that the phase space of $M(G)$ for any totally disconnected locally compact Polish group G with a normal open compact subgroup is homeomorphic to a finite set, the Cantor set $$2^{\mathbb {N}}$$ , $$M(\mathbb {Z})$$ , or $$M(\mathbb {Z})\times 2^{\mathbb {N}}.$$ 

   more » « less
3. Coprime automorphisms of finite groups

   https://doi.org/10.1090/tran/8553  

   Acciarri, Cristina; Guralnick, Robert; Shumyatsky, Pavel (July 2022, Transactions of the American Mathematical Society)

   Let G G be a finite group admitting a coprime automorphism α \alpha of order e e . Denote by I G ( α ) I_G(\alpha ) the set of commutators g − 1 g α g^{-1}g^\alpha , where g ∈ G g\in G , and by [ G , α ] [G,\alpha ] the subgroup generated by I G ( α ) I_G(\alpha ) . We study the impact of I G ( α ) I_G(\alpha ) on the structure of [ G , α ] [G,\alpha ] . Suppose that each subgroup generated by a subset of I G ( α ) I_G(\alpha ) can be generated by at most r r elements. We show that the rank of [ G , α ] [G,\alpha ] is ( e , r ) (e,r) -bounded. Along the way, we establish several results of independent interest. In particular, we prove that if every element of I G ( α ) I_G(\alpha ) has odd order, then [ G , α ] [G,\alpha ] has odd order too. Further, if every pair of elements from I G ( α ) I_G(\alpha ) generates a soluble, or nilpotent, subgroup, then [ G , α ] [G,\alpha ] is soluble, or respectively nilpotent. 

   more » « less
4. Incoherence and fibering of many free-by-free groups

   https://doi.org/10.5802/aif.3494  

   Kropholler, Robert P; Walsh, Genevieve S (January 2022, Annales de l'Institut Fourier)

   A group is called free-by-free if it is the semi-direct product of two finitely generated free groups. A group is coherent if any finitely generated subgroup is finitely presented, and incoherent otherwise. In this paper, the authors provide evidence towards the conjecture (due independently to the authors and Dani Wise) that every free-by-free group is incoherent. To do this, they give a homological condition which lets them conclude that the free-by-free group has a finite index subgroup which surjects onto ℤ with finitely generated kernel; standard arguments imply that this kernel cannot be finitely presented. As an important special case, they show that if the free-by-free group is hyperbolic and virtually special, then it is incoherent. 

   more » « less
5. THE CYCLIC GRAPH OF A Z -GROUP

   https://doi.org/10.1017/S0004972720001318  

   COSTANZO, DAVID G.; LEWIS, MARK L.; SCHMIDT, STEFANO; TSEGAYE, EYOB; UDELL, GABE (January 2020, Bulletin of the Australian Mathematical Society)

   null (Ed.)

   Abstract: For a group G, we define a graph Delta (G) by letting G^#=G\{1} be the set of vertices and by drawing an edge between distinct elements x,y in G^# if and only if the subgroup is cyclic. Recall that a Z-group is a group where every Sylow subgroup is cyclic. In this short note, we investigate Delta (G) for a Z-group G. 

   more » « less