Related papers: Control and its applications in additive combinato…
This is a brief introduction to control theory in finite-dimensional spaces. The material is partly based on my lectures for the Master 1 program in Math\'ematiques et applications at Sorbonne University, delivered over the past few years.…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…
This paper represents a new perspective in understanding the controllability of the Korteweg-de Vries (KdV) equation on unbounded domains. By studying the equation on both the right and left half-line with a single control input, we show…
Let $G$ be a semidirect product of a simply connected nilpotent Lie group and $\R$. For a left invariant control system on $G$ with a convex cone as a control domain, it is proved that the attainable sets coincides with a "halfspace" if the…
Necessary conditions for existence of normal extremals in optimal control of systems subject to nonholonomic constraints are derived as solutions of a constrained second order variational problems. In this work, a geometric interpretation…
Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions.…
We are discussing the theorem about the volume of a set $A$ of $Z^n$ having a small doubling property $|2A| < Ck, k=|A|$ and oher problems of Structure Theory of Set Addition (Additive Combinatorics).
A foundation is laid for a theory of combinatorial groupoids, allowing us to use concepts like ``holonomy'', ``parallel transport'', ``bundles'', ``combinatorial curvature'' etc. in the context of simplicial (polyhedral) complexes, posets,…
In this paper we establish several results on approximate controllability of a semilinear wave equation by making use of a single multiplicative control. These results are then applied to discuss the exact controllability properties for the…
The field of analytic combinatorics is dedicated to the creation of effective techniques to study the large-scale behaviour of combinatorial objects. Although classical results in analytic combinatorics are mainly concerned with univariate…
Analytic combinatorics studies asymptotic properties of families of combinatorial objects using complex analysis on their generating functions. In their reference book on the subject, Flajolet and Sedgewick describe a general approach that…
In optimal control theory the expression infimum gap means a strictly negative difference between the infimum value of a given minimum problem and the infimum value of a new problem obtained by the former by extending the original family V…
Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial…
In this article we study control problems with systems that are governed by ordinary differential equations whose vector fields depend linearly in the time derivatives of some components of the control. The remaining components are…
In a recent paper [Phys. Rev. E 57, p. 1550 (1998)] we demonstrated that the symmetries of the evolution equation and the target state have a profound effect on the selection of the admissible control parameters. In the present paper we…
In this paper we present an extension to the case of $L^1$-controls of a famous result by Ball--Marsden--Slemrod on the obstruction to the controllability of bilinear control systems in infinite dimensional spaces.
The purpose of this survey is to present analytic versions of the injectivity theorem and their applications. The proof of our injectivity theorems is based on a combination of the L^2-method for the dbar-equation and the theory of harmonic…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…
One reason for the well known fact that the Complex Langevin (CL) method sometimes fails to converge or converges to the wrong limit has been identified long ago: it is insufficient decay of the probability density either near infinity or…