Please use this identifier to cite or link to this item:

`http://hdl.handle.net/10603/482066`

Title: | Unimodular polynomial matrices and partial linear transformations over finite fields |

Researcher: | Arora, Akansha |

Guide(s): | Ram, Samrith |

Keywords: | Mathematics Mathematics Interdisciplinary Applications Physical Sciences |

University: | Indraprastha Institute of Information Technology, Delhi (IIIT-Delhi) |

Completed Date: | 2022 |

Abstract: | This thesis consists of some interesting combinatorial problems on matrix poly- nomials over finite fields. Using results from control theory, we give a proof of a result of Lieb, Jordan and Helmke (2016) which solves the problem of counting the number of linear unimodular polynomial matrices over a finite field. This problem was essentially considered by Kociand#281;cki and Przyand#322;uski in an attempt to estimate the proportion of reachable linear systems over a finite field. As an appli- cation of our results, we give a new proof of a theorem of Chen and Tseng, which answers a question of Niederreiter on splitting subspaces. We use our results to affirmatively resolve a conjecture on the probability that a matrix polynomial is unimodular. We consider another enumerative problem on the similarity class of an arbitrary linear map defined on a subspace of a vector space over a finite field. Let V be a finite-dimensional vector space over the finite field Fq with q elements where q is a prime power and suppose W and Wf are subspaces of V . Two linear transformations T : W and#8594; V and Te : Wf and#8594; V are said to be similar if there exists a linear isomorphism S : V and#8594; V such that the following diagram commutes: W V Wf V T SW and#8771; S Te . In other words, we must have S and#9702;T = Teand#9702;SW where SW denotes the restriction of S to W. Given a linear map T defined on a subspace W of V , sometimes referred to as a partial linear map, we discuss the similarity invariants for T. We then give an explicit formula for the number of linear maps that are similar to T. The case where T is a linear operator on V (the case W = V ) is well-studied and we extend the result where W is an arbitrary subspace of V . In fact, the problem of counting the similarity class size of a linear operator T is equivalent to counting the number of square matrices over the finite field Fq in a conjugacy class. This problem has been studied by Kung (1981) and Stong (1988) among others, and an explicit formula due to Philip Hall is known. Our results extend the explicit formula of Phi |

Pagination: | 85 p. |

URI: | http://hdl.handle.net/10603/482066 |

Appears in Departments: | Department of Mathematics |

Files in This Item:

File | Description | Size | Format | |
---|---|---|---|---|

01_title.pdf | Attached File | 95.63 kB | Adobe PDF | View/Open |

02_prelim pages.pdf | 1.33 MB | Adobe PDF | View/Open | |

03_content.pdf | 389.71 kB | Adobe PDF | View/Open | |

04_abstract.pdf | 718.31 kB | Adobe PDF | View/Open | |

05_chapter 1.pdf | 3.6 MB | Adobe PDF | View/Open | |

06_chapter 2.pdf | 2.71 MB | Adobe PDF | View/Open | |

07_chapter 3.pdf | 2.9 MB | Adobe PDF | View/Open | |

08_chapter 4.pdf | 2.52 MB | Adobe PDF | View/Open | |

09_chapter 5.pdf | 7.36 MB | Adobe PDF | View/Open | |

10_annexures.pdf | 3.18 MB | Adobe PDF | View/Open | |

80_recommendation.pdf | 2.17 MB | Adobe PDF | View/Open |

Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: