Related papers: A trace formula for the forcing relation of braids
Formalisms based on temporal logics interpreted over finite strict linear orders, known in the literature as finite traces, have been used for temporal specification in automated planning, process modelling, (runtime) verification and…
Braid theory is used to calcualte the topological entropy of data from the belousov-Zhabotinskii reaction, the results agree well with one-dimensional theory to the order of approximation considered.
We study the distribution of arithmetic invariants associated to Alexander polynomials for certain infinite families of links. The families of links we consider arise from braids on a fixed number of strings. We explore analogies with…
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…
We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties,…
The (disjoint) fort number and fractional zero forcing number are introduced and related to existing parameters including the (standard) zero forcing number. The fort hypergraph is introduced and hypergraph results on transversals and…
The main result of this paper is a description of the space of functions on the unit circle, for which Krein's trace formula holds for arbitrary pairs of unitary operators with trace class difference. This space coincides with the space of…
We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…
A powerful way to study groups is via their actions on suitable spaces. Classifying spaces for families of subgroups are a type of these spaces, obtained by imposing some strict conditions on the fixed-point sets. We show how in the…
A transverse knot is a knot that is transverse to the planes of the standard contact structure on real 3-space. In this paper we prove the Markov Theorem for transverse braids, which states that two transverse closed braids that are…
It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…
The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
Our goal is to extend the theory of the spectral shift function to the case where only the difference of some powers of the resolvents of self-adjoint operators belongs to the trace class. As an example, we consider a couple of Dirac…
The so-called type problem or forcing problem is considered as a way to generalize Sharkovskii's theorem. In this paper, by focusing on certain types of orbits, we obtain a solution of the type problem, which gives a refinement of…
We present a formula for the trace of any symmetric power of a $n\times n$ matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and…
In this paper we introduce a Jones-type invariant for singular knots, using a Markov trace on the Yokonuma--Hecke algebras ${\rm Y}_{d,n}(u)$ and the theory of singular braids. The Yokonuma--Hecke algebras have a natural topological…
Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying concept behind all these orders has been shown: they can be described by a…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
Ramsey theory and forcing have a symbiotic relationship. At the RIMS Symposium on Infinite Combinatorics and Forcing Theory in 2016, the author gave three tutorials on Ramsey theory in forcing. The first two tutorials concentrated on…