{"id":"n-fc7946291cba5bcb","revision":1,"first_index":0,"fingerprint":"f6-4ea5ca3eaff29aa3","name":"basis_map_A013611 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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"],["2","4"],["5","20","16"],["14","84","144","64"],["43","344","912","896","256"],["142","1420","5120","8000","5120","1024"],["499","5988","27360","59200","61440","27648","4096"],["1850","25900","143472","398720","582400","430080","143360","16384"],["7193","115088","749728","2551808","4847360","5103616","2809856","720896","65536"],["29186","525348","3936384","15883392","37320192","51674112","40943616","17399808","3538944","262144"],["123109","2462180","20864880","97468800","273665280","473066496","497602560","306216960","103219200","17039360","1048576"],["538078","11837716","111956240","594686400","1945743360","4050342912","5363871744","4414586880","2162688000","591134720","80740352","4194304"],["2430355","58328520","609112944","3627409280","13569177600","33128663040","53217669120","55547559936","36592680960","14562099200","3287285760","377487360","16777216"],["11317646","294258796","3363225216","22201406656","93541859840","262533832704","497732911104","634406682624","533228027904","286397562880","94166319104","17829986304","1744830464","67108864"],["54229907","1518437396","18855036928","136685907904","640913937664","2035504959488","4460121329664","6749182083072","6968260755456","4797833936896","2133886763008","588171444224","94657052672","7985954816","268435456"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","41","306","2451","20826","186231","1742166","16971081","171513126","1792777401","19332320706","214596681291","2447519330106","28633900264551"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013611","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-4"],["1","4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":167830,"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-c30c93b8b626794f"]},{"id":167831,"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-c30c93b8b626794f"]},{"id":167832,"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-c30c93b8b626794f"]},{"id":167833,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-c30c93b8b626794f"]}],"region_exact":{},"incoming_edges":[{"id":"e-c30c93b8b626794f","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-fc7946291cba5bcb","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"67320f7954d4e1e51b944afd8bf9452498060fab05ce8320d2f65afac87cc5b1","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-07e5356ad37f61ea","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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":[],"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:     2,      4;\n  2:     5,     20,      16;\n  3:    14,     84,     144,       64;\n  4:    43,    344,     912,      896,      256;\n  5:   142,   1420,    5120,     8000,     5120,     1024;\n  6:   499,   5988,   27360,    59200,    61440,    27648,     4096;\n  7:  1850,  25900,  143472,   398720,   582400,   430080,   143360,    16384;\n  8:  7193, 115088,  749728,  2551808,  4847360,  5103616,  2809856,   720896,   65536;\n  9: 29186, 525348, 3936384, 15883392, 37320192, 51674112, 40943616, 17399808, 3538944, 262144;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n-1+(4*n-4)*x)*P(n-2,x) + (2+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 4*x;\nP[n_, x_] := P[n, x] = Expand[(n - 1 + (4*n - 4)*x)*P[n - 2, x] + (2 + 4*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; v[2] = 2 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (n - 1 + (4*n - 4)*x)*v[i - 2] + (2 + 4*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-07e5356ad37f61ea","steps":["basis A013611"],"edges":["e-c30c93b8b626794f"],"text":"A100862 \u2192 basis A013611"},"headline":"A100862 \u2192 basis A013611","chain":null}