MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems

We study the transient optimization of gas transport networks including both discrete controls due to switching of controllable elements and nonlinear fluid dynamics described by the system of isothermal Euler equations, which are partial differential equations in time and 1-dimensional space. This combination leads to mixed-integer optimization problems subject to nonlinear hyperbolic partial differential equations on a graph. We propose an instantaneous control approach in which suitable Euler discretizations yield systems of ordinary differential equations on a graph. This networked system of ordinary differential equations is shown to be well-posed and affine-linear solutions of these systems are derived analytically. As a consequence, finite-dimensional mixed-integer linear optimization problems are obtained for every time step that can be solved to global optimality using general-purpose solvers. We illustrate our approach in practice by presenting numerical results on a realistic gas transport network.     

Class of Maximal Graph Surfaces on Multidimensional Two-Step Sub-Lorentzian Structures

Necessary maximality conditions for graph surfaces in a class of two-step sub-Lorentzian structures are obtained. The concept of a sub-Lorentzian mean curvature is introduced, and equations for maximal surfaces are deduced.     

More on block intersection polynomials and new applications to graphs and block designs

The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy certain integer linear equations involving binomial coefficients, and information on the non-negative integer solutions to these equations can be obtained using the block intersection polynomials introduced by P.J. Cameron and the present author. The theory of block intersection polynomials is extended, and new applications of these polynomials to the studies of graphs and block designs are obtained. In particular, we obtain a new method of bounding the size of a clique in an edge-regular graph with given parameters, which can improve on the Hoffman bound when applicable, and a new method for studying the possibility of a graph with given vertex-degree sequence being an induced subgraph of a strongly regular graph with given parameters.     

组合数学与数论间的一些交叉问题初探

我们证明了有限域上的一类方程组解的个数与图的顶点着色数有密切关系，而这又对许多着色问题的产生了许多应用。另外，我们也用图论的一些技巧解决了数论中一些问题。     

Asymptotic solutions of the Navier-Stokes equations and systems of stretched vortices filling a three-dimensional volume

We construct asymptotic solutions of the Navier-Stokes equations describing periodic systems of vortex filaments entirely filling a three-dimensional volume. Such solutions are related to certain topological invariants of divergence-free vector fields on the two-dimensional torus. The equations describing the evolution of of such a structure are defined on a graph which is the set of trajectories of a divergence-free field.     

Exact Closed Form Solution for Two Coupled Inhomogeneous First Order Difference Equations with Variable Coefficients

We present an exact closed form solution for two coupled, homogeneous as well as inhomogeneous, first order difference equations with variable coefficients. The solution is obtained by using the graph theoretic, discrete path formalism. The central parameters in the solution are the crossing index and the crossing number. The transition from an enumerative graph theoretic solution to a closed form combinatorial solution is made possible by an isomorphism in-between paths on the signal flow graph, and n -tuplets of binary numbers.     

Asymptotic solutions of the Navier-Stokes equations describing periodic systems of localized vortices

We construct asymptotic solutions of the Navier-Stokes equations describing the two-phase Taylor-scale structures consisting of periodic systems of localized vortex filaments. Such solutions are related to certain topological invariants of divergence-free vector fields on the two-dimensional cylinder or the torus. The equations describing the evolution of the vortex system are defined on a graph which is the set of trajectories of a divergence-free field.     

直径为4的整树新类

整图是指图的邻接矩阵的特征值全为整数的图. 研究了直径为4的整树.通过求解某些确定的丢番图方程,构造了具有无穷多个这样的整树新类,推广了王力工、李学良和张胜贵发表的文章(见Families of integral trees with diameters 4,6 and 8, it Discrete Applied Mathematics, 2004, 136: 349-362)的一些结论.     

Variational problems on multiply connected thin strips III: Integration of the Ginzburg-Landau equations over graphs

We analyze the one-dimensional Ginzburg-Landau functional of superconductivity on a planar graph. In the Euler-Lagrange equations, the equation for the phase can be integrated, provided that the order parameter does not vanish at the vertices; in this case, the minimization of the Ginzburg-Landau functional is equivalent to the minimization of another functional, whose unknowns are a real-valued function on the graph and a finite set of integers.

     

Asymptotic solutions of Navier-Stokes equations and topological invariants of vector fields and Liouville foliations

We construct asymptotic solutions of the Navier-Stokes equations. Such solutions describe periodic systems of localized vortices and are related to topological invariants of divergence-free vector fields on two-dimensional cylinders or tori and to the Fomenko invariants of Liouville foliations. The equations describing the evolution of a vortex system are given on a graph that is a set of trajectories of the divergence-free field or a set of Liouville tori.     

Poisson structures and integrable systems connected with graphs

Completely integrable systems related with graphs of a specific type are studied by the r-matrix method. The phase space of such a system is the space of connections on a graph. The nonlinear equations under consideration are Hamiltonian with respect to the Poisson bracket depending on the geometry of the graph and other structures. It is essential that the Poisson bracket be nonultralocal. An involute family of motion integrals is constructed. Explicit formulas for solutions of evolution equations are obtained in terms of solutions of a factorization problem. In the case of the group of loops, a polynomial anzatz for the Lax operator compatible with the Poisson bracket is constructed. Bibliography: 8 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 224, 1995, pp. 279–299. Translated by B. M. Bekker.     

An efficient algorithm for the parallel solution of high-dimensional differential equations

The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further, we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16.     

An iterated graph construction and periodic orbits of Hamiltonian delay equations

According to the Arnold conjectures and Floer's proofs, there are non-trivial lower bounds for the number of periodic solutions of Hamiltonian differential equations on a closed symplectic manifold whose symplectic form vanishes on spheres. We use an iterated graph construction and Lagrangian Floer homology to show that these lower bounds also hold for certain Hamiltonian delay equations.     

Solution method for boundary value problems for ordinary differential equations on complexes (Graphs)

For second-order ordinary differential equations in a domain that is a finite set of intersecting segments of the axis O _x , we consider problems with local and nonlocal boundary conditions. A system of intersecting segments is referred to as a complex, whose topological structure is described by a graph. For the integration of differential equations, we suggest an exact difference scheme, which reduces the solution of the problem to a system of second-order difference equations on the segments of the complex with boundary conditions and matching conditions at the graph vertices. Depending on the topological structure of the graph, we consider two algorithms for solving systems of linear algebraic equations. A detailed justification of the method is presented.     

Analysis of equation submodels

In bond graph models, the atomic submodels are described by sets of equations. Because of the physical justification of the bond graph formalism, it provides extensive possibilities for verification of the model at the graphical level. The equation formulation on the other hand is founded in the mathematical domain, so the need for a check against physical criteria is both more needed and more difficult.

Causality assignment is the meeting point of the graphical level and the equation level. In bond graph modeling, causality assignment is a vital step in analysis and simulation. The assignment process in the graph is based on the causality restrictions of the atomic submodels. In this article, an automatic procedure for the derivation of causality restrictions of atomic submodels is presented. This process not only generates the correct set of causality restrictions, but also provides a detailed verification of the correctness of the submodel     

Adjoint and self-adjoint boundary value problems on a geometric graph

We consider boundary value problems of arbitrary order for linear differential equations on a geometric graph. Solutions of boundary value problems are coordinated at the interior vertices of the graph and satisfy given conditions at the boundary vertices. For considered boundary value problems, we construct adjoint boundary value problems and obtain a self-adjointness criterion. We describe the structure of the solution set of homogeneous self-adjoint boundary value problems with alternating coefficients of a differential equation and obtain nondegeneracy conditions for these boundary value problems.     

On the disconjugacy property of an equation on a graph

Under study is the disconjugacy theory of forth order equations on a geometric graph. The definition of disconjugacy is given in terms of a special fundamental system of solutions to a homogeneous equation. We establish some connections between the disconjugacy property and the positivity of the Green’s functions for several classes of boundary value problems for forth order equation on a graph. We also state the maximum principle for a forth order equation on a graph and prove some properties of differential inequalities.     

代数构造及在Ramsey理论中的应用

本文在Galois域上的代数构造和关于一些特定类型图的Ramseyr数之间建立了一个关系．关键问题是研究了关于Galois域上的代数构造的方程及方程组的解．我们得到了一些关于二部图的新的下界和上界．     

A discrete Schrödinger equation via optimal transport on graphs

In 1966, Edward Nelson presented an interesting derivation of the Schrödinger equation using Brownian motion. Recently, this derivation is linked to the theory of optimal transport, which shows that the Schrödinger equation is a Hamiltonian system on the probability density manifold equipped with the Wasserstein metric. In this paper, we consider similar matters on a finite graph. By using discrete optimal transport and its corresponding Nelson's approach, we derive a discrete Schrödinger equation on a finite graph. The proposed system is quite different from the commonly referred discretized Schrödinger equations. It is a system of nonlinear ordinary differential equations (ODEs) with many desirable properties. Several numerical examples are presented to illustrate the properties.     

A brief historical introduction to matrices and their applications

This paper deals with the ancient origin of matrices, and the system of linear equations. Included are algebraic properties of matrices, determinants, linear transformations, and Cramer’s Rule for solving the system of algebraic equations. Special attention is given to some special matrices, including matrices in graph theory and electrical networks. It contains a wide variety of important materials accessible to college and even high school students and teachers at all levels.