Related papers: Lower Bounds for the Reachability Problem in Fixed…
For highly perforated domains the paper addresses a novel approach to study mixed boundary value problems for the equations of linear elasticity in the framework of meso-scale approximations. There are no assumptions of periodicity involved…
Reachability analysis plays a central role in low-thrust spacecraft trajectory optimization by identifying which target states can be achieved under constraints on time, thrust, and propellant. Classical approaches construct reachable sets…
One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…
The basic goal of survivable network design is to build a cheap network that maintains the connectivity between given sets of nodes despite the failure of a few edges/nodes. The Connectivity Augmentation Problem (CAP) is arguably one of the…
The triviality and vacuum stability bounds on the Higgs-boson mass were revisited in presence of weakly-coupled new interactions parameterized in a model-independent way by effective operators of dimension 6. It was shown that for the scale…
A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…
Neural networks (NNs) are increasingly applied in safety-critical systems such as autonomous vehicles. However, they are fragile and are often ill-behaved. Consequently, their behaviors should undergo rigorous guarantees before deployment…
We investigate robust linear consensus over networks under capacity-constrained communication. The capacity of each edge is encoded as an upper bound on the number of state variables that can be communicated instantaneously. When the edge…
Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a…
Approximating the set of reachable states of a dynamical system is an algorithmic yet mathematically rigorous way to reason about its safety. Although progress has been made in the development of efficient algorithms for affine dynamical…
We study context-bounded verification of liveness properties of multi-threaded, shared-memory programs, where each thread can spawn additional threads. Our main result shows that context-bounded fair termination is decidable for the model;…
Consider an agent traversing a graph of "gadgets", each with local state that changes with each traversal by the agent. We characterize the complexity of universal traversal, where the goal is to traverse every gadget at least once, for DAG…
We consider a family of linearly elastic shells with thickness $2\varepsilon$ (where $\varepsilon$ is a small parameter). The shells are clamped along a portion of their lateral face, all having the same middle surface $S$, and may enter in…
In this paper we study the rank of planar rigidity matrix of 4-valent graphs, both in case of generic realizations and configurations in general position, under various connectivity assumptions on the graphs. For each case considered, we…
Many canonical machine learning problems boil down to a convex optimization problem with a finite sum structure. However, whereas much progress has been made in developing faster algorithms for this setting, the inherent limitations of…
The Weighted Tree Augmentation Problem (WTAP) is a fundamental well-studied problem in the field of network design. Given an undirected tree $G=(V,E)$, an additional set of edges $L \subseteq V\times V$ disjoint from $E$ called…
The 2-sets convex feasibility problem aims at finding a point in the intersection of two closed convex sets $A$ and $B$ in a normed space $X$. More generally, we can consider the problem of finding (if possible) two points in $A$ and $B$,…
In this paper we study the number of bound states for potentials in one and two spatial dimensions. We first show that in addition to the well-known fact that an arbitrarily weak attractive potential has a bound state, it is easy to…
We investigate singular geometries which can be associated with warped branes in arbitrary dimensions. If the brane tension is allowed to be variable, the extremum condition for the action requires additional constraints beyond the solution…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…