Interface
#include <codecogs/maths/combinatorics/sequences/asm_triangle_row.h>
using namespace Maths::Combinatorics::Sequences;
| std::vector<int> | asm_triangle_row (int n)
Returns a row of the alternating sign matrix triangle. |
Use the following HTML code to embed the calculators within other websites:
Asm Triangle Row
For a given
n, the value of

represents entry

of the triangular matrix, and gives the
number of alternating sign matrices of order
n in which the (unique)
1 in row
i occurs in column
j.
For example, of alternating sign matrices of order 3, there are 2 with a leading 1 in column 1:
3 with a leading 1 in column 2:
and 2 with a leading 1 in column 3:
References:
SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.html
Example 1
#include <codecogs/maths/combinatorics/sequences/asm_triangle_row.h>
#include <iostream>
int main()
{
std::vector<int> result = Maths::Combinatorics::Sequences::asm_triangle_row(4);
std::cout << "Size of row: " << result.size() << std::endl;
for (int j = 0; j < result.size(); j++)
std::cout << result[j] << " ";
std::cout << std::endl;
return 0;
}
Output:
Size of row: 5
42 105 135 105 42
Returns
- the entries of the row
Authors
- Lucian Bentea (August 2005)
Source Code
Source code is available when you agree to a GP Licence or buy a Commercial Licence.
Not a member, then Register with CodeCogs. Already a Member, then Login.