Related papers: On Piecewise Affine Reachability with Bellman Oper…
Which groups can occur as the group of units in a ring? Such groups are called realizable. Though the realizable members of several classes of groups have been determined (e.g., cyclic, odd order, alternating, symmetric, finite simple,…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
The paper is devoted to a detailed analysis of nonlocal error bounds for nonconvex piecewise affine functions. We both improve some existing results on error bounds for such functions and present completely new necessary and/or sufficient…
We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…
Although decidable, the marking reachability problem for Petri nets is well-known to be intractable in general, and a non-elementary lower bound has been recently uncovered. In order to alleviate this difficulty, various structural and…
The paper is devoted to two-weight estimates for the fractional maximal operators $\mathcal{M}^\alpha$ on general probability spaces equipped with a tree-like structure. For given $1<p\leq q<\infty$, we study the sharp universal upper bound…
In this paper we introduce a technique to produce tighter cutting planes for mixed-integer non-linear programs. Usually, a cutting plane is generated to cut off a specific infeasible point. The underlying idea is to use the infeasible point…
Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$,…
Given a quasiconformal mapping $f:\mathbb R^n\to\mathbb R^n$ with $n\ge2$, we show that (un-)boundedness of the composition operator ${\bf C}_f$ on the spaces $Q_{\alpha}(\mathbb R^n)$ depends on the index $\alpha$ and the degeneracy set of…
A Deterministic affine quadratic optimal control problem is considered. Due to the nature of the problem, optimal controls exist under some very mild conditions. Further, it is shown that under some assumptions, the value function is…
Verifying correctness of deep neural networks (DNNs) is challenging. We study a generic reachability problem for feed-forward DNNs which, for a given set of inputs to the network and a Lipschitz-continuous function over its outputs,…
In this work, the reachable set estimation and safety verification problems for a class of piecewise linear systems equipped with neural network controllers are addressed. The neural network is considered to consist of Rectified Linear Unit…
We address an optimal reachability problem for a planar manipulator in a constrained environment. After introducing the optmization problem in full generality, we practically embed the geometry of the workspace in the problem, by…
Multi-Agent Path Finding (MAPF) is a fundamental motion coordination problem arising in multi-agent systems with a wide range of applications. The problem's intractability has led to extensive research on improving the scalability of…
We consider a non-linear real analytic control system of first order $\dot q^i = f^i(t, q, w)$, with controls $w = (w^\alpha)$ in a connected open set $\mathcal{K} \subset \mathbb{R}^m$ and configurations $q = (q^i)$ in $\mathcal{Q} :=…
Let $F\subseteq [0,1]^2$ be a Bedford-McMullen carpet defined by exponents $m>n$, that projects to $[0,1]$ on the $y$-axis. We show that under mild conditions on $F$, there are many non principle lines $\ell$ such that $\dim^* F\cap \ell =…
Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business…
The decidability and complexity of reachability problems and model-checking for flat counter machines have been explored in detail. However, only few results are known for flat (lossy) FIFO machines, only in some particular cases (a single…
The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…