Related papers: A trace formula for the forcing relation of braids
Twisted knot theory, introduced by M.O. Bourgoin, is a generalization of virtual knot theory. It naturally yields the notion of a twisted braid, which is closely related to the notion of a virtual braid due to Kauffman. In this paper, we…
The Decoration Conjecture describes the structure of the set of braid types of Smale's horseshoe map ordered by forcing, providing information about the order in which periodic orbits can appear when a horseshoe is created. A proof of this…
A first order trace formula is obtained for a regular differential operator perturbed by a finite signed measure multiplication operator.
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
The local trace formula gives strong relations between two types of invariant distributions on a reductive group defined over a local field: orbital integrals and characters of representations. For connected reductive groups, the formula…
We comment on the set of visible points of a lattice and its Fourier transform, thus continuing and generalizing previous work by Schroeder and Mosseri. A closed formula in terms of Dirichlet series is obtained for the Bragg part of the…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
A first order trace formula is obtained for a higher-order differential operator on a segment in the case where the perturbation is an operator of multiplication by a finite complex-valued measure. For the operators of even order $n\ge4$ a…
We consider self-adjoint fourth order operators on the unit interval with the Dirichlet type boundary conditions. For such operators we determine few trace formulas, similar to the case of Gelfand--Levitan formulas for second order…
This paper presents some relations for orthonormal bases in the Minkowski space and isotropic tetrads constructed from the vectors of these bases. As an example of an application of the obtained formulae, in particular recursion relations,…
An extension of the Artin Braid Group with new operators that generate double and triple intersections is considered. The extended Alexander theorem, relating intersecting closed braids and intersecting knots is proved for double and triple…
Properties of relative traces and symmetrizing forms on chains of cyclotomic and affine Hecke algebras are studied. The study relies on a use of bases of these algebras which generalize a normal form for elements of the complex reflection…
We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…
Empirical properties of generating systems for complex reflection groups and their braid groups have been observed by Orlik-Solomon and Brou\'e-Malle-Rouquier, using Shephard-Todd classification. We give a general existence result for…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
We describe Artin's braid group on a (fixed) finite number of strings as a crossed module over itself. In particular, we interpret the braid relations as crossed module structure relations.
A natural generalization of Krein's theorem to a pair of commuting tuples $\left(H_1^0,H_2^0\right)$ and $\left(H_1,H_2\right)$ of bounded self-adjoint operators in a separable Hilbert space $\mathcal{H}$ with $H_j-H_j^0 = V_j\in…
We consider the problem of data race prediction where the program's behavior is represented by a trace. A trace is a sequence of program events recorded during the execution of the program. We employ the schedulable happens-before relation…
Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…