Search arXiv⌕ Search

arXiv subjects

Xavier Mary

Publications and source records attributed to Xavier Mary.

10 recordsLinked to original sources
arXiv2026

A Categorical Realization of the (2-)Category of Monoids via Sch{ü}tzenberger Categories and Strict Factorization Systems

We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on the Sch{ü}tzenberger category of semigroups and categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital semigroups and semigroup homomorphisms. By introducing suitable natural transformations, we turn these equivalences into 2-equivalences between 2-categories. The 2-category $\mathbf{Mon_s^{(2)}}$ constructed this way proves the good one to study Morita equivalence of monoids.

math.CT↗
arXiv2026

On the Drazin Index of an Anti-Triangular Block Matrix

The Drazin index is a fundamental invariant in the analysis of singular matrices and their generalized inverses. While sharp results are available for block triangular matrices, the corresponding theory for anti-triangular block matrices is less developed. In this paper, we study matrices of the form \[ M=\begin{bmatrix} A & B \\ C & 0 \end{bmatrix}, \] under algebraic constraints on the blocks. Building on additive decompositions involving von Neumann inverses, we relate the Drazin index of $M$ to invariance properties of the index and minimal polynomial of expressions of the form $A^{2}A^{-}+I-AA^{-}$. This connection provides an effective mechanism to control the index of $M$ through suitable factorizations and associated block products. As a consequence, we derive explicit lower and upper bounds for $i(M)$ in terms of $i(A)$ and $i(BC)$, and characterize situations in which these bounds are attained. Under additional annihilation or orthogonality conditions on the blocks, we obtain closed-form representations for the Drazin inverse of $M$. Applications to adjacency matrices of directed graphs illustrate the sharpness of the bounds and the applicability of the results to structured matrices arising in graph-theoretic settings.

math.CO↗
arXiv2017

Determinantal Sampling Designs

In this article, recent results about point processes are used in sampling theory. Precisely, we define and study a new class of sampling designs: determinantal sampling designs. The law of such designs is known, and there exists a simple selection algorithm. We compute exactly the variance of linear estimators constructed upon these designs by using the first and second order inclusion probabilities. Moreover, we obtain asymptotic and finite sample theorems. We construct explicitly fixed size determinantal sampling designs with given first order inclusion probabilities. We also address the search of optimal determinantal sampling designs.

stat.ME↗
arXiv2016

Centralizer's applications to the inverse along an element

In this paper, we first prove that the absorption law for one-sided inverses along an element holds, deriving the absorption law for the inverse along an element. We then apply this result to obtain the absorption law for the inverse along different elements. Also, the reverse order law and the existence criterion for the inverse along an element are given by centralizers in a ring. Finally, we characterize the Moore-Penrose inverse by one-sided invertibilities in a ring with involution.

math.RA↗
arXiv2012

Classes of semigroups modulo Green's relation H

Inverses semigroups and orthodox semigroups are either defined in terms of inverses, or in terms of the set of idempotents E(S). In this article, we study analogs of these semigroups defined in terms of inverses modulo Green's relation H, or in terms of the set of group invertible elements H(S), that allows a study of non-regular semigroups. We then study the interplays between these new classes of semigroups, as well as with known classes of semigroups (notably inverse, orthodox and cryptic semigroups)

math.GR↗
arXiv2012

Natural generalized inverse and core of an element in semigroups, rings and Banach and Operator Algebras

Using the recent notion of inverse along an element in a semigroup, and the natural partial order on idempotents, we study bicommuting generalized inverses and define a new inverse called natural inverse, that generalizes the Drazin inverse in a semigroup, but also the Koliha-Drazin inverse in a ring. In this setting we get a core decomposition similar to the nilpotent, Kato or Mbekhta decompositions. In Banach and Operator algebras, we show that the study of the spectrum is not sufficient, and use ideas from local spectral theory to study this new inverse.

math.GR↗
arXiv2009

Functional learning through kernels

This paper reviews the functional aspects of statistical learning theory. The main point under consideration is the nature of the hypothesis set when no prior information is available but data. Within this framework we first discuss about the hypothesis set: it is a vectorial space, it is a set of pointwise defined functions, and the evaluation functional on this set is a continuous mapping. Based on these principles an original theory is developed generalizing the notion of reproduction kernel Hilbert space to non hilbertian sets. Then it is shown that the hypothesis set of any learning machine has to be a generalized reproducing set. Therefore, thanks to a general "representer theorem", the solution of the learning problem is still a linear combination of a kernel. Furthermore, a way to design these kernels is given. To illustrate this framework some examples of such reproducing sets and kernels are given.

stat.ML↗
arXiv2009

On generalized inverses and Green's relations

We study generalized inverses on semigroups by means of Green's relations. We first define the notion of inverse along an element and study its properties. Then we show that the classical generalized inverses (group inverse, Drazin inverse and Moore-Penrose inverse) belong to this class.

math.GR↗