Related papers: Calculating two-strand jellyfish relations

This paper extends the existing theory of perfect reconstruction two-channel filter banks from bipartite graphs to non-bipartite graphs. By generalizing the concept of downsampling/upsampling we establish the frame of two-channel filter…

An iteration-free method of domain decomposition is considered for approximate solving a boundary value problem for a second-order parabolic equation. A standard approach to constructing domain decomposition schemes is based on a partition…

One major obstacle in extending the classification of small index subfactors beyond 3+\sqrt{3} is the appearance of infinite families of candidate principal graphs with 4-valent vertices (in particular, the "weeds" Q and Q' from Part 1…

In this paper we extend previous work on IFSs without overlap. Our method involves systems of operators generalizing the more familiar Cuntz relations from operator algebra theory, and from subband filter operators in signal processing.

We introduce a new notion of angle between intermediate subfactors and prove various interesting properties of the angle and relate it with the Jones' index. We prove a uniform 60 to 90 degree bound for the angle between minimal…

Pseudo-effect algebras are partial algebraic structures, that were introduced as a non-commutative generalization of effect algebras. In the present paper, lattice ordered pseudo-effect algebras are considered as possible algebraic…

A quadrilateral of factors is an irreducible inclusion of factors $N \subset M$ with intermediate subfactors $P$ and $Q$ such that $P$ and $Q$ generate $M$ and the intersection of $P$ and $Q$ is $N$. We investigate the structure of a…

We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…

Let $G$ be a simple, connected non bipartite graph and let $I_G$ be the edge idealof $G$. In our previous work we showed that L. Lov\'asz's theorem on ear decompositions offactor-critical graphs and the canonical decomposition of a graph…

Let $E$ is be vector bundle with meromorphic connection on $\proj^1/k$ for some field $k \subset \cplx$, and let $\mathbf{E}$ be the sheaf of horizontal sections on the analytic points of $X$. The irregular Riemann-Hilbert correspondence…

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the…

This paper is the third of a series giving a self-contained way from the Neveu-Schwarz algebra to a new series of irreducible subfactors. Here we introduce the local von Neumann algebra of the Neveu-Schwarz algebra, to obtain…

We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…

The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…

Let $X$ (resp. $Y$) be a curve of genus 1 (resp. 2) over a base field $k$ whose characteristic does not equal 2. We give criteria for the existence of a curve $Z$ over $k$ whose Jacobian is up to twist (2,2,2)-isogenous to the products of…

We argued in [Proc. Sympos. Pure Math., Vol. 103, American Mathematical Society, Providence, RI, 2021, 1-66, arXiv:1912.06504] that, when a certain sub-exponential growth property holds, the Donaldson-Thomas invariants of a 3-Calabi-Yau…

In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the…

Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…

Algebraic topology studies topological spaces with the help of tools from abstract algebra. The main focus of this paper is to show that many concepts from algebraic topology can be conveniently expressed in terms of (normal) factor graphs.…

The biplanar crossing number of a graph $G$ is the minimum number of crossings over all possible drawings of the edges of $G$ in two disjoint planes. We present new bounds on the biplanar crossing number of complete graphs and complete…