-
Algorithms for the universal decomposition algebra
Let k be a field and let f be a polynomial of degree n in k [T]. The symmetric relations are the polynomials in k [X1, ..., Xn] that vanish on all permutations of the... -
Divided Differences & Restriction Operator on Paley-Wiener Spaces for N-Carle...
For a sequence of complex numbers $\Lambda$ we consider the restriction operator $R_{\Lambda}$ defined on Paley-Wiener spaces $PW_{\tau}^{p}$ ($1 -
Integer-valued polynomials over matrices and divided differences
International audience -
Newton-Scant method for functions with values in a cone
International audience -
Algebraic combinatorics on orders of permutations
This thesis comes within the scope of algebraic combinatorics and studies problems related to three orders on permutations: the two said weak orders (right and left)...
