Abstract We study versions of the tree pigeonhole principle,$$\mathsf {TT}^1$$, in the context of Weihrauch-style computable analysis. The principle has previously been the subject of extensive research in reverse mathematics, an outstanding question of which investigation is whether$$\mathsf {TT}^1$$is$$\Pi ^1_1$$-conservative over the ordinary pigeonhole principle,$$\mathsf {RT}^1$$. Using the recently introduced notion of the first-order part of an instance-solution problem, we formulate the analog of this question for Weihrauch reducibility, and give an affirmative answer. In combination with other results, we use this to show that unlike$$\mathsf {RT}^1$$, the problem$$\mathsf {TT}^1$$is not Weihrauch requivalent to any first-order problem. Our proofs develop new combinatorial machinery for constructing and understanding solutions to instances of$$\mathsf {TT}^1$$. 
                        more » 
                        « less   
                    
                            
                            THE UNIVERSAL THEORY OF THE HYPERFINITE II$_1$ FACTOR IS NOT COMPUTABLE
                        
                    
    
            Abstract We show that the universal theory of the hyperfinite II$$_1$$factor is not computable. The proof uses the recent result that MIP*=RE. Combined with an earlier observation of the authors, this yields a proof that the Connes Embedding Problem has a negative solution that avoids the equivalences with Kirchberg’s QWEP Conjecture and Tsirelson’s Problem. 
        more » 
        « less   
        
    
                            - Award ID(s):
- 2054477
- PAR ID:
- 10592393
- Publisher / Repository:
- Cambridge University Press
- Date Published:
- Journal Name:
- The Bulletin of Symbolic Logic
- Volume:
- 30
- Issue:
- 2
- ISSN:
- 1079-8986
- Page Range / eLocation ID:
- 181 to 198
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            Abstract A$$(p,q)$$-colouring of a graph$$G$$is an edge-colouring of$$G$$which assigns at least$$q$$colours to each$$p$$-clique. The problem of determining the minimum number of colours,$$f(n,p,q)$$, needed to give a$$(p,q)$$-colouring of the complete graph$$K_n$$is a natural generalization of the well-known problem of identifying the diagonal Ramsey numbers$$r_k(p)$$. The best-known general upper bound on$$f(n,p,q)$$was given by Erdős and Gyárfás in 1997 using a probabilistic argument. Since then, improved bounds in the cases where$$p=q$$have been obtained only for$$p\in \{4,5\}$$, each of which was proved by giving a deterministic construction which combined a$$(p,p-1)$$-colouring using few colours with an algebraic colouring. In this paper, we provide a framework for proving new upper bounds on$$f(n,p,p)$$in the style of these earlier constructions. We characterize all colourings of$$p$$-cliques with$$p-1$$colours which can appear in our modified version of the$$(p,p-1)$$-colouring of Conlon, Fox, Lee, and Sudakov. This allows us to greatly reduce the amount of case-checking required in identifying$$(p,p)$$-colourings, which would otherwise make this problem intractable for large values of$$p$$. In addition, we generalize our algebraic colouring from the$$p=5$$setting and use this to give improved upper bounds on$$f(n,6,6)$$and$$f(n,8,8)$$.more » « less
- 
            Abstract In this study, the solution of the Neumann problem associated with the CR Yamabe operator on a subset \Omegaof the CR manifold {{\mathbb{S}}}^{3}bounded by the Clifford torus \Sigmais discussed. The Yamabe-type problem of finding a contact form on \Omegawhich has zero Tanaka-Webster scalar curvature and for which \Sigmahas a constant p-mean curvature is also discussed.more » « less
- 
            Abstract We consider manifold-knot pairs$$(Y,K)$$, whereYis a homology 3-sphere that bounds a homology 4-ball. We show that the minimum genus of a PL surface$$\Sigma $$in a homology ballX, such that$$\partial (X, \Sigma ) = (Y, K)$$can be arbitrarily large. Equivalently, the minimum genus of a surface cobordism in a homology cobordism from$$(Y, K)$$to any knot in$$S^3$$can be arbitrarily large. The proof relies on Heegaard Floer homology.more » « less
- 
            Abstract We prove novel asymptotic freeness results in tracial ultraproduct von Neumann algebras. In particular, we show that whenever$$M = M_1 \ast M_2$$is a tracial free product von Neumann algebra and$$u_1 \in \mathscr U(M_1)$$,$$u_2 \in \mathscr U(M_2)$$are Haar unitaries, the relative commutants$$\{u_1\}' \cap M^{\mathcal U}$$and$$\{u_2\}' \cap M^{\mathcal U}$$are freely independent in the ultraproduct$$M^{\mathcal U}$$. Our proof relies on Mei–Ricard’s results [MR16] regarding$$\operatorname {L}^p$$-boundedness (for all$$1 < p < +\infty $$) of certain Fourier multipliers in tracial amalgamated free products von Neumann algebras. We derive two applications. Firstly, we obtain a general absorption result in tracial amalgamated free products that recovers several previous maximal amenability/Gamma absorption results. Secondly, we prove a new lifting theorem which we combine with our asymptotic freeness results and Chifan–Ioana–Kunnawalkam Elayavalli’s recent construction [CIKE22] to provide the first example of a$$\mathrm {II_1}$$factor that does not have property Gamma and is not elementary equivalent to any free product of diffuse tracial von Neumann algebras.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    