English
Related papers

Related papers: Calculating two-strand jellyfish relations

200 papers

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…

Discrete Mathematics · Computer Science 2012-04-18 Siham Bekkai

We prove that if two Calabi-Yau invertible pencils have the same dual weights, then they share a common factor in their zeta functions. By using Dwork cohomology, we demonstrate that this common factor is related to a hypergeometric…

Number Theory · Mathematics 2018-02-15 Charles F. Doran , Tyler L. Kelly , Adriana Salerno , Steven Sperber , John Voight , Ursula Whitcher

Segmentation, a new approach based on successive edge contraction is introduced for extract method refactoring. It targets identification of distinct functionalities implemented within a method. Segmentation builds upon data and control…

Software Engineering · Computer Science 2019-08-14 Omkarendra Tiwari , Rushikesh K. Joshi

The "$10$-fold way" refers to the combined classification of the $3$ associative division algebras (of real, complex and quaternionic numbers) and of the $7$, ${\mathbb Z}_2$-graded, superdivision algebras (in a superdivision algebra each…

Mathematical Physics · Physics 2023-03-29 Zhanna Kuznetsova , Francesco Toppan

In this paper we compute the bivariate generating function of $\gamma$-matchings over two backbones, filtered by the number of arcs and the topological genus. $\gamma$-matchings over two backbones are chord-diagrams, obtained via…

Combinatorics · Mathematics 2013-11-05 Benjamin Mingming Fu , Christian M. Reidys

We study the complexity of the classification problem for Cartan subalgebras in von Neumann algebras. We construct a large family of II$_1$ factors whose Cartan subalgebras up to unitary conjugacy are not classifiable by countable…

Operator Algebras · Mathematics 2018-05-28 Pieter Spaas

We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…

Combinatorics · Mathematics 2021-10-07 Kolja Knauer , Gil Puig i Surroca

We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…

Algebraic Geometry · Mathematics 2017-03-07 Albert Schwarz , Vadim Vologodsky , Johannes Walcher

Starting from a graded Frobenius superalgebra $B$, we consider a graphical calculus of $B$-decorated string diagrams. From this calculus we produce algebras consisting of closed planar diagrams and of closed annular diagrams. The action of…

Representation Theory · Mathematics 2019-02-04 Anthony Licata , Daniele Rosso , Alistair Savage

Let $G$ be a simple cubic 2-connected plane graph. For every $2$-factor $X$ of $G$ having $n$-components there exists a simple hamiltonian plane graph $J \subset G^{2}$ such that $|E(J)|= |E(G)| + 2n -2$ and $\Delta(J) \leqslant 5$.

Combinatorics · Mathematics 2023-10-10 Jan Florek

We introduce and characterize various gluing constructions for residuated lattices that intersect on a common subreduct, and which are subalgebras, or appropriate subreducts, of the resulting structure. Starting from the 1-sum construction…

Logic · Mathematics 2023-06-02 Nick Galatos , Sara Ugolini

We revisit the problem of computing extremal and non-extremal three point functions of semiclassical probes with single trace operators and point out certain inconsistencies in previous approaches in the literature. We clarify the roles of…

High Energy Physics - Theory · Physics 2026-01-01 Adolfo Holguin

We compute Yukawa couplings in type IIB string theory compactified on a non factorisable six-torus in the presence of D9 branes and fluxes. The setting studied in detail, is obtained by T-dualising an intersecting brane configuration of…

High Energy Physics - Theory · Physics 2018-09-26 Stefan Forste , Christoph Liyanage

We apply the theory of $\alpha$-induction of sectors which we elaborated in our previous paper to several nets of subfactors arising from conformal field theory. The main application are conformal embeddings and orbifold inclusions of SU(n)…

High Energy Physics - Theory · Physics 2009-10-31 J. Bockenhauer , D. E. Evans

This is an addition to a series of papers [FL1, FL2, FL3, FL4], where we develop quaternionic analysis from the point of view of representation theory of the conformal Lie group and its Lie algebra. In this paper we develop split…

Representation Theory · Mathematics 2015-06-23 Matvei Libine

We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…

Machine Learning · Computer Science 2020-10-26 David Chiang , Darcey Riley

We use integrability at weak coupling to compute fishnet diagrams for four-point correlation functions in planar $\phi^4$ theory. The results are always multi-linear combinations of ladder integrals, which are in turn built out of classical…

High Energy Physics - Theory · Physics 2017-09-12 Benjamin Basso , Lance J. Dixon

This paper introduces cellular sheaf theory to graphical methods and reciprocal constructions in structural engineering. The elementary mechanics and statics of trusses are derived from the linear algebra of sheaves and cosheaves. Further,…

Algebraic Topology · Mathematics 2023-11-23 Zoe Cooperband , Robert Ghrist , Jakob Hansen

We state a conjecture for the formulas of the depth 4 low-weight rotational eigenvectors and their corresponding eigenvalues for the $3^G$ subfactor planar algebras. We prove the conjecture in the case when $|G|$ is odd. To do so, we find…

Operator Algebras · Mathematics 2015-07-20 Zhengwei Liu , David Penneys

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length $2n+1$ that have exactly $n$ or $n+1$ entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ…

Combinatorics · Mathematics 2018-02-16 Torsten Mütze , Franziska Weber