Related papers: Branch points and stability
The branch-and-bound algorithm based on decision diagrams introduced by Bergman et al. in 2016 is a framework for solving discrete optimization problems with a dynamic programming formulation. It works by compiling a series of bounded-width…
Let $X$ be a compact subset of the complex plane and $x \in X$. A necessary and sufficient condition is given in terms of Hausdorff contents for the existence of a bounded point derivation at $x$ on the space of vanishing Campanato…
We would like to study the solution stability of a parametric control problem governed by semilinear elliptic equations with a mixed state-control constraint, where the cost function is nonconvex and the admissible set is unbounded. The…
Bolytropes are bounded subsets of an affine building that consist of all points that have distance at most $r$ from some polytrope. We prove that the points of a bolytrope describe the set of all invariant lattices of a bolytrope order,…
We present an abstract framework for asymptotic analysis of convergence based on the notions of eventual families of sets that we define. A family of subsets of a given set is called here an "eventual family" if it is upper hereditary with…
In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…
The hitting set problem asks for a collection of sets over a universe $U$ to find a minimum subset of $U$ that intersects each of the given sets. It is NP-hard and equivalent to the problem set cover. We give a branch-and-bound algorithm to…
Graph isomorphism is an important problem as its worst-case time complexity is not yet fully understood. In this study, we try to draw parallels between a related optimization problem called point set registration. A graph can be…
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a…
Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…
Branch points of a real 2-surface S in a 4-manifold M generalize the branch points of complex curves in complex surfaces: for example, they can occur as singularities of minimal surfaces. We investigate such a branch point p when S is…
Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related…
We investigate to what extent the degree sequence of a directed network constrains the number of driver nodes. We develop a pair of algorithms that take a directed degree sequence as input and aim to output a network with the maximum or…
A simple way of obtaining robust estimates of the "center" (or the "location") and of the "scatter" of a dataset is to use the maximum likelihood estimate with a class of heavy-tailed distributions, regardless of the "true" distribution…
Given a closed, oriented surface, possibly with boundary, and a mapping class, we obtain sharp lower bounds on the number of fixed points of a surface symplectomorphism (i.e. area-preserving map) in the given mapping class, both with and…
We consider the problem of making a set of states invariant for a network of controlled systems. We assume that the subsystems, initially uncoupled, must be interconnected through controllers to be designed with a constraint on the data…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
Entropy notions for $\varepsilon$-incremental practical stability and incremental stability of deterministic nonlinear systems under disturbances are introduced. The entropy notions are constructed via a set of points in state space which…
The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…