Computational Aspects of Graph Coloring and the Quillen–Suslin Theorem
نویسنده
چکیده
We generalize both the Fibonacci and Lucas numbers to the context of graphcolorings, and prove some identities involving these numbers. As a corollary we obtain newproofs of some known identities involving Fibonacci numbers such asFr+s+t = Fr+1Fs+1Ft+1 + FrFsFt − Fr−1Fs−1Ft−1.
منابع مشابه
Applications of the Quillen-Suslin theorem to multidimensional systems theory
The purpose of this paper is to give four new applications of the Quillen-Suslin theorem to mathematical systems theory. Using a constructive version of the Quillen-Suslin theorem, also known as Serre’s conjecture, we show how to effectively compute flat outputs and injective parametrizations of flat multidimensional linear systems. We prove that a flat multidimensional linear system is algebra...
متن کاملA Computational Theory of Laurent Polynomial Rings and Multidimensional FIR Systems
A Computational Theory of Laurent Polynomial Rings and Multidimensional FIR Systems by HYUNG-JU PARK Doctor of Philosophy in Mathematics University of California at Berkeley A Laurent polynomial ring is a natural ground ring for the study of FIR (Finite Impulse Response) systems in signal processing since an FIR lter bank can be seen as a matrix over this ring, and the notion of perfect reconst...
متن کاملAn Algorithm for the Quillen-suslin Theorem for Monoid Rings
Let k be a field, and let M be a commutative, seminormal, finitely generated monoid, which is torsionfree, cancellative, and has no nontrivial units. J. Gubeladze proved that finitely generated projective modules over kM are free. This paper contains an algorithm for finding a free basis for a finitely generated projective module over kM . As applications one obtains alternative algorithms for ...
متن کاملAn Algorithm for the Quillen-Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals
This paper presents an algorithm for the Quillen-Suslin Theorem for quotients of polynomial rings by monomial ideals, that is, quotients of the form A = kx 0 ; :::;xn]=I, with I a monomial ideal and k a eld. T. Vorst proved that nitely generated projective modules over such algebras are free. Given a nitely generated module P, described by generators and relations, the algorithm tests whether P...
متن کاملA Note on Cancellation of Reflexive Modules
By the Quillen-Suslin theorem [Qui76, Sus76], we know that projective modules over a polynomial ring over a field are free. One way of saying this is, that if two projective modules of the same rank are stably isomorphic, then they are isomorphic. That, projective modules of given rank over polynomial rings are stably isomorphic was well known at the time Quillen and Suslin proved their theorem...
متن کامل