{"id":"n-047228a38014e6d4","revision":2,"first_index":0,"fingerprint":"f6-509399d8a74ba170","name":"Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","1"],["1","4","1"],["1","10","10","1"],["1","20","50","20","1"],["1","35","175","175","35","1"],["1","56","490","980","490","56","1"],["1","84","1176","4116","4116","1176","84","1"],["1","120","2520","14112","24696","14112","2520","120","1"],["1","165","4950","41580","116424","116424","41580","4950","165","1"],["1","220","9075","108900","457380","731808","457380","108900","9075","220","1"],["1","286","15730","259545","1557270","3737448","3737448","1557270","259545","15730","286","1"],["1","364","26026","572572","4723719","16195608","24293412","16195608","4723719","572572","26026","364","1"],["1","455","41405","1184183","13026013","61408347","131589315","131589315","61408347","13026013","1184183","41405","455","1"],["1","560","63700","2318680","33157124","208416208","614083470","877262100","614083470","208416208","33157124","2318680","63700","560","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","6","22","92","422","2074","10754","58202","326240","1882960","11140560","67329992","414499438","2593341586"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A056939","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","1"]],"recurrence":{"denominator":{"coeffs":[["12"],["7"],["1"]]},"terms":[{"coeff":{"coeffs":[["12","0"],["9","12"],["-1","8"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","12","-12"],["0","9","-9"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["-2","-4","-2"],["2","4","2"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-77f09a180af02463","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["12"],["7"],["1"]]},"terms":[{"coeff":{"coeffs":[["12","0"],["7","10"],["1","10"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","24","0"],["0","3","-15"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","6","6"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160070,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-548c39a476f786f5","e-97ff2ea1491caf9e"]},{"id":160071,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-548c39a476f786f5","e-97ff2ea1491caf9e"]},{"id":160072,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-548c39a476f786f5","e-97ff2ea1491caf9e"]}],"region_exact":{},"incoming_edges":[{"id":"e-77f09a180af02463","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-047228a38014e6d4","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"66f11e496fa4ba8f0595acb06dedee36fdbd057637c57f3780b90521cec026d3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-548c39a476f786f5","operation":{"index_shift":1,"operation":"preserver_image","operator":"{\"shape\":\"hadamard_multiplier\",\"factor\":{\"terms\":[{\"kind\":\"binomial\",\"index_offset\":1,\"coefficient_offset\":1}]}}"},"operation_detail":"hadamard_multiplier, shift 1","conclusion_id":"n-047228a38014e6d4","premise_count":1,"theorem":"Polya--Schur characterization of multiplier sequences (G. Polya and I. Schur, J. Reine Angew. Math. 144 (1914) 89--113; stated as Theorem 40 of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601): a real sequence (lambda_k) is a multiplier sequence (x^k -> lambda_k x^k maps real-rooted polynomials to real-rooted polynomials or zero) iff sum_k binom(m,k) lambda_k x^k is real-rooted with zeros of one sign for every m, iff sum_k lambda_k x^k / k! (or its reflection) is C x^m e^(a x) prod (1 + alpha_j x) with a, alpha_j >= 0; a product of multiplier sequences is one (composition), and a nonzero factor lambda(n) of the row changes nothing","lean_route":null,"lean_declarations":[],"certificate_hash":"c635e21ceaec08cd8cf1d94a21a365bac9f8450c477e8915408fff704a040168","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-c963abfc0266d66c","role":"sequence","name":"Triangle of Dyck paths counted by number of long interior inclines.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]},{"id":"e-97ff2ea1491caf9e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-047228a38014e6d4","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"f4d81565aed689edbd163ede263c5ab8cddcb7fa4bd657a657f9445f25ce7dfb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-047228a38014e6d4","role":"sequence","name":"Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[{"id":"e-23b30ca6e404c664","operation":"gamma_polynomial","operation_detail":"scale 1, shift 0","conclusion_id":"n-7f59b8096b7b2635","conclusion_name":"gamma_polynomial of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-0c759266bd791ca5","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-563143c7a3f59683","conclusion_name":"shift_x_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-5336a01b25274fbd","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-8304b53a8f961041","conclusion_name":"one_plus_derivative of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-97ff2ea1491caf9e","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-047228a38014e6d4","conclusion_name":"Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-a929acd24243c7cc","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-33bd4b527bca505e","conclusion_name":"mobius_x_over_x_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-d09a0797aedc5af0","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-c8e1d395ac5ec819","conclusion_name":"derivative of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},{"id":"e-f6a16136bb4575f0","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-074c6703c2bee119","conclusion_name":"theta_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."}],"used_by_total":7,"links":[{"id":"l-3f6abdcdad6c3c63","kind":"fingerprint_related","node_a_id":"n-047228a38014e6d4","node_b_id":"n-05b91207a1ba3acf","fingerprint":"f6-509399d8a74ba170","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-509399d8a74ba170"},"other_id":"n-05b91207a1ba3acf","other":{"id":"n-05b91207a1ba3acf","name":"Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).","first_index":1,"fingerprint":"f6-509399d8a74ba170","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["30","120","30"],["60","600","600","60"],["105","2100","5250","2100","105"]],"card_rows":[["30","120","30"],["60","600","600","60"],["105","2100","5250","2100","105"],["168","5880","29400","29400","5880","168"]],"row_sums_preview":["180","1320","9660","70896","522648","3871440","28809990","215318400"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c963abfc0266d66c","steps":["\u2299 C(n+2,k+1) (shift +2)"],"edges":["e-aaeb3397827b8bbd"],"text":"A108838 \u2192 \u2299 C(n+2,k+1) (shift +2)"},"headline":"A108838 \u2192 \u2299 C(n+2,k+1) (shift +2)","chain":null}},{"id":"l-649ec727f02e3a78","kind":"oeis_match","node_a_id":"n-047228a38014e6d4","node_b_id":null,"fingerprint":null,"oeis_id":"A056939","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A056939","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-7a9cb3143ca3c1f0","kind":"oeis_match","node_a_id":"n-047228a38014e6d4","node_b_id":null,"fingerprint":null,"oeis_id":"A001181","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001181","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-e262365f7542994b","kind":"oeis_match","node_a_id":"n-047228a38014e6d4","node_b_id":null,"fingerprint":null,"oeis_id":"A056939","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":10,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":10,"target":"reversed_triangle","terms_compared":55},"in_catalog":true,"oeis_id":"A056939","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A056939","relation":"identification"},{"oeis_id":"A056939","relation":"match_reversed_triangle"},{"oeis_id":"A001181","relation":"match_row_sums"},{"oeis_id":"A056939","relation":"match_triangle"}],"bfiles":[{"node_id":"n-047228a38014e6d4","oeis_id":"A056939","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":19523},{"node_id":"n-047228a38014e6d4","oeis_id":"A056939","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":55,"oeis_terms_agreeing":55,"oeis_terms_available":55,"term_count":990,"raw_size":19523}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1,   1;\n  2: 1,   4,    1;\n  3: 1,  10,   10,     1;\n  4: 1,  20,   50,    20,      1;\n  5: 1,  35,  175,   175,     35,      1;\n  6: 1,  56,  490,   980,    490,     56,     1;\n  7: 1,  84, 1176,  4116,   4116,   1176,    84,    1;\n  8: 1, 120, 2520, 14112,  24696,  14112,  2520,  120,   1;\n  9: 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 1;\n","recurrence_sentence":"The row polynomials satisfy (n^2+7*n+12)*P(n,x) = -(n^2-9*n-12-(8*n^2+12*n)*x)*P(n-1,x) + ((9*n+12)*x-(9*n+12)*x^2)*d/dx P(n-1,x) + (2*n^2-2*n+(4*n^2-4*n)*x+(2*n^2-2*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*P[n - 1, x] + ((9*n + 12)*x - (9*n + 12)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*P[n - 2, x])/(n^2 + 7*n + 12)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*v[i - 1] + ((9*n + 12)*x - (9*n + 12)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*v[i - 2])/(n^2 + 7*n + 12)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A056939","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1,   1;\n  2: 1,   4,    1;\n  3: 1,  10,   10,     1;\n  4: 1,  20,   50,    20,      1;\n  5: 1,  35,  175,   175,     35,      1;\n  6: 1,  56,  490,   980,    490,     56,     1;\n  7: 1,  84, 1176,  4116,   4116,   1176,    84,    1;\n  8: 1, 120, 2520, 14112,  24696,  14112,  2520,  120,   1;\n  9: 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 1;\n","recurrence_sentence":"The row polynomials satisfy (n^2+7*n+12)*P(n,x) = -(n^2-9*n-12-(8*n^2+12*n)*x)*P(n-1,x) + ((9*n+12)*x-(9*n+12)*x^2)*d/dx P(n-1,x) + (2*n^2-2*n+(4*n^2-4*n)*x+(2*n^2-2*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*P[n - 1, x] + ((9*n + 12)*x - (9*n + 12)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*P[n - 2, x])/(n^2 + 7*n + 12)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*v[i - 1] + ((9*n + 12)*x - (9*n + 12)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*v[i - 2])/(n^2 + 7*n + 12)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A056939","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0: 1;\n  1: 1,   1;\n  2: 1,   4,    1;\n  3: 1,  10,   10,     1;\n  4: 1,  20,   50,    20,      1;\n  5: 1,  35,  175,   175,     35,      1;\n  6: 1,  56,  490,   980,    490,     56,     1;\n  7: 1,  84, 1176,  4116,   4116,   1176,    84,    1;\n  8: 1, 120, 2520, 14112,  24696,  14112,  2520,  120,   1;\n  9: 1, 165, 4950, 41580, 116424, 116424, 41580, 4950, 165, 1;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where (n^2+7*n+12)*P(n,x) = -(n^2-9*n-12-(8*n^2+12*n)*x)*P(n-1,x) + ((9*n+12)*x-(9*n+12)*x^2)*d/dx P(n-1,x) + (2*n^2-2*n+(4*n^2-4*n)*x+(2*n^2-2*n)*x^2)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*P[n - 1, x] + ((9*n + 12)*x - (9*n + 12)*x^2)*D[P[n - 1, x], x] + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*P[n - 2, x])/(n^2 + 7*n + 12)]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 - 9*n - 12 - (8*n^2 + 12*n)*x)*v[i - 1] + ((9*n + 12)*x - (9*n + 12)*x^2)*deriv(v[i - 1], x) + (2*n^2 - 2*n + (4*n^2 - 4*n)*x + (2*n^2 - 2*n)*x^2)*v[i - 2])/(n^2 + 7*n + 12)); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-c963abfc0266d66c","steps":["\u2299 C(n+1,k+1) (shift +1)"],"edges":["e-548c39a476f786f5"],"text":"A108838 \u2192 \u2299 C(n+1,k+1) (shift +1)"},"headline":"A056939: Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3.","chain":"A108838 \u2192 \u2299 C(n+1,k+1) (shift +1)"}