{"id":"n-8bfdd58279be42d7","revision":2,"first_index":0,"fingerprint":"f6-d272e4b2958d4a94","name":"Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","6"],["1","12","6"],["1","20","30"],["1","30","90","20"],["1","42","210","140"],["1","56","420","560","70"],["1","72","756","1680","630"],["1","90","1260","4200","3150","252"],["1","110","1980","9240","11550","2772"],["1","132","2970","18480","34650","16632","924"],["1","156","4290","34320","90090","72072","12012"],["1","182","6006","60060","210210","252252","84084","3432"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","3","7","19","51","141","393","1107","3139","8953","25653","73789","212941","616227"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A391403","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","-4"],["-1","4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":"e-b8fc68bdee02c71c","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-4"],["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":2,"source":"derived:gamma_polynomial","source_kind":"derived","equality_edge_id":"e-4502bda335658401","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-1"]]},"terms":[{"coeff":{"coeffs":[["1","0"],["-2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","4"],["1","-4"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160475,"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-14cbfe8df545ebf2","e-2126fae20f2e5116","e-e4032a9809c053c3"]},{"id":160476,"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-14cbfe8df545ebf2","e-2126fae20f2e5116","e-e4032a9809c053c3"]},{"id":160477,"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-14cbfe8df545ebf2","e-2126fae20f2e5116","e-e4032a9809c053c3"]}],"region_exact":{},"incoming_edges":[{"id":"e-4502bda335658401","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-8bfdd58279be42d7","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":"4b1dbfb2557f9280468fbcaafef5cb20985cb650a0f7e3147a909ece90f84afd","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-b8fc68bdee02c71c","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-8bfdd58279be42d7","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":"6d5a59f366954a22c8366cea9d27cff59f4eaef64af5d2d63f4fdfb6b0b8b9f9","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-e4032a9809c053c3","operation":{"index_shift":0,"operation":"gamma_polynomial","scale":"1"},"operation_detail":"scale 1, shift 0","conclusion_id":"n-8bfdd58279be42d7","premise_count":1,"theorem":"gamma criterion (RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff): if P = sum_j gamma_j x^j (1 + x)^(d - 2j) with deg Gamma <= d/2, then P is nonzero and real-rooted with roots in (-inf, 0] if and only if Gamma(z) = sum_j gamma_j z^j is; Gamma(c z) with c != 0 has the roots of Gamma divided by c","lean_route":null,"lean_declarations":[],"certificate_hash":"a0eea3b35414b51cd38f165b17a76f3f71512dff4443c8940bc7a92c5ef8ef23","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-b13531ad79e7c629","role":"sequence","name":"Square the entries of Pascal's triangle.","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]"}]},{"id":"e-14cbfe8df545ebf2","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-8bfdd58279be42d7","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"bf47614e64425c7b22649d40444f20703679b6a4db3cd1ecc7642b1e9fbee027","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-169bd483754ab390","role":"sequence","name":"Triangular array of Motzkin polynomial coefficients.","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]"}]},{"id":"e-2126fae20f2e5116","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"hadamard_multiplier\",\"factor\":{\"terms\":[{\"kind\":\"binomial\",\"index_offset\":0,\"coefficient_offset\":0}]}}"},"operation_detail":"hadamard_multiplier, shift 0","conclusion_id":"n-8bfdd58279be42d7","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":"b8c5f55917df763144235a87895da38a6d07b64a2d57068c6c6da3edb1820de5","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-75ccd0453a9b6cec","role":"sequence","name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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-0f1b9062159c7e91","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-1e7342ec7a250847","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2)."},{"id":"e-1cedba46f4fbf2b0","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-d213b8618e9a733e","conclusion_name":"theta_plus_one_squared of Triangular array of Motzkin polynomial coefficients."},{"id":"e-702433e45b2ced1d","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-61c7ae27dda08fe6","conclusion_name":"derivative of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2)."},{"id":"e-dd3a7d27a8ae2c9a","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-e21aec9025eacedd","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2)."},{"id":"e-e1819b2ee0295f94","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-906c3033a0728ce4","conclusion_name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2)."}],"used_by_total":5,"links":[{"id":"l-29a22b62aba28f7f","kind":"fingerprint_related","node_a_id":"n-8bfdd58279be42d7","node_b_id":"n-ce7f61ca1eb91390","fingerprint":"f6-d272e4b2958d4a94","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d272e4b2958d4a94"},"other_id":"n-ce7f61ca1eb91390","other":{"id":"n-ce7f61ca1eb91390","name":"gamma_polynomial of Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","first_index":0,"fingerprint":"f6-d272e4b2958d4a94","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["6","12"]],"card_rows":[["1"],["2"],["6","12"],["20","120"]],"row_sums_preview":["1","2","18","140","1330","12852","130284","1348776"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-fdc03fad975441d0","steps":["\u03b3"],"edges":["e-510754e51c3ada00"],"text":"A069466 \u2192 \u03b3"},"headline":"A069466 \u2192 \u03b3","chain":null}},{"id":"l-5eabc7e5f0d8e564","kind":"fingerprint_related","node_a_id":"n-4b168caf0bc63f8b","node_b_id":"n-8bfdd58279be42d7","fingerprint":"f6-d272e4b2958d4a94","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d272e4b2958d4a94"},"other_id":"n-4b168caf0bc63f8b","other":{"id":"n-4b168caf0bc63f8b","name":"T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-d272e4b2958d4a94","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","2"]],"card_rows":[["1"],["1"],["1","2"],["1","6"]],"row_sums_preview":["1","1","3","7","19","51","141","393"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A089627"],"derivation":{"root":"n-c914b69838ac70ec","steps":["\u2299 1/k! (shift -1)"],"edges":["e-4d3032ecd7423900"],"text":"A059344 \u2192 \u2299 1/k! (shift -1)"},"headline":"A089627: T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.","chain":"A059344 \u2192 \u2299 1/k! (shift -1)"}},{"id":"l-510b77c05796c8ea","kind":"oeis_match","node_a_id":"n-8bfdd58279be42d7","node_b_id":null,"fingerprint":null,"oeis_id":"A391403","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":14,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":14,"target":"triangle","terms_compared":56},"in_catalog":true,"oeis_id":"A391403","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9dfbf08b8f11a3a4","kind":"oeis_match","node_a_id":"n-8bfdd58279be42d7","node_b_id":null,"fingerprint":null,"oeis_id":"A002426","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A002426","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A391403","relation":"identification"},{"oeis_id":"A002426","relation":"match_row_sums"},{"oeis_id":"A391403","relation":"match_triangle"}],"bfiles":[{"node_id":"n-8bfdd58279be42d7","oeis_id":"A002426","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":30,"oeis_terms_available":30,"term_count":200,"raw_size":10239},{"node_id":"n-8bfdd58279be42d7","oeis_id":"A391403","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":56,"oeis_terms_agreeing":56,"oeis_terms_available":56,"term_count":992,"raw_size":18365}],"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;\n  2: 1,  2;\n  3: 1,  6;\n  4: 1, 12,   6;\n  5: 1, 20,  30;\n  6: 1, 30,  90,   20;\n  7: 1, 42, 210,  140;\n  8: 1, 56, 420,  560,  70;\n  9: 1, 72, 756, 1680, 630;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (2*n-1)*P(n-1,x) - (n-1-(4*n-4)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 1)*P[n - 1, x] - (n - 1 - (4*n - 4)*x)*P[n - 2, x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 1)*v[i - 1] - (n - 1 - (4*n - 4)*x)*v[i - 2])/(n)); 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":"A391403","target":"triangle","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;\n  2: 1,  2;\n  3: 1,  6;\n  4: 1, 12,   6;\n  5: 1, 20,  30;\n  6: 1, 30,  90,   20;\n  7: 1, 42, 210,  140;\n  8: 1, 56, 420,  560,  70;\n  9: 1, 72, 756, 1680, 630;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (2*n-1)*P(n-1,x) - (n-1-(4*n-4)*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n - 1)*P[n - 1, x] - (n - 1 - (4*n - 4)*x)*P[n - 2, x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((2*n - 1)*v[i - 1] - (n - 1 - (4*n - 4)*x)*v[i - 2])/(n)); 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}}],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["\u2299 C(n,k)"],"edges":["e-2126fae20f2e5116"],"text":"A011973 \u2192 \u2299 C(n,k)"},"headline":"A391403: Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).","chain":"A011973 \u2192 \u2299 C(n,k)"}