cpolinomi'a fu'ivla

x1 is a formal polynomial with coefficients x2 (ordered list) of degree x3 (li; nonnegative integer) over structure/ring x4 (to which coefficients x2 all belong) and in indeterminant x5.

x3 must be greater than or equal to the number of entries in x2; if these two values are not equal, then the explicitly mentioned entries of x2 are the values of the coefficients as will be described next, starting with the most important one; all the following coefficients (which are not explicitly mentioned) are xo'ei (taking appropriate values) until and including once the constant term's coefficient (when understood as a function) is reached. If x2 is presented as an ordered list, the entries represent the 'coefficients' of the particular polynomial and are specified in the order such that the ith entry/term is the (n-i+1)th 'coefficient', for all positive integers i which are less than or equal to n+1, where the ordering of 'coefficients' is determined by the exponent of the indeterminate associated therewith (when treated as a function); thus, the last entry is the constant term (when treated as a function), the penultimate term is the coefficient of the argument of x5 (when treated as a function), and the first term is the coefficient of the argument of x5 exponentiated by n (which is the degree x3 of the polynomial x1); in other words, the ith entry of x2 (where indexing of the ordered list starts at 1) is the coefficient of x(n-i+1), where x5 = x is the indeterminate. "ze'ai'au" enables for reversal of x2 so that the first-uttered term is the constant, the next-uttered term is the coefficient of the linear term, ..., and the last ((n+1)st) term is the coefficient of the most-significant term in the polynomial (xn). See also: "tefsujme'o" (brivla: polynomial function), "po'i'oi" (basically, the mekso equivalent to this word), "po'i'ei".


In notes:

tefsujme'o
m1 is a polynomial function in variable t2=s2 of degree (maximum power with nonzero coefficient) t3 interpreted by rules m2
po'i'oi (exp!)
mekso at-most-3-ary operator: convert to polynomial; X1 (ordered list of algebraic structure (probably field) elements) forms the (ordered list of) coefficients of a polynomial/Laurent-like series with respect to indeterminate X2 under ordering rule X3 (default for finite list: the first entry is the coefficient of the highest-degree term and each subsequent entry is the next lesser-degree coefficient via counting by ones and wherein the last entry is the constant term)