Related papers: Reducing complexity of tail-biting trellises
We show a local rigidity result for the integrability of symplectic billiards. We prove that any domain which is close to an ellipse, and for which the symplectic billiard map is rationally integrable must be an ellipse as well. This is in…
We consider pure traction problems and we show that incompressible linearized elasticity can be obtained as variational limit of incompressible finite elasticity under suitable conditions on external loads.
In this paper, we consider the problem of tuning the edge weights of a networked system described by linear time-invariant dynamics. We assume that the topology of the underlying network is fixed and that the set of feasible edge weights is…
This paper completely solves the controllability problems of two-dimensional multi-input discrete-time bilinear systems with and without drift. Necessary and sufficient conditions for controllability, which cover the existing results, are…
We consider the problem of finding local minimizers in non-convex and non-smooth optimization. Under the assumption of strict saddle points, positive results have been derived for first-order methods. We present the first known results for…
We formulate a general family of entanglement criteria for multipartite systems. Fisher information criteria compare the sensitivity to unitary rotations with the variances of suitable local observables. Generalized squeezing-type criteria…
In this paper, we propose a new approach to design globally convergent reduced-order observers for nonlinear control systems via contraction analysis and convex optimization. Despite the fact that contraction is a concept naturally suitable…
The controllability and observability of Boolean control network(BCN) are two fundamental properties. But the verification of latter is much harder than the former. This paper considers the observability of BCN via controllability. First,…
Analytical and numerical arguments are presented in case of a pair of two-state systems in a singlet state that the threshold visibility for testing Bell's theorem on the entire range of measurement settings is 33.3%. It is also shown that…
We present a comprehensive classical and parameterized complexity analysis of decision tree pruning operations, extending recent research on the complexity of learning small decision trees. Thereby, we offer new insights into the…
Control synthesis under constraints is at the forefront of research on autonomous systems, in part due to its broad application from low-level control to high-level planning, where computing control inputs is typically cast as a constrained…
We prove a version of the local Tb Theorem assuming that the accretive functions b_Q and T b_Q are locally L ^{p} integrable, for any 1< p < \infty . This improves a recent result of Hytonen-Nazarov. The proof strategy relies upon the their…
We prove the exact controllability result to trajectories of a simplified model of motion of a rigid body in fluid flow. Unlike a previously know results such a trajectory does not need to be a stationary solution.
In this paper, we introduce the notion of a t-norm on bounded pseudo-ordered sets and in particular on bounded trellises (also known as weakly associative lattices), and provide some basic examples. The impact of abandoning transitivity is…
It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length $n$ after it passes through a deletion channel many times independently, producing a set of traces (i.e., random subsequences of the…
An influential line of recent work has focused on the generalization properties of unregularized gradient-based learning procedures applied to separable linear classification with exponentially-tailed loss functions. The ability of such…
We study boundary regional controllability problems for a class of semilinear fractional systems. Sufficient conditions for regional boundary controllability are proved by assuming that the associated linear system is approximately…
Link (edge) addition/deletion or sensor/actuator failures are common structural perturbations for real network systems. This paper is related to the computation complexity of minimal (cost) link insertion, deletion and vertex deletion with…
We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical…