Related papers: Optimal conditions for connectedness of discretize…
We construct a subset of the Mandelbrot set which is dense on the boundary of the Mandelbrot set and which consists of only infinitely renormalizable points such that the Mandelbrot set is locally connected at every point of this subset. We…
We consider the problem of adding a fixed number of new edges to an undirected graph in order to minimize the diameter of the augmented graph, and under the constraint that the number of edges added for each vertex is bounded by an integer.…
An isolating set in a graph is a set $X$ of vertices such that every edge of the graph is incident with a vertex of $X$ or its neighborhood. The isolation number of a graph, or equivalently the vertex-edge domination number, is the minimum…
We consider a network of nodes distributed in physical space without physical links communicating through message broadcasting over specified distances. Typically, communication using smaller distances is desirable due to savings in energy…
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…
This paper explores the fundamental properties of distributed minimization of a sum of functions with each function only known to one node, and a pre-specified level of node knowledge and computational capacity. We define the optimization…
RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms…
We analyze integer linear programs which we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness…
We consider the inverse conductivity problem with discontinuous conductivities. We show in a rigorous way, by a convergence analysis, that one can construct a completely discrete minimization problem whose solution is a good approximation…
In several recent papers some concepts of convex analysis were extended to discrete sets. This paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some…
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its $2$-connectedness. This infimum thickness can be computed thanks to the fully…
The paper addresses the problem of sampling discretization of integral norms of elements of finite-dimensional subspaces satisfying some conditions. We prove sampling discretization results under two standard kinds of assumptions --…
We present the first review of methods to overapproximate the set of reachable states of linear time-invariant systems subject to uncertain initial states and input signals for short time horizons. These methods are fundamental to…
A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…
We consider a disentanglement process in which local properties of an entangled state are preserved, while the entanglement between the subsystems is erased. Sufficient conditions for a perfect disentanglement (into product states and into…
This survey addresses sampling discretization and its connections with other areas of mathematics. The survey concentrates on sampling discretization of norms of elements of finite-dimensional subspaces. We present here known results on…
$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…
A subset of vertices is called a dissociation set if it induces a subgraph with vertex degree at most one. Recently, Yuan et al. established the upper bound of the maximum number of dissociation sets among all connected graphs of order n…
Extremal problems related to the enumeration of graph substructures, such as independent sets, matchings, and induced matchings, have become a prominent area of research with the advancement of graph theory. A subset of vertices is called a…
In this paper error analysis for finite element discretizations of Dirichlet boundary control problems is developed. For the first time, optimal discretization error estimates are established in the case of three dimensional polyhedral and…