skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Harmonic models and Bernoullicity
We give many examples of algebraic actions which are factors of Bernoulli shifts. These include certain harmonic models over left-orderable groups of large enough growth, as well as algebraic actions associated to certain lopsided elements in any left-orderable group. For many of our examples, the acting group is amenable so these actions are Bernoulli (and not just a factor of a Bernoulli), but there is no obvious Bernoulli partition.  more » « less
Award ID(s):
2000105
PAR ID:
10329263
Author(s) / Creator(s):
Date Published:
Journal Name:
Compositio Mathematica
Volume:
157
Issue:
10
ISSN:
0010-437X
Page Range / eLocation ID:
2160 to 2198
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Transactions of the American Mathematical Society)
    We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well-known examples from combinatorial group theory, combined with the Baire category theorem, we obtain a plethora of results demonstrating that several phenomena in group theory are generic. In effect, we provide a new topological framework for the analysis of various well known problems in group theory. We also provide a connection between genericity in these spaces, the word problem for finitely generated groups and model-theoretic forcing. Using these connections, we investigate a natural question raised by Osin: when does a certain space of enumerated groups contain a comeager isomorphism class? We obtain a sufficient condition that allows us to answer Osin’s question in the negative for the space of all enumerated groups and the space of left orderable enumerated groups. We document several open questions in connection with these considerations. 
    more » « less
  2. ; (, Journal of the London Mathematical Society)
    Abstract We develop new tools to analyze the complexity of the conjugacy equivalence relation , whenever is a left‐orderable group. Our methods are used to demonstrate nonsmoothness of for certain groups of dynamical origin, such as certain amalgams constructed from Thompson's group . We also initiate a systematic analysis of , where is a 3‐manifold. We prove that if is not prime, then is a universal countable Borel equivalence relation, and show that in certain cases the complexity of is bounded below by the complexity of the conjugacy equivalence relation arising from the fundamental group of each of the JSJ pieces of . We also prove that if is the complement of a nontrivial knot in then is not smooth, and show how determining smoothness of for all knot manifolds is related to the L‐space conjecture. 
    more » « less
  3. (, Journal of Knot Theory and Its Ramifications)
    In this paper, we study the Riley polynomial of double twist knots with higher genus. Using the root of the Riley polynomial, we compute the range of rational slope [Formula: see text] such that [Formula: see text]-filling of the knot complement has left-orderable fundamental group. Further more, we make a conjecture about left-orderable surgery slopes of two-bridge knots. 
    more » « less
  4. ; ; ; ; ; (, Proceedings of the Computational Complexity Conference (CCC) 2020)
    We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of SLn(C)-representations. We provide simple examples that disprove this conjecture (under standard complexity assumptions). We develop a general framework, denoted algebraic circuit search problems, that captures many important problems in algebraic complexity and computational invariant theory. This framework encompasses various proof systems in proof complexity and some of the central problems in invariant theory as exposed by the Geometric Complexity Theory (GCT) program, including the aforementioned problem of computing succinct encodings for generators for invariant rings. 
    more » « less
  5. ; ; ; ; ; (, Computational Complexity Conference (CCC) 2020)
    We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of SL_n(C)-representations. We provide simple examples that disprove this conjecture (under standard complexity assumptions). We develop a general framework, denoted algebraic circuit search problems, that captures many important problems in algebraic complexity and computational invariant theory. This framework encompasses various proof systems in proof complexity and some of the central problems in invariant theory as exposed by the Geometric Complexity Theory (GCT) program, including the aforementioned problem of computing succinct encodings for generators for invariant rings. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email