Sur l'algèbre enveloppante d'une algèbre pré-Lie

We construct an associative product on the symmetric module $S(L)$ of any pre-Lie algebra L. It turns $S(L)$ into a Hopf algebra which is isomorphic to the envelopping algebra of $L_{\mathrm{Lie}}$. Then we prove that in the case of rooted trees our construction is dual to that of Connes and Kreimer. We also show that symmetric brace algebras and pre-Lie algebras are the same. Finally, we give a similar interpretation of the Hopf algebra of planar rooted trees. To cite this article: J.-M. Oudom, D. Guin, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Representations of polynomial Rota–Baxter algebras

A Rota–Baxter operator is an algebraic abstraction of integration, which is the typical example of a weight zero Rota–Baxter operator. We show that studying the modules over the polynomial Rota–Baxter algebra $(\mathbf{k}[x],P)$ is equivalent to studying the modules over the Jordan plane, and we generalize the direct decomposability results for the $(\mathbf{k}[x],P)$-modules in [13] from algebraically closed fields of characteristic zero to fields of characteristic zero. Furthermore, we provide a classification of Rota–Baxter modules up to isomorphism based on indecomposable $\mathbf{k}[x]$-modules.     

Convergence to the equilibrium for the Pauli equation without detailed balance condition

Let $A?B$ be an extension of commutative rings with identity, X an analytic indeterminate over B, and $R\text{:}=A+XB[[X]]$, the subring of the formal power series ring $B[[X]]$, consisting of the series with constant terms in A. In this Note we study when the ring R is Noetherian. We prove that R is Noetherian if and only if A is Noetherian and B is a finitely generated A-module. To cite this article: S. Hizem, A. Benhissi, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Decomposition of integer-valued polynomial algebras

Let D be a commutative domain with field of fractions K, let A be a torsion-free D-algebra, and let B be the extension of A to a K-algebra. The set of integer-valued polynomials on A is $\mathrm{Int}(A)=\{f\in B[X]|f(A)?A\}$, and the intersection of $\mathrm{Int}(A)$ with $K[X]$ is ${\mathrm{Int}}_K(A)$, which is a commutative subring of $K[X]$. The set $\mathrm{Int}(A)$ may or may not be a ring, but it always has the structure of a left ${\mathrm{Int}}_K(A)$-module.A D-algebra A which is free as a D-module and of finite rank is called ${\mathrm{Int}}_K$-decomposable if a D-module basis for A is also an ${\mathrm{Int}}_K(A)$-module basis for $\mathrm{Int}(A)$; in other words, if $\mathrm{Int}(A)$ can be generated by ${\mathrm{Int}}_K(A)$ and A. A classification of such algebras has been given when D is a Dedekind domain with finite residue rings. In the present article, we modify the definition of ${\mathrm{Int}}_K$-decomposable so that it can be applied to D-algebras that are not necessarily free by defining A to be ${\mathrm{Int}}_K$-decomposable when $\mathrm{Int}(A)$ is isomorphic to ${\mathrm{Int}}_K(A){?}_{D}A$. We then provide multiple characterizations of such algebras in the case where D is a discrete valuation ring or a Dedekind domain with finite residue rings. In particular, if D is the ring of integers of a number field K, we show that an ${\mathrm{Int}}_K$-decomposable algebra A must be a maximal D-order in a separable K-algebra B, whose simple components have as center the same finite unramified Galois extension F of K and are unramified at each finite place of F. Finally, when both D and A are rings of integers in number fields, we prove that ${\mathrm{Int}}_K$-decomposable algebras correspond to unramified Galois extensions of K.     

ISB-tree: A new indexing scheme with efficient expected behaviour

We present the interpolation search B-tree (ISB-tree), a new cache-aware indexing scheme that supports update operations (insertions and deletions) in $O(1)$ worst-case block transfers and search operations in $O({\log }_B\log n)$ expected block transfers, where B represents the disk block size and n denotes the number of stored elements. The expected search bound holds with high probability for a large class of (unknown) input distributions. The worst-case search bound of our indexing scheme is $O({\log }_{B}n)$ block transfers. Our update and expected search bounds constitute a considerable improvement over the $O({\log }_{B}n)$ worst-case block transfer bounds for search and update operations achieved by the B-tree and its numerous variants. This is also verified by an accompanying experimental study.