Related papers: Index theorems for graph-parametrized optimal cont…

In a graph, we assign distinct integers to the vertices, and take the sum of two integers if they are on two adjacent vertices. The minimum possible number of different sums is the \emph{sum index} of this graph. In this paper, we present…

For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…

Under a Morse index condition we prove symmetry results for solutions of a nonlinear mixed boundary condition elliptic problem. As an intermediate step we relate the Morse index of a solution to a mixed boundary condition linear eigenvalue…

In this paper, we describe some recent spectral Moore theorems related to determining the maximum order of a connected graph of given valency and second eigenvalue. We show how these spectral Moore theorems have applications in Alon-Boppana…

We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

We develop the relative Morse index theory for linear self-adjoint operator equation without compactness assumption and give the relationship between the index defined in [44] and [45]. Then we generalize the method of saddle point…

A geometric setup for control theory is presented. The argument is developed through the study of the extremals of action functionals defined on piecewise differentiable curves, in the presence of differentiable non-holonomic constraints.…

We prove that a formula predicted on the basis of non-rigorous physics arguments [Zdeborova and Krzakala: Phys. Rev. E (2007)] provides a lower bound on the chromatic number of sparse random graphs. The proof is based on the interpolation…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

We study a singular Hamiltonian system with an $\al$-homogeneous potential that contains, as a particular case, the classical $N$--body problem. We introduce a variational Morse--like index for a class of collision solutions and, using the…

This is the second paper in our sequence. Here, we apply our abstract Morse index formulation developed in the previous paper to study several optimization set-ups with constraints, including type I or/and type II considerations. A common…

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

In geometric analysis, an index theorem relates the difference of the numbers of solutions of two differential equations to the topological structure of the manifold or bundle concerned, sometimes using the heat kernels of two higher-order…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

Perturbed geodesics are trajectories of particles moving on a semi-Riemannian manifold in the presence of a potential. Our purpose here is to extend to perturbed geodesics on semi-Riemannian manifolds the well known Morse Index Theorem.…

We generalise the semi-Riemannian Morse index theorem to elliptic systems of partial differential equations on star-shaped domains. Moreover, we apply our theorem to bifurcation from a branch of trivial solutions of semilinear systems,…

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear…

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V|)+1 where V is the set of vertices of the graph.…