A264048 -id:A264048 - cp's OEIS frontend

A264035 Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of integer partitions lambda of n such that there are k partitions mu such that the Gelfand-Tsetlin polytope for lambda and mu is non-integral.

1, 1, 2, 3, 5, 5, 2, 6, 4, 1, 7, 2, 3, 2, 1, 8, 2, 3, 2, 3, 3, 0, 1

Offset: 0

Christian Stump, Nov 01 2015

Row sums give A000041.

			Triangle begins:
1,
1,
2,
3,
5,
5,2,
6,4,1,
7,2,3,2,1,
8,2,3,2,3,3,0,1,
...

FindStat - Combinatorial Statistic Finder, Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight.
J. De Loera and T. B. McAllister, Vertices of Gelfand-Tsetlin polytopes, arXiv:math/0309329 [math.CO], 2003, MathSciNet:2096742.

Cf. A000041, A264047, A264048, A264049.

A264047 Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of integer partitions lambda of n such that there are k compositions mu such that the Gelfand-Tsetlin polytope for lambda and mu is non-integral.

Original entry on oeis.org

1, 1, 2, 3, 5, 5, 2, 6, 3, 0, 1, 0, 0, 1, 7, 1, 0, 0, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0, 0, 1, 1, 8, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 0

Christian Stump, Nov 01 2015

Row sums give A000041.

			Triangle begins:
1,
1,
2,
3,
5,
5,2,
6,3,0,1,0,0,1,
7,1,0,0,0,0,0,2,2,0,0,1,0,0,0,0,1,1,
8,1,0,0,0,0,0,0,2,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,0,1,2,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,
...

FindStat - Combinatorial Statistic Finder, Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight.
J. De Loera and T. B. McAllister, Vertices of Gelfand-Tsetlin polytopes, arXiv:math/0309329 [math.CO], 2003, MathSciNet:2096742.

Cf. A000041, A264035, A264048, A264049.

A264049 Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of integer partitions lambda of n such that there are k partitions mu such that the Gelfand-Tsetlin polytope for lambda and mu is integral.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 2, 0, 1, 1, 1, 2, 1, 2, 0, 1, 1, 1, 0, 1, 1, 1, 3, 0, 2, 2, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 3, 2, 2, 2, 0, 2, 0, 3, 0, 0, 2, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1

Offset: 1

Christian Stump, Nov 02 2015

Row sums give A000041, n >= 1.

			Triangle begins:
1,
1,1,
1,1,1,
1,1,1,1,1,
1,2,0,2,0,1,1,
1,2,1,2,0,1,1,1,0,1,1,
1,3,0,2,2,1,1,1,0,0,1,1,0,1,1,
1,3,2,2,2,0,2,0,3,0,0,2,0,0,1,0,1,0,1,0,1,1,
...

FindStat - Combinatorial Statistic Finder, Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight.
J. De Loera and T. B. McAllister, Vertices of Gelfand-Tsetlin polytopes, arXiv:math/0309329 [math.CO], 2003, MathSciNet:2096742.

Cf. A000041, A264035, A264047, A264048.

cp's OEIS Frontend

A264035 Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of integer partitions lambda of n such that there are k partitions mu such that the Gelfand-Tsetlin polytope for lambda and mu is non-integral.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A264047 Triangle read by rows: T(n,k) (n>=0, k>=0) is the number of integer partitions lambda of n such that there are k compositions mu such that the Gelfand-Tsetlin polytope for lambda and mu is non-integral.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A264049 Triangle read by rows: T(n,k) (n>=1, k>=1) is the number of integer partitions lambda of n such that there are k partitions mu such that the Gelfand-Tsetlin polytope for lambda and mu is integral.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs