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.


This content will become publicly available on September 1, 2026

Title: New examples of topologically slice links
In 2007, Cochran–Friedl–Teichner gave sufficient conditions for when a link obtained by multi-infection is topologically slice involving a Milnor’s invariant condition on the infecting string link. In this paper, we give a different Milnor’s invariant condition which can handle some cases which the original theorem cannot. Along the way, we also give sufficient conditions for a multi-infection to be [Formula: see text]-solvable, where we require that the infecting string link have vanishing pairwise linking numbers, which can be seen as handling an additional “[Formula: see text]-solvable” case of a well-known result about the relationship between satellite operations and the solvable filtration of Cochran–Orr–Teichner.  more » « less
Award ID(s):
1745670 2109308 2139109
PAR ID:
10647321
Author(s) / Creator(s):
Publisher / Repository:
World Scientific
Date Published:
Journal Name:
Journal of Knot Theory and Its Ramifications
Volume:
34
Issue:
10
ISSN:
0218-2165
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We give examples of (i) a simple theory with a formula (with parameters) which does not fork over [Formula: see text] but has [Formula: see text]-measure 0 for every automorphism invariant Keisler measure [Formula: see text] and (ii) a definable group [Formula: see text] in a simple theory such that [Formula: see text] is not definably amenable, i.e. there is no translation invariant Keisler measure on [Formula: see text]. We also discuss paradoxical decompositions both in the setting of discrete groups and of definable groups, and prove some positive results about small theories, including the definable amenability of definable groups. 
    more » « less
  2. [Formula: see text]A hyperbolic code is an evaluation code that improves a Reed–Muller code because the dimension increases while the minimum distance is not penalized. We give necessary and sufficient conditions, based on the basic parameters of the Reed–Muller code, to determine whether a Reed–Muller code coincides with a hyperbolic code. Given a hyperbolic code [Formula: see text], we find the largest Reed–Muller code contained in [Formula: see text] and the smallest Reed–Muller code containing [Formula: see text]. We then prove that similar to Reed–Muller and affine Cartesian codes, the [Formula: see text]th generalized Hamming weight and the [Formula: see text]th footprint of the hyperbolic code coincide. Unlike for Reed–Muller and affine Cartesian codes, determining the [Formula: see text]th footprint of a hyperbolic code is still an open problem. We give upper and lower bounds for the [Formula: see text]th footprint of a hyperbolic code that, sometimes, are sharp. 
    more » « less
  3. This paper is a sequel to [Monatsh. Math. 194 (2021) 523–554] in which results of that paper are generalized so that they hold in the setting of inhomogeneous Diophantine approximation. Given any integers [Formula: see text] and [Formula: see text], any [Formula: see text], and any homogeneous function [Formula: see text] that satisfies a certain nonsingularity assumption, we obtain a biconditional criterion on the approximating function [Formula: see text] for a generic element [Formula: see text] in the [Formula: see text]-orbit of [Formula: see text] to be (respectively, not to be) [Formula: see text]-approximable at [Formula: see text]: that is, for there to exist infinitely many (respectively, only finitely many) [Formula: see text] such that [Formula: see text] for each [Formula: see text]. In this setting, we also obtain a sufficient condition for uniform approximation. We also consider some examples of [Formula: see text] that do not satisfy our nonsingularity assumptions and prove similar results for these examples. Moreover, one can replace [Formula: see text] above by any closed subgroup of [Formula: see text] that satisfies certain integrability axioms (being of Siegel and Rogers type) introduced by the authors in the aforementioned previous paper. 
    more » « less
  4. A braided fusion category is said to have Property F if the associated braid group representations factor through a finite group. We verify integral metaplectic modular categories have property F by showing these categories are group-theoretical. For the special case of integral categories [Formula: see text] with the fusion rules of [Formula: see text] we determine the finite group [Formula: see text] for which [Formula: see text] is braided equivalent to [Formula: see text]. In addition, we determine the associated classical link invariant, an evaluation of the 2-variable Kauffman polynomial at a point. 
    more » « less
  5. A rational projective plane ([Formula: see text]) is a simply connected, smooth, closed manifold [Formula: see text] such that [Formula: see text]. An open problem is to classify the dimensions at which such a manifold exists. The Barge–Sullivan rational surgery realization theorem provides necessary and sufficient conditions that include the Hattori–Stong integrality conditions on the Pontryagin numbers. In this paper, we simplify these conditions and combine them with the signature equation to give a single quadratic residue equation that determines whether a given dimension supports a [Formula: see text]. We then confirm the existence of a [Formula: see text] in two new dimensions and prove several non-existence results using factorization of the numerators of the divided Bernoulli numbers. We also resolve the existence question in the Spin case, and we discuss existence results for the more general class of rational projective spaces. 
    more » « less