Related papers: A trace formula for the forcing relation of braids
In this article, we develop an arithmetic analogue of Fourier--Jacobi period integrals for a pair of unitary groups of equal rank. We construct the so-called Fourier--Jacobi cycles, which are algebraic cycles on the product of unitary…
We give a proof of a formula for the trace of self-braidings (in an arbitrary channel) in UMTCs which first appeared in the context of rational conformal field theories (CFTs). The trace is another invariant for UMTCs which depends only on…
We prove that the so-called t algebra of braids and ties supports a Markov trace. Further, by using this trace in the Jones' recipe, we define invariant polynomials for classical knots and singular knots. Our invariants have three…
A simple recurrence relation for the even order moments of the Fabius function is proven. Also, a very similar formula for the odd order moments in terms of the even order moments is proved. The matrices corresponding to these formulas (and…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
We continue a previous paper to show that Mel'nikov's first order formula for part of the separatrix splitting of a pendulum under fast quasi periodic forcing holds, in special examples, as an asymptotic formula in the forcing rapidity.
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
In these notes, we present versions of trace theorems for Sobolev spaces over an interval in the real line, and also a one-dimensional version of the well-known Poincare inequality.
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
In this paper, we extend the class of admissible functions for the trace formula of the second order in the self-adjoint, unitary, and contraction cases for a perturbation in the Hilbert-Schmidt class $\mathcal{S}^2(\mathcal{H})$ by…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…
A Stick graph G=(A\cup B, E) is the intersection graph of a set A of horizontal segments and a set B of vertical segments in the plane, whose left and respectively bottom endpoints lie on the same ground line with slope -1. These endpoints…
Koplienko \cite{Ko} found a trace formula for perturbations of self-adjoint operators by operators of Hilbert-Schmidt class $\mathcal{B}_2(\mathcal{H})$. Later, Neidhardt introduced a similar formula in the case of pair of unitaries…
We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…
We introduce framed versions of the $L$-moves and prove a one move theorem for the extension of the Markov theorem for framed braids. We further introduce framed versions of the Hilden and Pure Hilden groups, we give presentations and we…
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete…
We generalise the formula expressing the matrix trace of a given square matrix as the integral of the numerical values of $A$ over the Euclidean sphere to the unit spheres of finite-dimensional normed spaces that have a 1-symmetric basis.…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…
We present weighted Sobolev spaces and prove a trace theorem for the spaces. As an application, we discuss non-zero boundary value problems for parabolic equations. The weighted parabolic Sobolev spaces we consider are designed, in…