A Dice Rolling Game on a Set of Tori

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 68
  • Download : 0
Some linear algebraic and combinatorial problems are widely studied in connection with sigma-games. One particular issue is to characterize whether or not a given vector lies in the submodule generated by the rows of a given matrix over a commutative ring. In general, one can solve this problem easily and algorithmically using the linear algebra over commutative ring. However, if the matrix has some combinatorial structure, one may expect that some more can be asserted instead of merely giving an algorithm. A recent outstanding example appeared in this line of research is the paper by Florence and Meunier published in Journal of Algebraic Combinatorics in 2010. In the same spirit, we consider a matrix over Z(n) to completely characterize the submodule generated by its rows and give a constructive proof. The main idea for the characterization is to find certain good basic elements in the row space and then express a given element as the linear combination of them as well as some additional term.
Publisher
ELECTRONIC JOURNAL OF COMBINATORICS
Issue Date
2012-03
Language
English
Article Type
Article
Citation

ELECTRONIC JOURNAL OF COMBINATORICS, v.19, no.1, pp.1 - 15

ISSN
1077-8926
URI
http://hdl.handle.net/10203/261895
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0