Related papers: Simple Braids Tend toward Positive Entropy
We study smooth actions by lattices in higher-rank simple Lie groups. Assuming one element of the action acts with positive topological entropy, we prove a number of new rigidity results. For lattices in $\mathrm{SL}(n,\mathbb{R})$ acting…
Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with…
Recently, a race towards the simplification of deep networks has begun, showing that it is effectively possible to reduce the size of these models with minimal or no performance loss. However, there is a general lack in understanding why…
It is shown that particles with braid group statistics (Plektons) in three-dimensional space-time cannot be free, in a quite elementary sense: They must exhibit elastic two-particle scattering into every solid angle, and at every energy.…
In this paper, we consider two properties on the braid index of a two-bridge knot. We prove an inequality on the braid indices of two-bridge knots if there exists an epimorphism between their knot groups. Moreover, we provide the average…
Clique complexes of Erd\H{o}s-R\'{e}nyi random graphs with edge probability between $n^{-{1\over 3}}$ and $n^{-{1\over 2}}$ are shown to be aas not simply connected. This entails showing that a connected two dimensional simplicial complex…
We study finite skew braces whose multiplicative group is characteristically simple, namely of the form \(S^n\) for a finite simple group \(S\). Motivated by the strong rigidity phenomena known for skew braces with simple or quasisimple…
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
A simple topological graph T = (V(T), E(T)) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…
We classify braided tensor categories over C of exponential growth which are quasisymmetric, i.e., the squared braiding is the identity on the product of any two simple objects. This generalizes the classification results of Deligne on…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…
This article deals with topological assumptions under which the minimal volume entropy of a closed manifold, and more generally of a finite simplicial complex, vanishes or is positive. In the first part of the article, we present…
Simplicial homology manifolds are proposed as an interesting class of geometric objects, more general than topological manifolds but still quite tractable, in which questions about the microstructure of space-time can be naturally…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
Strongly quasipositive links are those links which can be seen as closures of positive braids in terms of band generators. In this paper we give a necessary condition for a link with braid index 3 to be strongly quasipositive, by proving…
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…
In this note we give examples of Hamiltonian diffeomorphisms which are on one hand dynamically complicated, for instance with positive topological entropy, and on the other hand minimal from the perspective of Floer theory. The minimality…
The Kontsevich integral $Z$ associates to each braid $b$ (or more generally knot $k$) invariants $Z_i(b)$ lying in finite dimensional vector spaces, for $i = 0, 1, 2, ...$. These values are not yet known, except in special cases. The…