中文
相关论文

相关论文: A trace formula for the forcing relation of braids

200 篇论文

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…

几何拓扑 · 数学 2021-09-03 Ivan Dynnikov , Bert Wiest

The Lefschetz fixed point theorem follows easily from the identification of the Lefschetz number with the fixed point index. This identification is a consequence of the functoriality of the trace in symmetric monoidal categories. There are…

代数拓扑 · 数学 2014-02-25 Kate Ponto

A formula for factorizations of the full twist in the braid group $Br_{2m}$ depending on any four factorizations of the full twist in $Br_{m}$ is given. Applying this formula, a symplectic 4-manifold $X$ and two isotopic generic coverings…

代数几何 · 数学 2007-05-23 Vik. S. Kulikov

In this paper we represent the classical braids in the Yokonuma--Hecke and the adelic Yokonuma--Hecke algebras. More precisely, we define the completion of the framed braid group and we introduce the adelic Yokonuma--Hecke algebras, in…

几何拓扑 · 数学 2010-07-16 Jesus Juyumaya , Sofia Lambropoulou

We study the categorical notion of braid gauging and obtain its classical Hopf algebraic description. We demonstrate how braid gauging can provide new insights on certain categorical invariants, such as the fusion rules and the higher…

量子代数 · 数学 2019-04-16 Marc Keilberg

The boundary conditions of a non-trivial string background are classified. To this end we need traces on various spaces of conformal blocks, for which generalizations of the Verlinde formula are presented.

高能物理 - 理论 · 物理学 2007-05-23 C. Schweigert , J. Fuchs

We study the connectedness property of the spectrum of forcing algebras over a noetherian ring. In particular we present for an integral base ring a geometric criterion for connectedness in terms of horizontal and vertical components of the…

交换代数 · 数学 2012-11-13 Holger Brenner , Danny Gomez-Ramirez

We develop a calculus for diagrams of knotted objects. We define Arrow presentations, which encode the crossing informations of a diagram into arrows in a way somewhat similar to Gauss diagrams, and more generally w-tree presentations,…

几何拓扑 · 数学 2019-02-13 Jean-Baptiste Meilhan , Akira Yasuhara

Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy (i), (ii) below: (i) There exists a basis for $V$…

环与代数 · 数学 2007-05-23 Kazumasa Nomura , Paul Terwilliger

Bonded knots arise naturally in topological protein modeling, where intramolecular interactions such as disulfide bridges stabilize folded configurations. These structures extend classical knot theory by incorporating embedded graphs, and…

几何拓扑 · 数学 2025-10-09 Paolo Cavicchioli , Boštjan Gabrovšek , Matic Simonič

We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…

几何拓扑 · 数学 2020-11-02 Sergei Gukov , James Halverson , Fabian Ruehle , Piotr Sułkowski

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

高能物理 - 理论 · 物理学 2008-11-26 Hong-Hao Zhang , Wen-Bin Yan , Xue-Song Li

In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.

组合数学 · 数学 2016-05-17 Fernando Tura

Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…

组合数学 · 数学 2020-08-20 Steven Klee , Matthew T. Stamps

Cayley's formula states that there are $n^{n-2}$ spanning trees in the complete graph on $n$ vertices; it has been proved in more than a dozen different ways over its 150 year history. The complete graphs are a special case of threshold…

组合数学 · 数学 2013-01-09 Stephen R. Chestnut , Donniell E. Fishkind

We give a new, simple proof of the trace formula for Hecke operators on modular forms for finite index subgroups of the modular group. The proof uses algebraic properties of certain universal Hecke operators acting on period polynomials of…

数论 · 数学 2017-06-09 Alexandru A. Popa

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

组合数学 · 数学 2024-02-13 Hajime Fujita , Kimiko Hasegawa , Yukie Inaba , Takefumi Kondo

This is the first 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…

表示论 · 数学 2026-01-07 Paul Boisseau , Weixiao Lu , Hang Xue

Given integers $m$, $n$ and $k$, we give an explicit formula with an optimal error term (with square root cancelation) for the Petersson trace formula involving the $m$-th and $n$-th Fourier coefficients of an orthonormal basis of…

数论 · 数学 2020-08-04 Junehyuk Jung , Simon Marshall , Naser T. Sardari

Twisted knot theory introduced by M. Bourgoin is a generalization of knot theory. It leads us to the notion of twisted virtual braids. In this paper we show theorems for twisted links corresponding to the Alexander theorem and the Markov…

几何拓扑 · 数学 2023-10-06 Komal Negi , Madeti Prabhakar , Seiichi Kamada
‹ 上一页 1 8 9 10 下一页 ›