Related papers: Calculating two-strand jellyfish relations
This paper is a survey of some of the most elementary consequences of the JSJ-decomposition and geometrization for knot and link complements in the 3-sphere. Formulated in the language of graphs, the result is the construction of a…
We present an algorithm for the analytical evaluation of dimensionally regularized massless on-shell double box Feynman diagrams with arbitrary polynomials in numerators and general integer powers of propagators. Recurrence relations…
We introduce and study a loopless multigraph associated with a split graph $S$: the factor graph of $S$, denoted by $\Phi(S)$, which encodes the combinatorial information about 2-switch transformations over $S$. This construction provides a…
In this note, we reconcile two approaches that have been used to construct stringy multiplications. The pushing forward after pulling back that has been used to give a global stringy extension of the functors K_0,K^{top},A^*,H^* [CR, FG,…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
We review recent interactions between mathematical theory of two-dimensional topological order and operator algebras, particularly the Jones theory of subfactors. The role of representation theory in terms of tensor categories is…
We consider the analytic calculation of a two-loop non-planar three-point function which contributes to the two-loop amplitudes for $t \bar{t}$ production and $\gamma \gamma$ production in gluon fusion through a massive top-quark loop. All…
We consider the analytic continuation of the transfer function associated with a 2x2 operator matrix having unbounded couplings into unphysical sheets of its Riemann surface. We construct a family of non-selfadjoint operators which…
In [3], Hanaki defined the Terwilliger algebras of association schemes over a commutative unital ring. In this paper, we call the Terwilliger algebras of association schemes over a field $\mathbb{F}$ the Terwilliger $\mathbb{F}$-algebras of…
Polynomial relations for generators of $su(2)$ Lie algebra in arbitrary representations are found. They generalize usual relation for Pauli operators in spin 1/2 case and permit to construct modified Holstein-Primakoff transformations in…
The basic goal of survivable network design is to construct low-cost networks which preserve a sufficient level of connectivity despite the failure or removal of a few nodes or edges. One of the most basic problems in this area is the…
A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
Some of the most interesting quantities associated with a factor graph are its marginals and its partition sum. For factor graphs \emph{without cycles} and moderate message update complexities, the sum-product algorithm (SPA) can be used to…
On a smooth algebraic variety over $\mathbb{C}$, we build the tempered subanalytic and Stein tempered subanalytic sites. We construct the sheaf of holomorphic functions tempered at infinity over these sites and study their relations with…
The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. In this paper, we study the Terwilliger $\mathbb{F}$-algebras of factorial…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…
A well known Euler's formula consequence's corollary in graph theory states that: For a connected simple planar graph with $n$ vertices and $m$ edges, and girth $g$, we have $m \leq \frac{g}{g-2}(n-2)$. We show that a connected simple plane…
We use 4-valent planar graphs and singular cobordisms (called foams) to construct an integral doubly-graded cohomology for tangles, and in particular for links, whose graded Euler characteristic yields the sl(n) link polynomial (for n > 3).