Related papers: A trace formula for the forcing relation of braids
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
We give a complete proof of the fact that the trace of the curvature of the connection associated to a planar d-web (d>3) is the sum of the Blaschke curvatures of its sub 3-webs.
We discuss a recursive formula for number of spanning trees in a graph. The paper is written primary for school students.
We obtain a trace Hardy inequality for the Euclidean space with a bounded cut $\Sigma\subset\mathbb R^d$, $d \ge 2$. In this novel geometric setting, the Hardy-type inequality non-typically holds also for $d = 2$. The respective Hardy…
We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…
In this paper, we provide an exact formula for the average hitting times in a wheel graph $W_{N+1}$ using a combinatorial approach. For this wheel graph, the average hitting times can be expressed using Fibonacci numbers when the number of…
It is shown that traces of mapping classes of finite order may be expressed by Verlinde-like formulae. The 3D topological argument is explained, and the resulting trace identities for modular matrix elements are presented.
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
We give algorithms to compute the Fr\'echet distance of trees and graphs with bounded tree width. Our algorithms run in $O(n^2)$ time for trees of bounded degree, and $O(n^2\sqrt{n \log n})$ time for trees of arbitrary degree. For graphs of…
Braidoids generalize the classical braids and form a counterpart theory to the theory of planar knotoids, just as the theory of braids does for the theory of knots. In this paper, we introduce basic notions of braidoids, a closure operation…
We consider the problem of estimating the trace and diagonal entries of an N-order tensor (where $N \geq 2$) under the framework where the tensor can only be accessed through tensor-vector multiplication. The aim is to estimate the tensor's…
We introduce a general approach to traces that we consider as linear continuous functionals on some function space where we focus on some special choices for that space. This leads to an integral calculus for the computation of the precise…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…
We prove algebraic and combinatorial characterizations of the class of inductively pierced codes, resolving a conjecture of Gross, Obatake, and Youngs. Starting from an algebraic invariant of a code called its canonical form, we explain how…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
We give factorizations for weighted spanning tree enumerators of Cartesian products of complete graphs, keeping track of fine weights related to degree sequences and edge directions. Our methods combine Kirchhoff's Matrix-Tree Theorem with…
Recently, a trace formula for non-self-adjoint periodic Schr\"odinger operators in $L^2(\mathbb{R})$ associated with Dirichlet eigenvalues was proved in [9]. Here we prove a corresponding trace formula associated with Neumann eigenvalues.…
In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…
The complex eikonal equation in the three space dimensions is considered. We show that apart from the recently found torus knots this equation can also generate other topological configurations with a non-trivial value of the $\pi_2(S^2)$…