Related papers: Electric network and Hirota type $4$-simplex maps
Quaternion-Kaehler four-manifolds, or equivalently anti-self-dual Einstein manifolds, are locally determined by one scalar function subject to Przanowski's equation. Using twistorial methods we construct a Lax Pair for Przanowski's…
We present three non-equivalent procedures to obtain entwining (non-constant) tetrahedron maps. Given a tetrahedron map, the first procedure incorporates its underlying symmetry group. With the second procedure we obtain several classes of…
The notion of basic net (called also basic polyhedron) on $S^2$ plays a central role in Conway's approach to enumeration of knots and links in $S^3$. Drobotukhina applied this approach for links in $RP^3$ using basic nets on $RP^2$. By a…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three. In this paper we affirmatively answer this question for the…
An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all…
The recent calculation of the four nucleon continuum spectrum are reviewed. Faddeev-Yakubovsky equations in configuration space have been solved for the four nucleon system with special interest in their scattering states. We present…
The use of complexified quaternions and $i$-complex geometry in formulating the Dirac equation allows us to give interesting geometric interpretations hidden in the conventional matrix-based approach.
The tetrahedron equation introduced by Zamolodchikov is a three-dimensional generalization of the Yang-Baxter equation. Several types of solutions to the tetrahedron equation that have connections to quantum groups can be viewed as…
It is shown that for a certain class of Yang-Baxter maps (or set-theoretical solutions to the quantum Yang-Baxter equation) the Lax representation can be derived straight from the map itself. A similar phenomenon for 3D consistent equations…
Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…
In this paper we relate a well-known in symplectic geometry compactification of the space of symmetric bilinear forms considered as a chart of the Lagrangian Grassmannian to the specific compactifications of the space of electrical networks…
We present a succinct way of obtaining all possible higher dimensional generalization of Quantum Yang-Baxter Equation (QYBE). Using the scheme, we could generate the two popular three-simplex equations, namely: Zamolodchikov's tetrahedron…
We study complex networks formed by triangulations and higher-dimensional simplicial complexes representing closed evolving manifolds. In particular, for triangulations, the set of possible transformations of these networks is restricted by…
We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…
A family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturmfels, which were named nestohedra, consists in each dimension of an interval of polytopes starting with a simplex and ending with a permutohedron. This paper…
The evaluation of relativistic spin networks plays a fundamental role in the Barrett-Crane state sum model of Lorentzian quantum gravity in 4 dimensions. A relativistic spin network is a graph labelled by unitary irreducible representations…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
In this paper we formulate an integrable model on the simple cubic lattice. The $N$ -- valued spin variables of the model belong to edges of the lattice. The Boltzmann weights of the model obey the vertex type Tetrahedron Equation. In the…
This paper studies \emph{Dirichlet arrangements}, a generalization of graphic hyperplane arrangements arising from electrical networks and order polytopes of finite posets. We generalize descriptions of combinatorial features of graphic…