Related papers: Spatial Straight Line Linkages by Factorization of…
Darboux developed an ingenious algebraic mechanism to construct infinite chains of ''integrable'' second-order differential equations as well as their solutions. After a surprisingly long time, Darboux's results were rediscovered and…
In this paper we derive intertwining relations for a broad class of conservative particle systems both in discrete and continuous setting. Using the language of point process theory, we are able to derive a natural framework in which…
We propose a discretization of classical confocal coordinates. It is based on a novel characterization thereof as factorizable orthogonal coordinate systems. Our geometric discretization leads to factorizable discrete nets with a novel…
For a polygonal linkage, we produce a fast navigation algorithm on its configuration space. The basic idea is to approximate the configuration space by the vertex-edge graph of its cell decomposition discovered by the first author. The…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
Darboux transformation plays a key role in constructing explicit closed-form solutions of completely integrable systems. This paper provides an algebraic construction of generalized Darboux matrices with the same poles for the $2\times2$…
In this paper, we focus on generating complex robotic trajectories by merging sequential motion primitives. A robotic trajectory is a time series of positions and orientations ending at a desired target. Hence, we first discuss the…
We investigate bosonic sectors of supersymmetric field theories. We consider superpotentials described by one and by two real scalar fields, and we show how the equations of motion can be factorized into a family of first order Bogomol'nyi…
Let $D$ be an oriented classical or virtual link diagram with directed universe $\vec{U}$. Let $C$ denote a set of directed Euler circuits, one in each connected component of $U$. There is then an associated looped interlacement graph…
A multimodal network encodes relationships between the same set of nodes in multiple settings, and network alignment is a powerful tool for transferring information and insight between a pair of networks. We propose a method for multimodal…
Smooth parametrization consists in a subdivision of the mathematical objects under consideration into simple pieces, and then parametric representation of each piece, while keeping control of high order derivatives. The main goal of the…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
The exact complexity of geometric cuts and bisections is the longstanding open problem including even the dimension one. In this paper, we resolve this problem for dimension one (the real line) by designing an exact polynomial time…
We investigate point-line geometries whose singular subspaces correspond to binary equidistant codes. The main result is a description of automorphisms of these geometries. In some important cases, automorphisms induced by non-monomial…
Natural and man-made networks often possess locally tree-like sub-structures. Taking such tree networks as our starting point, we show how the addition of links changes the synchronization properties of the network. We focus on two…
We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…
In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand…
We give a full description of Darboux transformations of any order for arbitrary (nondegenerate) differential operators on the superline. We show that every Darboux transformation of such operators factorizes into elementary Darboux…
Classically, it is well known that a single weight on a real interval leads to orthogonal polynomials. In "Generalized orthogonal polynomials, discrete KP and Riemann-Hilbert problems", Comm. Math. Phys. 207, pp. 589-620 (1999), we have…
We obtain exact polynomial solutions for two-dimensional coherent complex scalar fields propagating through arbitrary aberrated shift-invariant linear imaging systems. These are used to model nodal-line dynamics of coherent fields output by…