Related papers: Index theorems for graph-parametrized optimal cont…
We prove a Morse index theorem for action functionals on paths that are allowed to reflect at a hypersurface (either in the interior or at the boundary of a manifold). Both fixed and periodic boundary conditions are treated.
We develop an index theory for variational problems on noncompact quantum graphs. The main results are a spectral flow formula, relating the net change of eigenvalues to the Maslov index of boundary data, and a Morse index theorem, equating…
Morse index theory provides an elegant and useful tool for describing several aspects of a Lagrangian system in terms of its variational properties. In the classical framework it provides an equality between the spectral properties of a…
In this paper, we prove a Morse index theorem for the index form of even order linear Hamiltonian systems on the closed interval with reasonable self-adjoint boundary conditions. The highest order term is assumed to be nondegenerate.
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
In this paper, we prove a Morse index theorem for the index form of regular Lagrangian system with selfadjoint boundary condition.
We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…
The Maslov index is a powerful tool for computing spectra of selfadjoint, elliptic boundary value problems. This is done by counting intersections of a fixed Lagrangian subspace, which designates the boundary condition, with the set of…
In this paper, we prove Morse index theorem of Lagrangian system with any self-adjoint boundary conditions. Based on it, we give some nontrivial estimation on the difference of Morse indices. As an application, we get a new criterion for…
We geometrically describe optimal control problems in terms of Morse families in the Hamiltonian framework. These geometric structures allow us to recover the classical first order necessary conditions for optimality and the starting point…
In this sequence, we first prove an abstract Morse index theorem in a Hilbert space modeling a variational problem with constraints. Then, our abstract formulation is applied to study several optimization setups including closed CMC…
A general setup for deterministic system identification problems on graphs with Dirichlet and Neumann boundary conditions is introduced. When control nodes are available along the boundary, we apply a discretize-then-optimize method to…
We will first establish an index theory for linear self-adjoint operator equations. And then with the help of this index theory we will discuss existence and multiplicity of solutions for asymptotically linear operator equations by making…
Reference [1] established an index theory for a class of linear selfadjoint operator equations covering both second order linear Hamiltonian systems and first order linear Hamiltonian systems as special cases. In this paper based upon this…
We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…
The Witten index for certain supersymmetric lattice models treated by de Boer, van Eerten, Fendley, and Schoutens, can be formulated as a topological invariant of simplicial complexes arising as independence complexes of graphs. We prove a…
A simple version of exact finite dimensional reduction for the variational setting of mechanical systems is presented. It is worked out by means of a thorough global version of the implicit function theorem for monotone operators. Moreover,…
We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this…
The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…