Related papers: Electric network and Hirota type $4$-simplex maps
It is well-known that topological sigma-models in 2 dimensions constitute a path-integral approach to the study of holomorphic maps from a Riemann surface S to an almost complex manifold K, the most interesting case being that where K is a…
It is shown how solutions to the Tzitz\'eica equation can be used to construct a family of (pseudo) hyper-complex metrics in four dimensions.
We show that the base polytope $P_M$ of any paving matroid $M$ can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers…
Criteria for the simplicity of the Lyapunov spectra of linear cocycles have been found by Furstenberg, Guivarc'h-Raugi, Gol'dsheid-Margulis and, more recently, Bonatti-Viana and Avila-Viana. In all the cases, the authors consider cocycles…
The network reconfiguration problem seeks to find a rooted tree $T$ such that the energy of the (unique) feasible electrical flow over $T$ is minimized. The tree requirement on the support of the flow is motivated by operational constraints…
We obtain a parametric normal form for any non-degenerate perturbation of the generalized saddle-node case of Bogdanov--Takens singularity. Explicit formulas are derived and greatly simplified for an efficient implementation in any computer…
We propose a new high-precision algorithm for solving the initial problem for the Zakharov-Shabat system. This method has the fourth order of accuracy and is a generalization of the second order Boffetta-Osborne scheme. It is allowed by our…
The Faddeev-Yakubowsky equations in configuration space have been solved for the four nucleon system. The results with an S-wave interaction model in the isospin approximation are presented. They concern the bound and scattering states…
Consider continuous-time linear switched systems on R^n associated with compact convex sets of matrices. When the system is irreducible and the largest Lyapunov exponent is equal to zero, there always exists a Barabanov norm (i.e. a norm…
A tensor product generalisation of $B\wedge F$ theories is proposed to give a Bogomol'nyi structure. Non-singular, stable, finite-energy particle-like solutions to the Bogomol'nyi equations are studied. Unlike Yang-Mills(-Higgs) theory, the…
We search for rational, four-dimensional maps of standard type (x_{n+1} - 2x_n + x_{n-1} = eps f(x,eps)) possessing one or two polynomial integrals. There are no non-trivial maps corresponding to cubic oscillators, but we find a…
We introduce a simpler although unconventional minimal subtraction renormalization procedure in the case of a massive scalar $\lambda \phi^{4}$ theory in Euclidean space using dimensional regularization. We show that this method is very…
We classify rational solutions of a specific type of the set theoretical version of the pentagon equation. That is, we find all quadrirational maps $R:(x,y)\mapsto (u(x,y),v(x,y)),$ where $u, v$ are two rational functions on two arguments,…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
This paper is concerned with the solution of large-scale linear discrete ill-posed problems with error-contaminated data. Tikhonov regularization is a popular approach to determine meaningful approximate solutions of such problems. The…
The problems on the location of the matrix spectrum inside or outside domains bounded by ellipses or parabolas are studied. Special Lyapunov-type equations are connected with these problems. Theorems about the unique solvability of such…
We present a systematic technique to find explicit solutions of birational maps, provided that these solutions are given in terms of elliptic functions. The two main ingredients are: (i) application of classical addition theorems for…
For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…
We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…
Three-dimensional conformal field theories (CFTs) with slightly broken higher spin symmetry provide an interesting laboratory to study general properties of CFTs and their roles in the AdS/CFT correspondence. In this work we compute the…