相关论文: Path signatures of ODE solutions

We automatically verify the crucial steps in the original proof of correctness of an algorithm which, given a geometric graph satisfying certain additional properties removes edges in a systematic way for producing a connected graph in…

Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…

Contrary to widespread perception, there is ever since 1994 a unified, general type independent theory for the existence of solutions for very large classes of nonlinear systems of PDEs. This solution method is based on the Dedekind order…

A signed graph is a graph together with an assignment of signs to the edges. A closed walk in a signed graph is said to be positive (negative) if it has an even (odd) number of negative edges, counting repetition. Recognizing the signs of…

A signed graph is a graph where the edges are assigned labels of either "$+$" or "$-$". The sign of a cycle in the graph is the product of the signs of its edges. We equip each signed complete graph with a vector whose entries are the…

We discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…

We investigate the signed support, that is, the set of the exponent vectors and the signs of the coefficients, of a multivariate polynomial $f$. We describe conditions on the signed support ensuring that the semi-algebraic set, denoted as…

A key overall goal of biomolecular simulations is the characterization of "mechanism" -- the pathways through configuration space of processes such as conformational transitions and binding. Some amount of heterogeneity is intrinsic to the…

An oriented hypergraph is an oriented incidence structure that extends the concept of a signed graph. We introduce hypergraphic structures and techniques central to the extension of the circuit classification of signed graphs to oriented…

A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a signed graph has a gain from an abelian group, concentrating…

We explore a nonlocal connection between certain linear and nonlinear ordinary differential equations (ODEs), representing physically important oscillator systems, and identify a class of integrable nonlinear ODEs of any order. We also…

A general formalism to solve nonlinear differential equations is given. Solutions are found and reduced to those of second order nonlinear differential equations in one variable. The approach is uniformized in the geometry and solves…

The path optimization method, which is proposed to control the sign problem in quantum field theories with continuous degrees of freedom by machine learning, is applied to a spin model with discrete degrees of freedom. The path optimization…

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Directed acyclic graphs whose nodes are all the divisors of a positive integer $n$ and arcs $(a,b)$ defined by $a$ divides $b$ are considered. Fourteen graph invariants such as order, size, and the number of paths are investigated for two…

In a recent paper published in Nature, Y.I. Sobolev et al. introduced the concept of trajectoids: convex, rigid objects, which roll without slip or spin on a flat plane along a prescribed periodic, unbounded planar path. A geometric…

We provide an algorithmic approach to the construction of point transformations for scalar ordinary differential equations that admit three-dimensional symmetry algebras which lead to their respective canonical forms.

A signed tree model of a graph $G$ is a compact binary structure consisting of a rooted binary tree whose leaves are bijectively mapped to the vertices of $G$, together with 2-colored edges $xy$, called transversal pairs, interpreted as…

It was shown in 1994, in Oberguggenberger & Rosinger, that very large classes of nonlinear PDEs have solutions which can be assimilated with usual measurable functions on the Euclidean domains of definition of the respective equations. In…

Solving systems of ordinary differential equations (ODEs) is essential when it comes to understanding the behavior of dynamical systems. Yet, automated solving remains challenging, in particular for nonlinear systems. Computer algebra…