{"id":"n-4643327b1b00e955","revision":0,"first_index":0,"fingerprint":"f6-fe2eac7fb802bf9f","name":"reversal of basis_map_A013610 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","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":true,"rows":[["1"],["3","1"],["27","36","9"],["405","1215","1035","225"],["8505","45360","81270","55440","11025"],["229635","1913625","5868450","8079750","4788315","893025"],["7577955","90935460","425207475","976714200","1135664145","608855940","108056025"],["295540245","4827157335","31951184265","109951917075","209355601455","215672622165","107110838835","18261468225"],["13299311025","283718635200","2523913692300","12136852728000","34160183407350","56810278324800","53346327734700","24921704808000","4108830350625"],["678264862275","18313151281425","210714283880100","1348390546202700","5249719792166850","12769617199288950","19138833150336900","16688095660536300","7411923037393875","1187451971330625"],["38661097149675","1288703238322500","18621761793760125","152926117614270000","786003015332685150","2623017025331703000","5700745298512514250","7860340219922190000","6446882146585055175","2743388978865034500","428670161650355625"],["2435649120429525","98237847857324175","1741489121107110375","17846542360747225125","116958607833852234450","511877402357611440150","1515897461977569420750","3009230110499116754250","3872563612220544266025","3015908532312506505675","1236840759863452618875","189043541287806830625"],["168059789309637225","8066869886862586800","172130570872915104450","2152659167957219922000","17510964849371086268175","97190644306783021394400","375380070723628741871100","1009546635010573279620000","1859089617697250317353975","2256683839594230865618800","1680757626023894172204450","667332766316625106698000","100004033341249813400625"],["12604484198222791875","710052609833217275625","17951586494757749583750","269031044392363434431250","2658734343676093921363125","18233651353865655522189375","88897657996011544011832500","310328541828060959640937500","770398368208902073564048125","1331182299030348763267644375","1536484221698186353927083750","1100523473738680740630131250","424583281448484427691296875","62502520838281133375390625"],["1020963220056046141875","66702930376995014602500","1971706858643793110214375","34878221150459837635485000","411481113199796551330794375","3415143096202990565971057500","20493042134644997940634486875","89943004567165353315541830000","288631774817577507536931335625","669446176645747861452870277500","1094887117950677343090206533125","1209239398990810992003884685000","836672858152825498562360728125","314583916363845919590362062500","45564337691106946230659765625"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","72","2880","201600","21772800","3353011200","697426329600","188305108992000","64023737057280000","26761922089943040000","13488008733331292160000","8065829222532112711680000","5646080455772478898176000000","4573325169175707907522560000000"],"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":[["-3","1"],["6","-4"],["0","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":194184,"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-403ff85e4b47e4b2"]},{"id":194185,"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-403ff85e4b47e4b2"]},{"id":194186,"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-403ff85e4b47e4b2"]}],"region_exact":{},"incoming_edges":[{"id":"e-403ff85e4b47e4b2","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-4643327b1b00e955","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":"cc6361badb778d2c1f83685f19be4aed708c5ea9dc5a85f76d2a2bab876b5caf","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-77311ba2b23da2eb","role":"sequence","name":"basis_map_A013610 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","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-9e56970c0d605dcf","kind":"fingerprint_related","node_a_id":"n-77311ba2b23da2eb","node_b_id":"n-4643327b1b00e955","fingerprint":"f6-fe2eac7fb802bf9f","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-fe2eac7fb802bf9f"},"other_id":"n-77311ba2b23da2eb","other":{"id":"n-77311ba2b23da2eb","name":"basis_map_A013610 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","first_index":0,"fingerprint":"f6-fe2eac7fb802bf9f","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","3"],["9","36","27"]],"card_rows":[["1"],["1","3"],["9","36","27"],["225","1035","1215","405"]],"row_sums_preview":["1","4","72","2880","201600","21772800","3353011200","697426329600"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-1336d058dca9979e","steps":["basis A013610"],"edges":["e-05481f5802c9cdfa"],"text":"A204420 \u2192 basis A013610"},"headline":"A204420 \u2192 basis A013610","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:           27,             36,               9;\n  3:          405,           1215,            1035,              225;\n  4:         8505,          45360,           81270,            55440,            11025;\n  5:       229635,        1913625,         5868450,          8079750,          4788315,            893025;\n  6:      7577955,       90935460,       425207475,        976714200,       1135664145,         608855940,         108056025;\n  7:    295540245,     4827157335,     31951184265,     109951917075,     209355601455,      215672622165,      107110838835,       18261468225;\n  8:  13299311025,   283718635200,   2523913692300,   12136852728000,   34160183407350,    56810278324800,    53346327734700,    24921704808000,    4108830350625;\n  9: 678264862275, 18313151281425, 210714283880100, 1348390546202700, 5249719792166850, 12769617199288950, 19138833150336900, 16688095660536300, 7411923037393875, 1187451971330625;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (6*n-3+(4*n^2-4*n+1)*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[(6*n - 3 + (4*n^2 - 4*n + 1)*x)*P[n - 1, 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] = (6*n - 3 + (4*n^2 - 4*n + 1)*x)*v[i - 1]); 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-1336d058dca9979e","steps":["basis A013610","reverse"],"edges":["e-05481f5802c9cdfa","e-403ff85e4b47e4b2"],"text":"A204420 \u2192 basis A013610 \u2192 reverse"},"headline":"A204420 \u2192 basis A013610 \u2192 reverse","chain":null}