{"id":"n-817edc0b1e94c6f2","revision":0,"first_index":0,"fingerprint":"f6-0a12f7fa088d0629","name":"reversal of Triangle of third-order Eulerian numbers: 3-Stirling permutations enumerated by ascents.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","1"],["15","12","1"],["105","141","33","1"],["945","1830","786","78","1"],["10395","26685","17538","3450","171","1"],["135135","435960","396495","125352","13257","360","1"],["2027025","7921305","9356175","4238811","753291","46971","741","1"],["34459425","158799690","233216460","140913270","37013166","4046526","157956","1506","1"],["654729075","3486128625","6167943180","4732607160","1696782438","282182454","20135004","513024","3039","1"],["13749310575","83242120500","173237850765","162926117280","75547811070","17517438432","1954557378","94904688","1627203","6108","1"],["316234143225","2149053308325","5163367474125","5795219706165","3343199837130","1019322953586","161786794554","12619927530","430062045","5077065","12249","1"],["7905853580625","59670195735150","163050508192950","213899826513870","149109772632255","57325287304620","12150651306276","1374558448284","77291685135","1892868390","15659910","24534","1"],["213458046676875","1773541577132325","5444507086417350","8210550385538550","6761401216738605","3176397147438135","859573791544068","131789546385588","10952559669429","454601687715","8150890230","47912022","49107","1"],["6190283353629375","56194659967446000","191835760181658075","328071697374241800","313442294393298015","175611515180282640","58672657030985595","11621014002233712","1327771532467989","82990222149744","2590893157545","34520041800","145749453","98256","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","28","280","3640","58240","1106560","24344320","608608000","17041024000","528271744000","17961239296000","664565853952000","26582634158080000","1143053268797440000"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":187254,"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-ceb48f8d730c7103"]},{"id":187255,"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-ceb48f8d730c7103"]},{"id":187256,"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-ceb48f8d730c7103"]}],"region_exact":{},"incoming_edges":[{"id":"e-ceb48f8d730c7103","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-817edc0b1e94c6f2","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":"1308c9f024e879955637290b6374b39b5e034297190b6363fce690281dedc1a3","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-86fb6463ff8368f2","role":"sequence","name":"Triangle of third-order Eulerian numbers: 3-Stirling permutations enumerated by ascents.","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":[],"used_by_total":0,"links":[{"id":"l-15796df40d7dd29b","kind":"fingerprint_related","node_a_id":"n-86fb6463ff8368f2","node_b_id":"n-817edc0b1e94c6f2","fingerprint":"f6-0a12f7fa088d0629","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-0a12f7fa088d0629"},"other_id":"n-86fb6463ff8368f2","other":{"id":"n-86fb6463ff8368f2","name":"Triangle of third-order Eulerian numbers: 3-Stirling permutations enumerated by ascents.","first_index":0,"fingerprint":"f6-0a12f7fa088d0629","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","3"],["1","12","15"]],"card_rows":[["1"],["1","3"],["1","12","15"],["1","33","141","105"]],"row_sums_preview":["1","4","28","280","3640","58240","1106560","24344320"],"regions":["(-inf, 0)"],"region_exact":{},"oeis_ids":["A219512"],"derivation":{"root":"n-86fb6463ff8368f2","steps":[],"edges":[],"text":"A219512"},"headline":"A219512: Triangle of third-order Eulerian numbers: 3-Stirling permutations enumerated by ascents.","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,          1;\n  2:        15,         12,          1;\n  3:       105,        141,         33,          1;\n  4:       945,       1830,        786,         78,          1;\n  5:     10395,      26685,      17538,       3450,        171,         1;\n  6:    135135,     435960,     396495,     125352,      13257,       360,        1;\n  7:   2027025,    7921305,    9356175,    4238811,     753291,     46971,      741,      1;\n  8:  34459425,  158799690,  233216460,  140913270,   37013166,   4046526,   157956,   1506,    1;\n  9: 654729075, 3486128625, 6167943180, 4732607160, 1696782438, 282182454, 20135004, 513024, 3039, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+1+n*x)*P(n-1,x) + (x-x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(2*n + 1 + n*x)*P[n - 1, x] + (x - x^2)*D[P[n - 1, x], x]];\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] = (2*n + 1 + n*x)*v[i - 1] + (x - x^2)*deriv(v[i - 1], x)); 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-86fb6463ff8368f2","steps":["reverse"],"edges":["e-ceb48f8d730c7103"],"text":"A219512 \u2192 reverse"},"headline":"A219512 \u2192 reverse","chain":null}