This article documents the reasoning in a mathematical work by Mei Wending, one of the most prolific mathematicians in seventeenth-century China. Based on an analysis of the mathematical content, we present Mei’s systematic treatment of this particular genre of problems, fangcheng, and his efforts to refute the traditional practices in works that appeared earlier. His arguments were supported by the epistemological values he utilized to establish his system and refute the flaws in the traditional approaches. Moreover, in the context of the competition between the Chinese and Western approaches to mathematics, Mei was motivated to demonstrate that the genre of fangcheng problems was purely a “Chinese” achievement, not discussed by the Jesuits. Mei’s motivations were mostly expressed primarily in the prefaces to his works, in his correspondence with other scholars, in synopses of his poems, and in biographical records of some of his contemporaries.

Motivated by the search for a logic for polynomial time, we study rank logic (FPR) which extends fixed-point logic with counting (FPC) by operators that determine the rank of matrices over finite fields. While FPR can express most of the known queries that separate FPC from Ptime, almost nothing was known about the limitations of its expressive power.

In our first main result we show that the extensions of FPC by rank operators over different prime fields are incomparable. This solves an open question posed by Dawar and Holm and also implies that rank logic, in its original definition with a distinct rank operator for every field, fails to capture polynomial time. In particular we show that the variant of rank logic ${\text{FPR}}^{\text{*}}$ with an operator that uniformly expresses the matrix rank over finite fields is more expressive than FPR.

One important step in our proof is to consider solvability logic FPS which is the analogous extension of FPC by quantifiers which express the solvability problem for linear equation systems over finite fields. Solvability logic can easily be embedded into rank logic, but it is open whether it is a strict fragment. In our second main result we give a partial answer to this question: in the absence of counting, rank operators are strictly more expressive than solvability quantifiers.

By homotopy linear algebra we mean the study of linear functors between slices of the ∞-category of ∞-groupoids, subject to certain finiteness conditions. After some standard definitions and results, we assemble said slices into ∞-categories to model the duality between vector spaces and profinite-dimensional vector spaces, and set up a global notion of homotopy cardinality à la Baez, Hoffnung and Walker compatible with this duality. We needed these results to support our work on incidence algebras and Möbius inversion over ∞-groupoids; we hope that they can also be of independent interest.

This paper presents the design of a controller that allows a four-rotor helicopter to track a desired trajectory in 3D space. To this aim, a dynamic model obtained from Euler-Lagrange equations describes the robot. This model is represented by numerical methods, with which the control actions for the operation of the system are obtained. The proposed controller is simple and presents good performance in face of uncertainties in the model of the system to be controlled. Zero-convergence proof is included, and simulation results show a good performance of the control system.

A novel approach for trajectory tracking of a mobile-robots formation by using linear algebra theory and numerical methods is presented in this paper. The formation controller design is based on the formation states concept and the dynamic model of a unicycle-like nonholonomic mobile robot. The proposed control law designed is decentralized and scalable. Simulations and experimental results confirm the feasibility and the effectiveness of the proposed controller and the advantages of using the dynamic model of the mobile robot. By using this new strategy, the formation of mobile robots is able to change its configuration (shape and size) and follow different trajectories in a precise way, minimizing the tracking and formation errors.

A new approach for navigation of mobile robots in dynamic environments by using Linear Algebra Theory, Numerical Methods, and a modification of the Force Field Method is presented in this paper. The controller design is based on the dynamic model of a unicycle-like nonholonomic mobile robot. Previous studies very often ignore the dynamics of mobile robots and suffer from algorithmic singularities. Simulation and experimentation results confirm the feasibility and the effectiveness of the proposed controller and the advantages of the dynamic model use. By using this new strategy, the robot is able to adapt its behavior at the available knowing level and it can navigate in a safe way, minimizing the tracking error.