A classification of restrictive polynomial correspondences

Authors

  • Bharath Krishna Seshadri Indian Institute of Science Education and Research Thiruvananthapuram (IISER-TVM) Author https://orcid.org/0009-0004-0541-8040
  • Shrihari Sridharan Indian Institute of Science Education and Research Thiruvananthapuram (IISER-TVM) Author

DOI:

https://doi.org/10.2298/FIL2609153S

Keywords:

Restrictive polynomial correspondence, Full rank factorisation of a matrix, Symmetries in a correspondence, Reducible and irreducible correspondences

Abstract

In this manuscript, we study a special class of correspondences on $\mathbb{P}^{1} \times \mathbb{P}^{1}$, namely polynomial correspondences. We focus on what we call restrictive polynomial correspondence, categorise them into reducible and irreducible ones. We further give characterising results for reducible and irreducible restrictive polynomial correspondences. We also define an operation that paves the way to obtain a new irreducible restrictive polynomial correspondence from any two given irreducible restrictive polynomial correspondences. 

Downloads

Published

2026-04-15

Issue

Section

Articles