2000 character limit reached
On an Algorithm for Obtaining All Binary Matrices of Special Class Related to V. E. Tarakanov's Formula
Published 1 Dec 2013 in cs.DS and math.CO | (1312.0186v1)
Abstract: An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has been obtained. This formula is known and has been obtained using other methods, which by their nature are purely analytical and not constructive. Thus a new, constructive proof of this known formula has been obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.