Related papers: Combinatorics-Based Approaches to Controllability …
We consider a class of spin networks where each spin in a certain set interacts, via Ising coupling, with a set of central spins, and the control acts simultaneously on all the spins. This is a common situation for instance in NV centers in…
Goldman and Turaev found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of curves on a surface. When the surface has non-empty boundary, this vector space has a basis of cyclic reduced words in…
For linear control systems with bounded control range, the state space is compactified using the Poincar\'e sphere. The linearization of the induced control flow allows the construction of invariant manifolds on the sphere and of…
This paper is devoted to a study of linear, differential and topological classifications for linear controlled systems governed by ordinary differential equations. The necessary and sufficient conditions for the linear and topological…
We apply the method of controlled Lagrangians by potential shaping to Euler--Poincar\'e mechanical systems with broken symmetry. We assume that the configuration space is a general semidirect product Lie group $\mathsf{G} \ltimes V$ with a…
This paper proposes a new robust data-driven control method for linear systems with bounded disturbances, where the system model and disturbances are unknown. Due to disturbances, accurately determining the true system becomes challenging…
Quantum graphs have recently been introduced as model systems to study the spectral statistics of linear wave problems with chaotic classical limits. It is proposed here to generalise this approach by considering arbitrary, directed graphs…
The controllability issue of control-affine systems on smooth manifolds is one of the main problems in the theory, and it is recently known [Jouan P. Equivalence of control systems with linear systems on Lie groups and homogeneous spaces.…
Graph-structured combinatorial challenges are inherently difficult due to their nonlinear and intricate nature, often rendering traditional computational methods ineffective or expensive. However, these challenges can be more naturally…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
The distributed coordination problem of multi-agent systems is addressed in this paper under the assumption of intermittent communication between agents in the presence of time-varying communication delays. Specifically, we consider the…
In this paper, we give Maurer-Cartan characterizations as well as a cohomology theory for compatible Lie algebras. Explicitly, we first introduce the notion of a bidifferential graded Lie algebra and thus give Maurer-Cartan…
In this article, we study linear control systems on a 4-dimensional solvable Lie group. Our motivation stems from the model introduced in \cite{baspinar}, which presents a precise geometric framework in which the primary visual cortex $V1$…
In this paper we investigate a relaxed concept of controllability, known in the literature as herdability, namely the capability of a system to be driven towards the(interior of the) positive orthant. Specifically, we investigate…
There is a rich literature for modeling binary and polychotomous responses. However, existing methods are inadequate for handling combinatorial responses, where each response is an integer array under additional constraints. Such data are…
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
We show that observables in QED-type theories can be realized in terms of a combinatorial structure called chord diagrams. One advantage of this combinatorial representation is that it simplifies the study of the asymptotic behavior of…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…