相关论文: A trace formula for the forcing relation of braids
We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…
Using a super scalar field representation of the chiral vertex operators we develop a general method of calculating braiding matrices for all types of N=1 super-conformal 4-point blocks involving Ramond external weights. We give explicit…
We construct a map from knots to (abstract) 2-knots which can be extended to higher dimensions; this map is the natural "knot" counterpart for "braid" theory of groups $G_{n}^{k}$.
In this paper, we study the right regular representation of a finite group $G$ on the vector space consisting of vector valued functions on $\Gamma\backslash G$ with a subgroup $\Gamma$ of $G$ and give a trace formula using the work of…
To an oriented link in a solid torus we associate a trace graph in a thickened torus in such a way that links are isotopic if and only if their trace graphs can be related by moves of finitely many standard types. The key ingredient is a…
We establish a Sharkovskii-type theorem for a class of discrete random dynamical systems via the random Conley index. Using the continuation property of the Conley index, we extend classical forcing results to random systems obtained from…
In the present paper, we build up trace formulas for both the linear Hamiltonian systems and Sturm-Liouville systems. The formula connects the monodromy matrix of a symmetric periodic orbit with the infinite sum of eigenvalues of the…
This paper concerns on linked periodic orbits of orientation-preserving homeomorphisms of the $2$-disc in the sense of Gambaudo. We interpret the linking of periodic orbits by using their induced braids. Then based on the forcing relation…
We propose a higher-order dimensionality reduction framework based on the Trace Ratio (TR) optimization problem. We establish conditions for existence and uniqueness of solutions and clarify the theoretical connection between the Trace…
Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…
Let $F$ be a number field, $\pi$ either a unitary cuspidal automorphic representation of $\mathrm{GL}(2)/F$ or a unitary Eisenstein series, and $\chi$ a unitary Hecke character of analytic conductor $C(\chi).$ We develop a regularized…
We prove a characterization of all polynomial-time computable queries on the class of interval graphs by sentences of fixed-point logic with counting. More precisely, it is shown that on the class of unordered interval graphs, any query is…
Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the bound is independent of the length of the braid), the…
In this paper we study a class of Jacobi operators, such that each operator is generated by the unit Borel measure with a support consisting of a finite number of intervals on the real line R and a finite number of points in C, located…
We establish the coarse relative trace formulae of Jacquet-Rallis for linear and unitary groups. Both formulae are of the form: a sum of spectral distributions equals a sum of geometric distributions. In order to obtain the spectral…
In this study, we found a regular trace formula for the eigenvalues of the boundary value problem, which we created with the second-order differential equation with eigen parameter and discontinuity at x ={\pi}/2, which is an interior point…
The main result of the paper is a description of the class of functions on the unit circle, for which Krein's trace formula holds for arbitrary pairs of unitary operators with trace class difference. We prove that this class of functions…
Forcing was first introduced by Paul J. Cohen in his work on the independence of the Continuum Hypothesis. Other formulations of forcing appeared using Model Theory, Boolean-valued Models, and Topos Theory. There is a folkloric claim that…
We present a simple and fast algorithm for computing the $N$-th term of a given linearly recurrent sequence. Our new algorithm uses $O(\mathsf{M}(d) \log N)$ arithmetic operations, where $d$ is the order of the recurrence, and…