Related papers: A trace formula for the forcing relation of braids
In this paper, we focus our attention on the connections between the braid group and the Nielsen fixed point theory. A new forcing relation between braids is introduced, and shown that it can be fulfilled by using Nielsen fixed point…
Global results are proved about the way in which Boyland's forcing partial order organizes a set of braid types: those of periodic orbits of Smale's horseshoe map for which the associated train track is a star. This is a special case of a…
Specification languages are essential in deductive program verification, but they are usually based on first-order logic, hence less expressive than the programs they specify. Recently, trace specification logics with fixed points that are…
The aim of this article is twofold: give a short proof of the existence of real spectral shift function and the associated trace formula for a pair of contractions, the difference of which is trace-class and one of the two a strict…
We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.
Sharkovsky's ordering describes orbit forcing of interval maps, and generalizations of Sharkovsky's ordering exist for maps of trees. In this paper I will describe Sharkovsky's ordering and analogous orderings for trees, and their…
Let $f$ be an orientation-preserving homeomorphism of the 2-disc $\mathbb{D}^2$ that fixes the boundary pointwise and leaves invariant a finite subset in the interior of $\mathbb{D}^2$. We study the strong Nielsen equivalence of periodic…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
The notion of forcing sets for perfect matchings was introduced by Harary, Klein, and \v{Z}ivkovi\'{c}. The application of this problem in chemistry, as well as its interesting theoretical aspects, made this subject very active. In this…
An important problem in the dynamics of surface homeomorphisms is determining the forcing relation between orbits. The forcing relation between periodic orbits can be computed using standard algorithms, though this does not give much…
Convex neural codes are subsets of the Boolean lattice that record the intersection patterns of convex sets in Euclidean space. Much work in recent years has focused on finding combinatorial criteria on codes that can be used to classify…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
The influence of a temporal forcing on the pattern formation in Langmuir-Blodgett transfer is studied employing a generalized Cahn-Hilliard model. The occurring frequency locking effects allow for controlling the pattern formation process.…
Computing polynomial invariants for knots and links using braid representations relies heavily on finding the trace of Hecke algebra elements. There is no easy method known for computing the trace and hence it becomes difficult to compute…
A relation between the dilatation of pseudo-Anosov braids and fixed point theory was studied by Ivanov. In this paper we reveal a new relationship between the above two subjects by showing a formula for the dilatation of pseudo-Anosov…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
Li-York theorem tells us that a period 3 orbit for a continuous map of the interval into itself implies the existence of a periodic orbit of every period. This paper concerns an analogue of the theorem for homeomorphisms of the…
In previous papers, the author realized the following principle for many knot theories: if a knot diagram is complicated enough then it reproduces itself, i.e., is a subdiagram of any other diagram equivalent to it. This principle is…
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…
We study the scattering problem for the Schr\"odinger equation on the half-line with Robin boundary condition at the origin. We derive an expression for the trace of the difference of the perturbed and unperturbed resolvent in terms of a…