Related papers: A trace formula for the forcing relation of braids
Among the orbit patterns that force only eventually fixed trajectories, we completely describe the forcing relation, by answering the question: which orbit patterns force which others?
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
We classify Nichols algebras of irreducible Yetter-Drinfeld modules over groups such that the underlying rack is braided and the homogeneous component of degree three of the Nichols algebra satisfies a given inequality. This assumption…
Yu. I. Merzljakov developed a method of splittable coordinates which helps to verify the linearity of some groups, he established some fundamental results using this method. In this paper we use the method of splittable coordinates and find…
This is the second of a series of three papers where we prove the Gan--Gross--Prasad conjecture for Fourier--Jacobi periods on unitary groups and an Ichino--Ikeda type refinement. Our strategy is based on the comparison of relative trace…
Path algebras are a convenient way of describing decompositions of tensor powers of an object in a tensor category. If the category is braided, one obtains representations of the braid groups $B_n$ for all $n\in \N$. We say that such…
Bernardi has given a general formula for the number of regions of a deformation of the braid arrangement as a signed sum over boxed trees. We prove that each set of boxed trees which share an underlying (rooted labeled plane) tree…
We investigate trace formulas for Jacobi operators which are trace class perturbations of quasi-periodic finite-gap operators using Krein's spectral shift theory. In particular we establish the conserved quantities for the solutions of the…
With any even Hecke symmetry R (that is a Hecke type solution of the Yang-Baxter equation) we associate a quasitensor category. We formulate a condition on R implying that the constructed category is rigid and its commutativity isomorphisms…
We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semantics of program locations and captures loop semantics by…
In this paper, we propose computational approaches for the zero forcing problem, the connected zero forcing problem, and the problem of forcing a graph within a specified number of timesteps. Our approaches are based on a combination of…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
We introduce an appropriate notion of trace in the setting of quaternionic linear operators, arising from the well-known companion matrices. We then use this notion to define the quaternionic Fredholm determinant of trace-class operators in…
We establish counting formulas and bijections for deformations of the braid arrangement. Precisely, we consider real hyperplane arrangements such that all the hyperplanes are of the form $x\_i-x\_j=s$ for some integer $s$. Classical…
To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
We obtain a simple formula for the first-order trace of a regular differential operator on a segment perturbated by a multiplication operator. The main analytic ingredient of the proof is an improvement of the Tamarkin equiconvergence…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
We re express the fermion's probability amplitude as a trace over spinor indices, which formulation surprisingly does not exist in literature. This formulation puts the probabilty amplitude and the the probabilty(squared amplitude) of a…