Tame Decompositions and Collisions

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The tame case, where the characteristic p of Fq does not divide n = deg f, is fairly well-understood, and we have reasonable bounds on the number of decomposables of degree n. Nevertheless, no exact formula is known if $n$ has more than two prime factors. In order to count the decomposables, one wants to know, under a suitable normalization, the number of collisions, where essentially different (g, h) yield the same f. In the tame case, Ritt's Second Theorem classifies all 2-collisions. We introduce a normal form for multi-collisions of decompositions of arbitrary length with exact description of the (non)uniqueness of the parameters. We obtain an efficiently computable formula for the exact number of such collisions at degree n over a finite field of characteristic coprime to p. This leads to an algorithm for the exact number of decomposable polynomials at degree n over a finite field Fq in the tame case

Block Toeplitz determinants, constrained KP and Gelfand-Dickey hierarchies

We propose a method for computing any Gelfand-Dickey tau function living in Segal-Wilson Grassmannian as the asymptotics of block Toeplitz determinant associated to a certain class of symbols. Also truncated block Toeplitz determinants associated to the same symbols are shown to be tau function for rational reductions of KP. Connection with Riemann-Hilbert problems is investigated both from the point of view of integrable systems and block Toeplitz operator theory. Examples of applications to algebro-geometric solutions are given.Comment: 35 pages. Typos corrected, some changes in the introductio

Some numerical challenges in control theory

We discuss a number of novel issues in the interdisciplinary area of numerical linear algebra and control theory. Although we do not claim to be exhaustive we give a number of problems which we believe will play an important role in the near future. These are: sparse matrices, structured matrices, novel matrix decompositions and numerical shortcuts. Each of those is presented in relation to a particular (class of) control problems. These are respectively: large scale control systems, polynomial system models, control of periodic systems, and normalized coprime factorizations in robust control

Optimal robust fault detection

This dissertation gives complete, analytic, and optimal solutions to several robust fault detection problems for both continuous and discrete linear systems that have been considered in the research community in the last twenty years. It is shown that several well-recognized robust fault detection problems, such as H_minus\H_2, H_2\ H_infinity and H_infinity\H_infinity problems, have a very simple optimal solution in an observer form by solving a standard algebraic Riccati equation. The optimal solutions to some other robust fault detection problems, such as H_minus\H_2 and H_2\H_2 problems are also given. In addition, it is shown that some well-studied and seeming sensible optimization criteria for fault detection filter design could lead to (optimal but) useless fault detection filter designs

Robust controller design for flexible structures using normalized coprime factor plant descriptions

Stabilization is a fundamental requirement in the design of feedback compensators for flexible structures. The search for the largest neighborhood around a given design plant for which a single controller produces closed-loop stability can be formulated as an H(sub infinity) control problem. The use of normalized coprime factor plant descriptions, in which the plant perturbations are defined as additive modifications to the coprime factors, leads to a closed-form expression for the maximum neighborhood boundary allowing optimal and suboptimal H(sub infinity) compensators to be computed directly without the usual gamma iteration. A summary of the theory on robust stabilization using normalized coprime factor plant descriptions is presented, and the application of the theory to the computation of robustly stable compensators for the phase version of the Control-Structures Interaction (CSI) Evolutionary Model is described. Results from the application indicate that the suboptimal version of the theory has the potential of providing the bases for the computation of low-authority compensators that are robustly stable to expected variations in design model parameters and additive unmodeled dynamics

Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets

We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov and Mosca. Their algorithm takes as input an exactly synthesizable single-qubit unitary--one which can be expressed without error as a product of Clifford and T gates--and outputs a sequence of gates which implements it. The algorithm is optimal in the sense that the length of the sequence, measured by the number of T gates, is smallest possible. In this paper, for each positive even integer $n$ we consider the "Clifford-cyclotomic" gate set consisting of the Clifford group plus a z-rotation by $\frac{\pi}{n}$. We present an efficient exact synthesis algorithm which outputs a decomposition using the minimum number of $\frac{\pi}{n}$ z-rotations. For the Clifford+T case $n=4$ the group of exactly synthesizable unitaries was shown to be equal to the group of unitaries with entries over the ring $\mathbb{Z}[e^{i\frac{\pi}{n}},1/2]$. We prove that this characterization holds for a handful of other small values of $n$ but the fraction of positive even integers for which it fails to hold is 100%.Comment: v2: published versio