{"id":"n-dcce4b7f491234bd","revision":0,"first_index":0,"fingerprint":"f6-85f6fce8b02c5e6d","name":"basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":true,"rows":[["1"],["-3","3"],["6","-12","6"],["-10","30","-30","10"],["15","-60","90","-60","15"],["-21","105","-210","210","-105","21"],["28","-168","420","-560","420","-168","28"],["-36","252","-756","1260","-1260","756","-252","36"],["45","-360","1260","-2520","3150","-2520","1260","-360","45"],["-55","495","-1980","4620","-6930","6930","-4620","1980","-495","55"],["66","-660","2970","-7920","13860","-16632","13860","-7920","2970","-660","66"],["-78","858","-4290","12870","-25740","36036","-36036","25740","-12870","4290","-858","78"],["91","-1092","6006","-20020","45045","-72072","84084","-72072","45045","-20020","6006","-1092","91"],["-105","1365","-8190","30030","-75075","135135","-180180","180180","-135135","75075","-30030","8190","-1365","105"],["120","-1680","10920","-43680","120120","-240240","360360","-411840","360360","-240240","120120","-43680","10920","-1680","120"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","0","0","0","0","0","0","0","0","0","0","0","0","0","0"],"nonn":false,"definitions":[{"position":0,"source":"derived:basis_map_coefficients_of:oeis_catalog:A127773","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-1"]]},"terms":[{"coeff":{"coeffs":[["2","-2"],["1","-1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":170180,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]","region_exact":null,"edges":["e-6f68008f7e8d0084"]},{"id":170181,"position":1,"claim":"real_rooted","from_index":0,"region_key":"[0, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [0, +inf)","region_exact":null,"edges":["e-28eedc8c208dfa0c"]},{"id":170182,"position":2,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":true,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n(-x) have one sign","region_exact":null,"edges":["e-28eedc8c208dfa0c"]},{"id":170183,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"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 >= 1","region_exact":null,"edges":["e-28eedc8c208dfa0c"]}],"region_exact":{},"incoming_edges":[{"id":"e-6f68008f7e8d0084","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"-1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-dcce4b7f491234bd","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":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"a73881bc6142983f9c8e742e2c3ff22d556c8f4716754cb9a4f8973fcb16ba77","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"1"}}}],"premises":[{"position":0,"node_id":"n-511a2225fa2191c9","role":"sequence","name":"Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.","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-28eedc8c208dfa0c","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-dcce4b7f491234bd","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity; for R = [0, inf) the reflection x -> -x maps the rows to rows with every root in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"a17f4607fa5829bcc39e89ff04d5bf5f2b119a619e0e20ac7fb5e55c3b6179da","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-c670888797b52216","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-511a2225fa2191c9","conclusion_name":"Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2."}],"used_by_total":1,"links":[{"id":"l-17d7840258b03f9d","kind":"fingerprint_related","node_a_id":"n-50902364601606aa","node_b_id":"n-dcce4b7f491234bd","fingerprint":"f6-85f6fce8b02c5e6d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-85f6fce8b02c5e6d"},"other_id":"n-50902364601606aa","other":{"id":"n-50902364601606aa","name":"basis-map coefficients of Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.","first_index":0,"fingerprint":"f6-85f6fce8b02c5e6d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":1,"preview_rows":[["1"],["-1","1"],["1","-2","1"]],"card_rows":[["1"],["-1","1"],["1","-2","1"],["-1","3","-3","1"]],"row_sums_preview":["1","0","0","0","0","0","0","0"],"regions":["(-inf, 1]","[0, +inf)"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6fea5aff4f44fa54","steps":["x \u21a6 x\u22121"],"edges":["e-0ba23af98afc4615"],"text":"A023531 \u2192 x \u21a6 x\u22121"},"headline":"A023531 \u2192 x \u21a6 x\u22121","chain":null}},{"id":"l-1a28aa25204c4862","kind":"fingerprint_related","node_a_id":"n-6c0f994846d774ff","node_b_id":"n-dcce4b7f491234bd","fingerprint":"f6-85f6fce8b02c5e6d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-85f6fce8b02c5e6d"},"other_id":"n-6c0f994846d774ff","other":{"id":"n-6c0f994846d774ff","name":"Triangle read by rows: lower triangular matrix which is inverse to Pascal's triangle (A007318) regarded as a lower triangular matrix.","first_index":1,"fingerprint":"f6-85f6fce8b02c5e6d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":1,"preview_rows":[["1"],["-1","1"],["1","-2","1"]],"card_rows":[["1"],["-1","1"],["1","-2","1"],["-1","3","-3","1"]],"row_sums_preview":["1","0","0","0","0","0","0","0"],"regions":["(-inf, +inf)","[0, +inf)"],"region_exact":{},"oeis_ids":["A130595"],"derivation":{"root":"n-6c0f994846d774ff","steps":[],"edges":[],"text":"A130595"},"headline":"A130595: Triangle read by rows: lower triangular matrix which is inverse to Pascal's triangle (A007318) regarded as a lower triangular matrix.","chain":null}},{"id":"l-9e5469d9d086c87e","kind":"fingerprint_related","node_a_id":"n-95a5652eb8c6128a","node_b_id":"n-dcce4b7f491234bd","fingerprint":"f6-85f6fce8b02c5e6d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-85f6fce8b02c5e6d"},"other_id":"n-95a5652eb8c6128a","other":{"id":"n-95a5652eb8c6128a","name":"Triangle of coefficients in expansion of x^n in terms of Laguerre polynomials L_n(x).","first_index":1,"fingerprint":"f6-85f6fce8b02c5e6d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":1,"preview_rows":[["1"],["1","-1"],["2","-4","2"]],"card_rows":[["1"],["1","-1"],["2","-4","2"],["6","-18","18","-6"]],"row_sums_preview":["1","0","0","0","0","0","0","0"],"regions":["(-inf, +inf)","[0, +inf)"],"region_exact":{},"oeis_ids":["A021012"],"derivation":{"root":"n-95a5652eb8c6128a","steps":[],"edges":[],"text":"A021012"},"headline":"A021012: Triangle of coefficients in expansion of x^n in terms of Laguerre polynomials L_n(x).","chain":null}}],"oeis":[],"bfiles":[],"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:  -3,    3;\n  2:   6,  -12,     6;\n  3: -10,   30,   -30,    10;\n  4:  15,  -60,    90,   -60,    15;\n  5: -21,  105,  -210,   210,  -105,    21;\n  6:  28, -168,   420,  -560,   420,  -168,    28;\n  7: -36,  252,  -756,  1260, -1260,   756,  -252,   36;\n  8:  45, -360,  1260, -2520,  3150, -2520,  1260, -360,   45;\n  9: -55,  495, -1980,  4620, -6930,  6930, -4620, 1980, -495, 55;\n","recurrence_sentence":"The row polynomials satisfy -n*P(n,x) = (n+2-(n+2)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((n + 2 - (n + 2)*x)*P[n - 1, x])/(-n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n + 2 - (n + 2)*x)*v[i - 1])/(-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-dcce4b7f491234bd","steps":[],"edges":[],"text":"basis-map coefficients of A127773"},"headline":"basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.","chain":null}