相关论文: A copositive formulation for the stability number …
Finding minimum dominating set and maximum independent set for graphs in the classical online setup are notorious due to their disastrous $\Omega(n)$ lower bound of the competitive ratio that even holds for interval graphs, where $n$ is the…
We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…
It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…
An optimal control problem on finite-dimensional positive cones is stated. Under a critical assumption on the cone, the corresponding Bellman equation is satisfied by a linear function, which can be computed by convex optimization. A…
Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual…
We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty}…
The dual normal factor graph and the factor graph duality theorem have been considered for discrete graphical models. In this paper, we show an application of the factor graph duality theorem to continuous graphical models. Specifically, we…
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…
We provide a solution method for the polyhedral convex set optimization problem, that is, the problem to minimize a set-valued mapping with polyhedral convex graph with respect to a set ordering relation which is generated by a polyhedral…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
Consider the graph obtained by superposition of an independent pair of uniform infinite non-crossing perfect matchings of the set of integers. We prove that this graph contains at most one infinite path. Several motivations are discussed.
A parametric constrained convex optimal control problem, where the initial state is perturbed and the linear state equation contains a noise, is considered in this paper. Formulas for computing the subdifferential and the singular…
We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…
Topological stars, or top stars for brevity, are smooth horizonless static solutions of Einstein-Maxwell theory in 5-d that reduce to spherically symmetric solutions of Einstein-Maxwell-Dilaton theory in 4-d. We study linear scalar…
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics…
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…
Copositivity of tensors plays an important role in vacuum stability of a general scalar potential, polynomial optimization, tensor complementarity problem and tensor generalized eigenvalue complementarity problem. In this paper, we propose…
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
A new nonparametric approach for system identification has been recently proposed where the impulse response is seen as the realization of a zero--mean Gaussian process whose covariance, the so--called stable spline kernel, guarantees that…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…