Related papers: Reachability in Geometrically $d$-Dimensional VASS
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 variant of bin packing called multiple-choice vector bin packing. In this problem we are given a set of items, where each item can be selected in one of several $D$-dimensional incarnations. We are also given $T$ bin types,…
We introduce weighted one-deterministic-counter automata (ODCA). These are weighted one-counter automata (OCA) with the property of counter-determinacy, meaning that all paths labelled by a given word starting from the initial configuration…
In this paper we propose an improvement for flowpipe-construction-based reachability analysis techniques for hybrid systems. Such methods apply iterative successor computations to pave the reachable region of the state space by state sets…
In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…
The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…
We present a steady analytical solution of the incompressible Navier-Stokes equation for arbitrary viscosity in an arbitrary dimension $d$ of space. It represents a $d-1$ dimensional vortex "sheet" with an asymmetric profile of vorticity as…
The seven and nine dimensional geometries associated with certain classes of supersymmetric $AdS_3$ and $AdS_2$ solutions of type IIB and D=11 supergravity, respectively, have many similarities with Sasaki-Einstein geometry. We further…
We prove that any convex geometry $\mathcal{A}=(U,\mathcal{C})$ on $n$ points and any ideal $\mathcal{I}=(U',\mathcal{C}')$ of $\mathcal{A}$ can be realized as the intersection pattern of an open convex polyhedral cone $K\subseteq {\mathbb…
Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is…
The inaccessibility of a point p in a bounded domain D \subset R^n is the minimum of the lengths of segments through p with boundary at \bd D. The points of maximum inaccessibility I_D are those where the inaccessibility achieves its…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
In this article, we establish necessary and sufficient viability conditions for continuity inclusions over the 1-Wasserstein space. Depending on the regularity properties of the dynamics, we derive two results which are based on fairly…
The $d$-capacity of a graph $G$ is introduced as the maximum number of players that can simultaneously traverse $G$ such that each player visits all vertices while maintaining a distance of at least $d$ under various movement rules. We…
The {\sc Plane Diameter Completion} problem asks, given a plane graph $G$ and a positive integer $d$, if it is a spanning subgraph of a plane graph $H$ that has diameter at most $d$. We examine two variants of this problem where the input…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable control sets, which in general are assumed to be defined by…
This article deals with the existence of hypersurfaces minimizing general shape functionals under certain geometric constraints. We consider as admissible shapes orientable hypersurfaces satisfying a so-called reach condition, also known as…
For multipartite states we consider a notion of D-symmetry. For a system of $N$ qubits it concides with usual permutational symmetry. In case of $N$ qudits ($d\geq 3$) the D-symmetry is stronger than the permutational one. For the space of…
Dynamical realizations of the most general N=4 superconformal group in one dimension D(2,1;a) are reconsidered from the perspective of the R-symmetry subgroup SU(2). It is shown that any realization of the R-symmetry subalgebra in some…
In this paper we show that the $d$-dimensional algebraic connectivity of an arbitrary graph $G$ is bounded above by its $1$-dimensional algebraic connectivity, i.e., $a_d(G) \leq a_1(G)$, where $a_1(G)$ corresponds the well-studied second…