School of Technology and Computer Science Seminars
Affine Subspace Reachability Problems
by Prabhat Kumar Jha (STCS, TIFR)
Friday, November 15, 2019
from
to
(Asia/Kolkata)
at A-201 (STCS Seminar Room)
at A-201 (STCS Seminar Room)
Description |
Abstract: Given an n×n rational matrix A, a vector u∈Qn and an affine subspace W⊂Qn , the affine subspace reachability problem asks whether there exists t∈N such that Atu∈W. It is not known whether this problem is decidable or undecidable for the general case. In this talk, we will look at some decidable cases of this problem. One of the interesting cases is the following: Given algebraic real numbers x,y,|x|≤1,|y|≤1,x=cosθ, does there exist a natural number t such that y=costθ. This is a part of my master's project which is done under guidance of Piyush from STCS, TIFR, and Akshay from IIT Bombay. |
Organised by | Prerona Chatterjee |