Related papers: Electric network and Hirota type $4$-simplex maps

Robbin and Salamon showed that attractor-repellor networks and Lyapunov maps are equivalent concepts and illustrate this with the example of linear flows on projective spaces. In these examples the fixed points are linearly ordered with…

This paper continues the study initiated in "The aithmetic of Triangles." We begin by examining a set of similar tetrahedra with parallel sides, together with a set of points in three-dimensional space. It turns out that the set…

We introduce an extension of the \ell-reduced KP hierarchy, which we call the \ell-Bogoyavlensky hierarchy. Bogoyavlensky's 2+1-dimensional extension of the KdV equation is the lowest equation of the hierarchy in case of \ell=2. We present…

We introduce several new families of relations in the mapping class groups of planar surfaces, each equating two products of right-handed Dehn twists. The interest of these relations lies in their geometric interpretation in terms of…

Let $H_n$ be the linear heptagonal networks with $2n$ heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of $H_n$, we utilize the decomposition theorem.…

We obtain a bi-Hamiltonian formulation for the Ostrovsky-Vakhnenko equation using its higher order symmetry and a new transformation to the Caudrey-Dodd-Gibbon-Sawada-Kotera equation. Central to this derivation is the relation between…

We study a new invariant of circular planar electrical networks, well known to phylogeneticists: the circular split system. We use our invariant to answer some open questions about levels of complexity of networks and their related…

The topological (graph) structure of complex networks often provides valuable information about the performance and vulnerability of the network. However, there are multiple ways to represent a given network as a graph. Electric power…

We introduce new geometric objects called spectral networks. Spectral networks are networks of trajectories on Riemann surfaces obeying certain local rules. Spectral networks arise naturally in four-dimensional N=2 theories coupled to…

Let (X,d) be a tree (T) of hyperbolic metric spaces satisfying the quasi-isometrically embedded condition. Let $v$ be a vertex of $T$. Let $({X_v},d_v)$ denote the hyperbolic metric space corresponding to $v$. Then $i : X_v \rightarrow X$…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Given a holomorphic family of Bridgeland stability conditions over a surface, we define a notion of spectral network which is an object in a Fukaya category of the surface with coefficients in a triangulated DG-category. These spectral…

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative its size. These…

We study four-dimensional Einstein-Maxwell fields for which any higher-order corrections to the field equations effectively reduces to just a rescaling of the gravitational and the cosmological constant. These configurations are thus…

The tetrahedron equation in a special substitution is reduced to a pair of pentagon and one ten-term equations. Various examples of solutions are found. $O$-doubles of Novikov, which generalize the Heisenberg double of a Hopf algebra,…

The tensorial equations for non trivial fully interacting fixed points at lowest order in the $\varepsilon$ expansion in $4-\varepsilon$ and $3-\varepsilon$ dimensions are analysed for $N$-component fields and corresponding multi-index…

The classical Whitney's 2-Isomorphism Theorem describes the families of graphs having the same cycle matroid. In this paper we describe the families of graphs having the same truncated cycle matroid and prove, in particular, that every…

A $Cretan(4t+1)$ matrix, of order $4t+1$, is an orthogonal matrix whose elements have moduli $\leq 1$. The only $Cretan(4t+1)$ matrices previously published are for orders 5, 9, 13, 17 and 37. This paper gives infinitely many new…

Spectrum graph theory not only facilitate comprehensively reflect the topological structure and dynamic characteristics of networks, but also offer significant and noteworthy applications in theoretical chemistry, network science and other…

We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…