Brandon Seward Courant Instructor / Assistant Professor bseward@cims.nyu.edu Courant Institute of Mathematical Sciences Warren Weaver Hall, Office 1125 251 Mercer St. New York, New York 10012 Curriculum Vitae 
Brief Bio
I received my PhD
from the University of Michigan in 2015 under the supervision of Ralf
Spatzier. During the 2015/2016 academic year I was a postdoc at the
Hebrew University of Jerusalem working with Mike Hochman. I started at the Courant Institute in the fall of 2016 and have been working with Tim Austin.Research
My research is tied to combinatorial and geometric properties of groups and
measuretheoretic, topological, and descriptive settheoretic
properties of their actions. My past and current research focuses on entropy
theory for probabilitymeasurepreserving actions of countable
nonamenable groups, on Borel and measurable structurability problems
(related to cost, treeings, chromatic numbers, etc), and on hyperfiniteness problems in
descriptive set theory. 
Publications and Preprints
19. Krieger's finite generator theorem for actions of countable groups III (with A. Alpeev)
Preprint. [PDF]
18. Folner tilings for actions of amenable groups (with C. Conley, S. Jackson, D. Kerr, A. Marks, and R. TuckerDrob)Submitted. [PDF]
17. Hyperfiniteness and Borel combinatorics (with Clinton Conley, Steve Jackson, Andrew Marks, and Robin TuckerDrob)Submitted. [PDF]
16. Weak containment and Rokhlin entropyPreprint. [PDF]
15. Cost, l^2Betti numbers, and the sofic entropy of some algebraic actions (with Damien Gaboriau)14. Forcing constructions and countable Borel equivalence relations (with Su Gao, Steve Jackson, and Edward Krohne) Submitted. [PDF]
13. Krieger's finite generator theorem for actions of countable groups IIPreprint. [PDF]
12. Krieger's finite generator theorem for actions of countable groups ISubmitted. [PDF]
11. Borel structurability on the 2shift of a countable group (with Robin D. TuckerDrob)Annals of Pure and Applied Logic 167 (2016), no. 1, 121. [PDF]
10. Every action of a nonamenable group is the factor of a small actionJournal of Modern Dynamics 8 (2014), no. 2, 251270. [PDF]
9. Locally nilpotent groups and hyperfinite equivalence relations (with Scott Schneider)Submitted. [PDF]
8. Arbitrarily large residual finiteness growth (with Khalid BouRabee)To appear in Journal fur die reine und angewandte Mathematik (Crelle's Journal). [PDF]
7. Ergodic actions of countable groups and finite generating partitionsGroups, Geometry, and Dynamics 9 (2015), no. 3, 793810. [PDF]
6. Finite entropy actions of free groups, rigidity of stabilizers, and a HoweMoore type phenomenonJournal d'Analyse Mathematique 129 (2016), no. 1, 309340. [PDF]
5. A subgroup formula for finvariant entropyErgodic Theory and Dynamical Systems 34 (2014), no. 1, 263298. [PDF]
4. Group colorings and Bernoulli subflows (with Su Gao and Steve Jackson)Memoirs of the American Mathematical Society 241 (2016), no. 1141, 1241. [Preprint]
3. Generalizing Magnus' characterization of free groups to some free products (with Khalid BouRabee)Communications in Algebra 42 (2014), no. 9, 39503962. [PDF]
2. Burnside's problem, spanning trees, and tilingsGeometry & Topology 18 (2014), no. 1, 179210. [PDF]
1. A coloring property for countable groups (with Su Gao and Steve Jackson)Mathematical
Proceedings of the Cambridge Philosophical Society 147 (2009), no. 3, 579592. [PDF]
Abstracts
19. Krieger's finite generator theorem for actions of countable groups III (with A. Alpeev)
Preprint. [PDF]
18. Folner tilings for actions of amenable groups (with C. Conley, S. Jackson, D. Kerr, A. Marks, and R. TuckerDrob)We continue the study of Rokhlin entropy, an isomorphism invariant for p.m.p. actions of countable groups introduced in Part I. In this paper we prove a nonergodic finite generator theorem and use it to establish subadditivity and semicontinuity properties of Rokhlin entropy. We also obtain formulas for Rokhlin entropy in terms of ergodic decompositions and inverse limits. Finally, we clarify the relationship between Rokhlin entropy, sofic entropy, and classical KolmogorovSinai entropy. In particular, using Rokhlin entropy we give a new proof of the fact that ergodic actions with positive sofic entropy have finite stabilizers. Submitted. [PDF]
17. Hyperfiniteness and Borel combinatorics (with Clinton Conley, Steve Jackson, Andrew Marks, and Robin TuckerDrob)We show that every probabilitymeasurepreserving action of a countable amenable group G can be tiled, modulo a null set, using finitely many finite subsets of G ("shapes'') with prescribed approximate invariance so that the collection of tiling centers for each shape is Borel. This is a dynamical version of the DownarowiczHuczekZhang tiling theorem for countable amenable groups and strengthens the OrnsteinWeiss Rokhlin lemma. As an application we prove that, for every countably infinite amenable group G, the crossed product of a generic free minimal action of G on the Cantor set is Zstable. Submitted. [PDF]
16. Weak containment and Rokhlin entropyWe study the relationship between hyperfiniteness and problems in Borel graph combinatorics by adapting gametheoretic techniques introduced by Marks to the hyperfinite setting. We compute the possible Borel chromatic numbers and edge chromatic numbers of bounded degree acyclic hyperfinite Borel graphs and use this to answer a question of Kechris and Marks about the relationship between Borel chromatic number and measure chromatic number. We also show that for every d > 1 there is a dregular acyclic hyperfinite Borel bipartite graph with no Borel perfect matching. These techniques also give examples of hyperfinite bounded degree Borel graphs for which the Borel local lemma fails, in contrast to the recent results of Csoka, Grabowski, Mathe, Pikhurko, and Tyros. Related to the Borel Ruziewicz problem, we show there is a continuous paradoxical action of $(\Z/2\Z)^{*3}$ on a Polish space that admits a finitely additive invariant Borel probability measure, but admits no countably additive invariant Borel probability measure. In the context of studying ultrafilters on the quotient space of equivalence relations under AD, we also construct an ultrafilter U on the quotient of $E_0$ which has surprising complexity. In particular, Martin's measure is RudinKiesler reducible to U. We end with a problem about whether every hyperfinite bounded degree Borel graph has a witness to its hyperfiniteness which is uniformly bounded below in size. Preprint. [PDF]
15. Cost, l^2Betti numbers, and the sofic entropy of some algebraic actions (with Damien Gaboriau)We define a new notion of weak containment for joinings, and we show that this notion implies an inequality between relative Rokhlin entropies. This leads to new upper bounds to Rokhlin entropy. We also use this notion to study how Pinsker algebras behave under direct products, and we study the Rokhlin entropy of restricted actions of finiteindex subgroups. To appear in Journal d'Analyse Mathematique. [PDF]
14. Forcing constructions and countable Borel equivalence relations (with Su Gao, Steve Jackson, and Edward Krohne)In 1987, Ornstein and Weiss discovered that the Bernoulli 2shift over the rank two free group factors onto the seemingly larger Bernoulli 4shift. With the recent creation of an entropy theory for actions of sofic groups (in particular free groups), their example shows the surprising fact that entropy can increase under factor maps. In order to better understand this phenomenon, we study a natural generalization of the OrnsteinWeiss map for countable groups. We relate the increase in entropy to the cost and to the first l^2Betti number of the group. More generally, we study coboundary maps arising from simplicial actions and, under certain assumptions, relate l^2Betti numbers to the failure of the Juzvinskii addition formula. This work is built upon a study of entropy theory for algebraic actions. We prove that for actions on profinite groups via continuous group automorphisms, topological sofic entropy is equal to measure sofic entropy with respect to Haar measure whenever the homoclinic subgroup is dense. For algebraic actions of residually finite groups we find sufficient conditions for the sofic entropy to be equal to the supremum exponential growth rate of periodic points. Submitted. [PDF]
13. Krieger's finite generator theorem for actions of countable groups IIWe prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features. Preprint. [PDF]
12. Krieger's finite generator theorem for actions of countable groups IWe continue the study of Rokhlin entropy, an isomorphism invariant for ergodic p.m.p. actions of general countable groups introduced in the previous paper. We prove that every free ergodic action with finite Rokhlin entropy admits generating partitions which are almost Bernoulli, strengthening the theorem of AbertWeiss that all free actions weakly contain Bernoulli shifts. We then use this result to study the Rokhlin entropy of Bernoulli shifts. Under the assumption that every countable group admits a free ergodic action of positive Rokhlin entropy, we prove that: (i) the Rokhlin entropy of a Bernoulli shift is equal to the Shannon entropy of its base; (ii) Bernoulli shifts have completely positive Rokhlin entropy; and (iii) Gottschalk's surjunctivity conjecture and Kaplansky's direct finiteness conjecture are true. Submitted. [PDF]
11. Borel structurability on the 2shift of a countable group (with Robin D. TuckerDrob)For an ergodic p.m.p. action G \acts (X, \mu) of a countable group G, we define the Rokhlin entropy h_G^{Rok}(X, \mu) to be the infimum of the Shannon entropies of countable generating partitions. It is known that for free ergodic actions of amenable groups this notion coincides with classical KolmogorovSinai entropy. It is thus natural to view Rokhlin entropy as a close analogue to classical entropy. Under this analogy we prove that Krieger's finite generator theorem holds for all countably infinite groups. Specifically, if h_G^{Rok}(X, \mu) < log(k) then there exists a generating partition consisting of k sets. We actually obtain a notably stronger result which is new even in the case of actions by the integers. Our proofs are entirely selfcontained and do not rely on the original Krieger theorem. Annals of Pure and Applied Logic 167 (2016), no. 1, 121. [PDF]
10. Every action of a nonamenable group is the factor of a small actionWe show that for any infinite countable group G and for any free Borel action of G on X there exists an equivariant classbijective Borel map from X to the free part Free(2^G) of the 2shift 2^G. This implies that any Borel structurability which holds for the equivalence relation generated by G acting on Free(2^G) must hold a fortiori for all equivalence relations coming from free Borel actions of G. A related consequence is that the Borel chromatic number of Free(2^G) is the maximum among Borel chromatic numbers of free actions of G. This answers a question of Marks. Our construction is flexible and, using an appropriate notion of genericity, we are able to show that in fact the generic Gequivariant map to 2^G lands in the free part. As a corollary we obtain that for every \epsilon > 0, every free p.m.p. action of G has a free factor which admits a 2piece generating partition with Shannon entropy less than \epsilon. This generalizes a result of Danilenko and Park. Journal of Modern Dynamics 8 (2014), no. 2, 251270. [PDF]
9. Locally nilpotent groups and hyperfinite equivalence relations (with Scott Schneider)It is well known that if G is a countable amenable group and G \acts (Y, \nu) factors onto G \acts (X, \mu), then the entropy of the first action must be greater than or equal to the entropy of the second action. In particular, if G \acts (X, \mu) has infinite entropy, then the action G \acts (Y, \nu) does not admit any finite generating partition. On the other hand, we prove that if G is a countable nonamenable group then there exists a finite integer n with the following property: for every probabilitymeasurepreserving action G \acts (X, \mu) there is a Ginvariant probability measure \nu on n^G such that G \acts (n^G, \nu) factors onto G \acts (X, \mu). For many nonamenable groups, n can be chosen to be 4 or smaller. We also obtain a similar result with respect to continuous actions on compact spaces and continuous factor maps. Submitted. [PDF]
8. Arbitrarily large residual finiteness growth (with Khalid BouRabee)A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a positive answer when the acting group is locally nilpotent. This extends previous results obtained by GaoJackson for abelian groups and by JacksonKechrisLouveau for finitely generated nilpotentbyfinite groups. Our proof is based on a mixture of coarse geometric properties of locally nilpotent groups together with an adaptation of the GaoJackson machinery. To appear in Journal fur die reine und angewandte Mathematik (Crelle's Journal). [PDF]
7. Ergodic actions of countable groups and finite generating partitionsThe residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship between residual finiteness growth and some decision problems in groups, which we apply to our new groups. Groups, Geometry, and Dynamics 9 (2015), no. 3, 793810. [PDF]
6. Finite entropy actions of free groups, rigidity of stabilizers, and a HoweMoore type phenomenonWe prove the following finite generator theorem. Let G be a countable group acting ergodically on a standard probability space. Suppose this action admits a generating partition having finite Shannon entropy. Then the action admits a finite generating partition. We also discuss relationships between generating partitions and finvariant and sofic entropies. Journal d'Analyse Mathematique 129 (2016), no. 1, 309340. [PDF]
5. A subgroup formula for finvariant entropyWe study a notion of entropy for probability measure preserving actions of finitely generated free groups, called finvariant entropy, introduced by Lewis Bowen. In the degenerate case, the finvariant entropy is negative infinity. In this paper we investigate the qualitative consequences of having finite finvariant entropy. We find three main properties of such actions. First, the stabilizers occurring in factors of such actions are highly restricted. Specifically, the stabilizer of almost every point must be either trivial or of finite index. Second, such actions are very chaotic in the sense that, when the space is not essentially countable, every nonidentity group element acts with infinite KolmogorovSinai entropy. Finally, we show that such actions display behavior reminiscent of the HoweMoore property. Specifically, if the action is ergodic then there is an integer n such that for every nontrivial normal subgroup K the number of Kergodic components is at most n. Our results are based on a new formula for finvariant entropy. Ergodic Theory and Dynamical Systems 34 (2014), no. 1, 263298. [PDF]
4. Group colorings and Bernoulli subflows (with Su Gao and Steve Jackson)We study a measure entropy for finitely generated free group actions called finvariant entropy. The finvariant entropy was developed by Lewis Bowen and is essentially a special case of his measure entropy theory for actions of sofic groups. In this paper we relate the finvariant entropy of a finitely generated free group action to the finvariant entropy of the restricted action of a subgroup. We show that the ratio of these entropies equals the index of the subgroup. This generalizes a well known formula for the KolmogorovSinai entropy of amenable group actions. We then extend the definition of finvariant entropy to actions of finitely generated virtually free groups. We also obtain a numerical virtual measure conjugacy invariant for actions of finitely generated virtually free groups. Memoirs of the American Mathematical Society 241 (2016), no. 1141, 1241. [Preprint]
3. Generalizing Magnus' characterization of free groups to some free products (with Khalid BouRabee)In this paper we study the dynamics of Bernoulli flows and their subflows over general countable groups from the symbolic and topological perspectives. We study free subflows (subflows in which every point has trivial stabilizer), minimal subflows, disjointness of subflows, the problem of classifying subflows up to topological conjugacy, and the differences in dynamical behavior between pairs of points which disagree on finitely many coordinates. We call a point hyper aperiodic if the closure of its orbit is a free subflow and we call it minimal if the closure of its orbit is a minimal subflow. We prove that the set of all (minimal) hyper aperiodic points is always dense but also meager and null. By employing notions and ideas from descriptive set theory, we study the complexity of the sets of hyper aperiodic points and of minimal points and completely determine their descriptive complexity. In doing this we introduce a new notion of countable flecc groups and study their properties. We obtain a dichotomy for the complexity of classifying free subflows up to topological conjugacy. For locally finite groups the topological conjugacy relation for all (free) subflows is hyperfinite and nonsmooth. For nonlocally finite groups the relation is Borel bireducible with the universal countable Borel equivalence relation. A primary focus of the paper is to develop constructive methods for the notions studied. To construct hyper aperiodic points, a fundamental method of construction of multilayer marker structures is developed with great generality. Variations of the fundamental method are used in many proofs in the paper, and we expect them to be useful more broadly in geometric group theory. As a special case of such marker structures, we study the notion of ccc groups and prove the cccness for countable nilpotent, polycyclic, residually finite, locally finite groups and for free products. Communications in Algebra 42 (2014), no. 9, 39503962. [PDF]
2. Burnside's problem, spanning trees, and tilingsA residually nilpotent group is kparafree if all of its lower central series quotients match those of a free group of rank k. Magnus proved that kparafree groups of rank k are themselves free. In this note we mimic this theory with finite extensions of free groups, with an emphasis on free products of the cyclic group C_p, for p an odd prime. We show that for n \leq p Magnus' characterization holds for the nfold free product C_p^{*n} within the class of finiteextensions of free groups. Specifically, if n \leq p and G is a finitely generated, virtually free, residually nilpotent group having the same lower central series quotients as C_p^{*n}, then G \cong C_p^{*n}. We also show that such a characterization does not hold in the class of finitely generated groups. That is, we construct a rank 2 residually nilpotent group G that shares all its lower central series quotients with C_p * C_p, but is not C_p * C_p. Geometry & Topology 18 (2014), no. 1, 179210. [PDF]
1. A coloring property for countable groups (with Su Gao and Steve Jackson)In this paper we study geometric versions of Burnside's Problem and the von Neumann Conjecture. This is done by considering the notion of a translationlike action. Translationlike actions were introduced by Kevin Whyte as a geometric analogue of subgroup containment. Whyte proved a geometric version of the von Neumann Conjecture by showing that a finitely generated group is nonamenable if and only if it admits a translationlike action by any (equivalently every) nonabelian free group. We strengthen Whyte's result by proving that this translationlike action can be chosen to be transitive when the acting free group is finitely generated. We furthermore prove that the geometric version of Burnside's Problem holds true. That is, every finitely generated infinite group admits a translationlike action by Z. This answers a question posed by Whyte. In pursuit of these results we discover an interesting property of Cayley graphs: every finitely generated infinite group G has some Cayley graph having a regular spanning tree. This regular spanning tree can be chosen to have degree 2 (and hence be a biinfinite Hamiltonian path) if and only if G has finitely many ends, and it can be chosen to have any degree greater than 2 if and only if G is nonamenable. We use this last result to then study tilings of groups. We define a general notion of polytilings and extend the notion of MT groups and ccc groups to the setting of polytilings. We prove that every countable group is polyMT and every finitely generated group is polyccc. Mathematical
Proceedings of the Cambridge Philosophical Society 147 (2009), no. 3, 579592. [PDF]
Motivated by research on hyperfinite equivalence relations we define a coloring property for countable groups. We prove that every countable group has the coloring property. This implies a compactness theorem for closed complete sections of the free part of the shift action of G on 2^G. Our theorems generalize known results about Z. Webpage updated March. 2017
