1 citations · 2 across the 8 of their papers we have counts for
8 papers
Friendship theorem: A combinatorial proof
Vineeth Chintala
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which force…
Centrality and Partition of Idempotents
Vineeth Chintala
We show that an idempotent lies in the center if it commutes with the other idempotents in the ring. Next, we introduce a partition of the set of idempotents and show that the auto…
Two lives: Compositions of unimodular rows
Vineeth Chintala
The paper lays the foundation for the study of unimodular rows using Spin groups. We show that elementary orbits of unimodular rows (of any length ) are equivalent to elem…
Maximum number of solutions of in a finite noncommutative algebra
Vineeth Chintala
We obtain a bound on the number of solutions of in a finite noncommutative algebra over a field with elements. Furthermore, we completely characterize those rings for w…
A partition of finite rings makes lifting possible
Vineeth Chintala
We show that every finite ring has a partition, where each block corresponds to one idempotent. Remarkably, this partition provides a way to \emph{lift} a wide variety of special e…
On Suslin Matrices and their connection to Spin groups
Vineeth Chintala
A concrete representation of the Clifford algebra (for any hyperbolic quadratic space) is given using what are called Suslin matrices. This explicit construction is used to analyze…