{"id":"n-dbc23e13bb290987","revision":1,"first_index":1,"fingerprint":"f6-3b37e384e5c5a5b6","name":"hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[["1","6","1"],["1","15","15","1"],["1","28","70","28","1"],["1","45","210","210","45","1"],["1","66","495","924","495","66","1"],["1","91","1001","3003","3003","1001","91","1"],["1","120","1820","8008","12870","8008","1820","120","1"],["1","153","3060","18564","43758","43758","18564","3060","153","1"],["1","190","4845","38760","125970","184756","125970","38760","4845","190","1"],["1","231","7315","74613","319770","646646","646646","319770","74613","7315","231","1"],["1","276","10626","134596","735471","1961256","2704156","1961256","735471","134596","10626","276","1"],["1","325","14950","230230","1562275","5311735","9657700","9657700","5311735","1562275","230230","14950","325","1"],["1","378","20475","376740","3108105","13123110","30421755","40116600","30421755","13123110","3108105","376740","20475","378","1"],["1","435","27405","593775","5852925","30045015","86493225","145422675","145422675","86493225","30045015","5852925","593775","27405","435","1"],["1","496","35960","906192","10518300","64512240","225792840","471435600","601080390","471435600","225792840","64512240","10518300","906192","35960","496","1"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["8","32","128","512","2048","8192","32768","131072","524288","2097152","8388608","33554432","134217728","536870912","2147483648"],"nonn":true,"definitions":[{"position":0,"source":"derived:hadamard_factor_parent_of:oeis_catalog:A155495","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1","6","1"],["1","15","15","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-e04d6ef53c0359bc","recurrence":{"first_index":1,"initial_polynomials":[["1","6","1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["1","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170187,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-ba35d8b1f440050c"]},{"id":170188,"position":1,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0)","region_exact":null,"edges":["e-399c824d392e2d5f","e-838a283cc5ec143f"]},{"id":170189,"position":2,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-399c824d392e2d5f","e-61d53e56ad54659d","e-838a283cc5ec143f"]},{"id":170190,"position":3,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-399c824d392e2d5f","e-61d53e56ad54659d","e-838a283cc5ec143f"]},{"id":170191,"position":4,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-399c824d392e2d5f"]},{"id":170192,"position":5,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 2","region_exact":null,"edges":["e-838a283cc5ec143f"]},{"id":170793,"position":6,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-61d53e56ad54659d"]}],"region_exact":{},"incoming_edges":[{"id":"e-e04d6ef53c0359bc","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-dbc23e13bb290987","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":"efa09676db58b07d9306edd24227b5788e9d63670445104483905c3f370b1aca","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-61d53e56ad54659d","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":2,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-dbc23e13bb290987","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":"7bc471c6e4f6c390ead3e3d1bdda975e165bc450e3b4e496aa8a08c094bf1197","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-dbc23e13bb290987","role":"sequence","name":"hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).","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-399c824d392e2d5f","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-dbc23e13bb290987","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"673c2f593f8c93df0b51a49cba45728d2a48e7578721d08f86abf9bc883dc67e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-838a283cc5ec143f","operation":{"operation":"theorem_check","theorem":"liu_wang_three_term"},"operation_detail":"liu_wang_three_term","conclusion_id":"n-dbc23e13bb290987","premise_count":0,"theorem":"L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)","lean_route":"sign","lean_declarations":["RealRooted.threeTerm_interlaces_of_eval_nonpos","RealRooted.threeTerm_interlaces","RealRooted.eval_nonpos_of_natDegree_le_two"],"certificate_hash":"02fe95b2b32fd81007b61e857d0f22109a336ea86b80df11e1b4e39b1796dd69","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":false,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-ba35d8b1f440050c","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-dbc23e13bb290987","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"107be62d6b42f4b46282dff3f8fc21baf8e9d9e3eee435af7f7f3c766c2b6203","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}}],"premises":[]}],"used_by":[{"id":"e-36ffcbd7e9178571","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-e6dc6f414384bbe9","conclusion_name":"basis_map_A008277 of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-42bba86233fadd35","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-1e01398e35510f54","conclusion_name":"basis_map_A013609 of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-b1566c9eddf7e689","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-c51d3e880faa56cc","conclusion_name":"basis_map_A013610 of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-b29ef1a8ff458698","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-2d5c09b3ab5c188a","conclusion_name":"shift_x_plus_one of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-b9b8c23af0e7fc0b","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-79be028962f4a4ca","conclusion_name":"basis_map_A013611 of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-883bba4ec6cabdf4","operation":"hadamard_factor","operation_detail":"binom(n+1, k)","conclusion_id":"n-b002679da3d71a0f","conclusion_name":"Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-2723acea9bb385ff","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-293e5a07b1a24e54","conclusion_name":"theta_plus_one_squared of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-61d53e56ad54659d","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-dbc23e13bb290987","conclusion_name":"hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-8bf4bd660b2f3192","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-2d5c09b3ab5c188a","conclusion_name":"shift_x_plus_one of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-9dc9bc8f119dca51","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-7c4b5a90bdd6f056","conclusion_name":"derivative of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-a994db8c29c107c2","operation":"preserver_image","operation_detail":"mobius, shift 0","conclusion_id":"n-537424a659b74b6c","conclusion_name":"mobius_x_over_x_plus_one of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-d0730d28b2ef30f3","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-cc847aaed4ff5433","conclusion_name":"theta_plus_one of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."},{"id":"e-d888e5f4c396a14c","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-798f7776a4245470","conclusion_name":"one_plus_derivative of hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m)."}],"used_by_total":13,"links":[{"id":"l-0c16148e2a6516a3","kind":"fingerprint_related","node_a_id":"n-f7935c36a3c0ec8c","node_b_id":"n-dbc23e13bb290987","fingerprint":"f6-3b37e384e5c5a5b6","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3b37e384e5c5a5b6"},"other_id":"n-f7935c36a3c0ec8c","other":{"id":"n-f7935c36a3c0ec8c","name":"Triangle read by rows: T(n, k) = binomial(2n, 2k).","first_index":1,"fingerprint":"f6-3b37e384e5c5a5b6","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","6","1"]],"card_rows":[["1"],["1","1"],["1","6","1"],["1","15","15","1"]],"row_sums_preview":["1","2","8","32","128","512","2048","8192"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A086645"],"derivation":{"root":"n-f7935c36a3c0ec8c","steps":[],"edges":[],"text":"A086645"},"headline":"A086645: Triangle read by rows: T(n, k) = binomial(2n, 2k).","chain":null}},{"id":"l-8f6cd2544cfadb2b","kind":"fingerprint_related","node_a_id":"n-a8ee0944a0199e83","node_b_id":"n-dbc23e13bb290987","fingerprint":"f6-3b37e384e5c5a5b6","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3b37e384e5c5a5b6"},"other_id":"n-a8ee0944a0199e83","other":{"id":"n-a8ee0944a0199e83","name":"veronese_section_2_0 of Even-numbered rows of Pascal's triangle.","first_index":0,"fingerprint":"f6-3b37e384e5c5a5b6","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","6","1"]],"card_rows":[["1"],["1","1"],["1","6","1"],["1","15","15","1"]],"row_sums_preview":["1","2","8","32","128","512","2048","8192"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-08f49539099949d5","steps":["Veronese 2"],"edges":["e-f72875fb5d524bf0"],"text":"A034870 \u2192 Veronese 2"},"headline":"A034870 \u2192 Veronese 2","chain":null}},{"id":"l-393503ce2e9f3c66","kind":"oeis_match","node_a_id":"n-dbc23e13bb290987","node_b_id":null,"fingerprint":null,"oeis_id":"A081294","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A081294","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-da62a1a644e5923c","kind":"oeis_match","node_a_id":"n-dbc23e13bb290987","node_b_id":null,"fingerprint":null,"oeis_id":"A004171","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A004171","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-f7f08bfc9bb9963f","kind":"oeis_match","node_a_id":"n-dbc23e13bb290987","node_b_id":null,"fingerprint":null,"oeis_id":"A081654","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A081654","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A004171","relation":"match_row_sums"},{"oeis_id":"A081294","relation":"match_row_sums"},{"oeis_id":"A081654","relation":"match_row_sums"}],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: 1,   6,    1;\n   2: 1,  15,   15,     1;\n   3: 1,  28,   70,    28,      1;\n   4: 1,  45,  210,   210,     45,      1;\n   5: 1,  66,  495,   924,    495,     66,      1;\n   6: 1,  91, 1001,  3003,   3003,   1001,     91,      1;\n   7: 1, 120, 1820,  8008,  12870,   8008,   1820,    120,     1;\n   8: 1, 153, 3060, 18564,  43758,  43758,  18564,   3060,   153,    1;\n   9: 1, 190, 4845, 38760, 125970, 184756, 125970,  38760,  4845,  190,   1;\n  10: 1, 231, 7315, 74613, 319770, 646646, 646646, 319770, 74613, 7315, 231, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+2*x)*P(n-1,x) - (1-2*x+x^2)*P(n-2,x) for n >= 3, with P(1,x) = 1 + 6*x + x^2, P(2,x) = 1 + 15*x + 15*x^2 + x^3.","mathematica":"P[1, x_] := 1 + 6*x + x^2;\nP[2, x_] := 1 + 15*x + 15*x^2 + x^3;\nP[n_, x_] := P[n, x] = Expand[(2 + 2*x)*P[n - 1, x] - (1 - 2*x + x^2)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1 + 6*x + x^2; v[2] = 1 + 15*x + 15*x^2 + x^3; for(n = 3, N, my(i = n); v[i] = (2 + 2*x)*v[i - 1] - (1 - 2*x + x^2)*v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-dbc23e13bb290987","steps":[],"edges":[],"text":"Hadamard-factor parent of A155495"},"headline":"hadamard_factor parent of Triangle read by rows: t(n,m) = binomial(2*n,2*m) * binomial(n,m).","chain":null}