arXiv subjects

Jérémy Le Borgne

Publications and source records attributed to Jérémy Le Borgne.

9 recordsLinked to original sources

arXiv2026

Convergent realizations of Lie subalgebras

It has been known since the seminal work of Guillemin and Sternberg that Lie subalgebras of finite codimension of an arbitrary real or complex Lie algebra can be realized as subalgebras of formal vector fields over formal power series. In this note, we characterize the Lie subalgebras which admit a convergent realization in the sense of locally analytic vector fields. We give generalizations of these properties for the problem of output realization. We give reformulations and applications of these algebraic results in the context of control theory. In particular, we recover and clarify previous results on the realization of Chen--Fliess series for control-affine systems, the equivalence of control systems, and the existence of embedded or canonical systems.

math.DG↗

arXiv2026

Local convergence of Sussmann's infinite product for analytic vector fields

In 1986, Sussmann proposed an expansion of the Chen series as an infinite product of exponentials of Hall basis elements multiplied by coefficients defined through a simple induction. He proved that this product converges locally in time for bilinear control systems associated with matrices or bounded operators. In this note, we prove that Sussmann's product also converges locally in time for control-affine systems driven by analytic vector fields. The difficulty is that one must keep track of the structure of the involved Lie brackets, as the natural decay of the explicit coefficients is not enough to counterbalance the natural growth of the iterated Lie brackets.

math.CA↗

arXiv2023

On expansions for nonlinear systems, error estimates and convergence issues

Explicit formulas expressing the solution to non-autonomous differential equations are of great importance in many application domains such as control theory or numerical operator splitting. In particular, intrinsic formulas allowing to decouple time-dependent features from geometry-dependent features of the solution have been extensively studied. First, we give a didactic review of classical expansions for formal linear differential equations, including the celebrated Magnus expansion (associated with coordinates of the first kind) and Sussmann's infinite product expansion (associated with coordinates of the second kind). Inspired by quantum mechanics, we introduce a new mixed expansion, designed to isolate the role of a time-invariant drift from the role of a time-varying perturbation. Second, in the context of nonlinear ordinary differential equations driven by regular vector fields, we give rigorous proofs of error estimates between the exact solution and finite approximations of the formal expansions. In particular, we derive new estimates focusing on the role of time-varying perturbations. For scalar-input systems, we derive new estimates involving only a weak Sobolev norm of the input. Third, we investigate the local convergence of these expansions. We recall known positive results for nilpotent dynamics and for linear dynamics. Nevertheless, we also exhibit arbitrarily small analytic vector fields for which the convergence of the Magnus expansion fails, even in very weak senses. We state an open problem concerning the convergence of Sussmann's infinite product expansion. Eventually, we derive approximate direct intrinsic representations for the state and discuss their link with the choice of an appropriate change of coordinates.

math.CA↗

arXiv2022

Factorization of skew polynomials over k((u))

Let $k$ be a perfect field of characteristic $p > 0$, and let $K = k((u))$ be the field of Laurent series over $K$. We study the skew polynomial ring $K[T, Φ]$, where $Φ$ is an endomorphism of $K$ that extends a Frobenius endomorphism of $k$. We give a description of the irreducible skew polynomials, develop an analogue of the theory of the Newton polygon in this context, and classify the similarity classes of irreducible elements.

math.AC↗

arXiv2022

Growth of structure constants of free Lie algebras relative to Hall bases

We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the involved Lie brackets. First, using the classical recursive decomposition algorithm, we obtain a rough upper bound valid for all Hall bases. We then introduce new notions (which we call alphabetic subsets and relative foldings) related to structural properties of the Lie brackets created by the algorithm, which allow us to prove a sharp upper bound for the general case. We also prove that the length of the relative folding provides a strictly decreasing indexation of the recursive rewriting algorithm. Moreover, we derive lower bounds on the structure constants proving that they grow at least geometrically in all Hall bases. Second, for the celebrated historical length-compatible Hall bases and the Lyndon basis, we prove tighter sharp upper bounds, which turn out to be geometric in the length of the brackets. Third, we construct two new Hall bases, illustrating two opposite behaviors in the two-indeterminates case. One is designed so that its structure constants have the minimal growth possible, matching exactly the general lower bound, linked with the Fibonacci sequence. The other one is designed so that its structure constants grow super-geometrically. Eventually, we investigate asymmetric growth bounds which isolate the role of one particular indeterminate. Despite the existence of super-geometric Hall bases, we prove that the asymmetric growth with respect to each fixed indeterminate is uniformly at most geometric in all Hall bases.

math.CO↗

arXiv2016

GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called GraphPrints. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets -- small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84% at the time-interval level, and 0.05% at the IP-level with 100% true positive rates at both.

cs.CR↗

arXiv2012

Some algorithms for skew polynomials over finite fields

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise description of quotients of skew polynomial rings by a left principal ideal, using results relating skew polynomial rings to Azumaya algebras. We use this description to give a new factorization algorithm for skew polynomials, and to give other algorithms related to factorizations of skew polynomials, like counting the number of factorizations as a product of irreducibles.

math.NT↗

arXiv2011

Semi-characteristic polynomials, ϕ-modules and skew polynomials

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic polynomial of a linear map. We use this notion to study skew polynomials and linearized polynomials over a finite field, giving an algorithm to compute the splitting field of a linearized polynomial over a finite field and the Galois action on this field. We also give a way to compute the optimal bound of a skew polynomial. We then look at properties of the factorizations of skew polynomials, giving a map that computes several invariants of these factorizations. We also explain how to count the number of factorizations and how to find them all.

math.RT↗

arXiv2009

Optimisation du théorème d'Ax-Sen-Tate et application à un calcul de cohomologie galoisienne p-adique

Let p a prime number, Q_p the field of p-adic numbers, K a finite extension of Q_p, \bar{K} an algebraic closure, and C_p the completion of Q_p, on which the valuation on Q_p extends. In his proof of the Ax-Sen-Tate theorem, Ax shows that if x in C_p satisfies v(sx - x) > A for all s in the absolute Galois group of K G, then there is a y in K such that v(x-y) >= A - C, with the constant C = p/(p-1)^2. Ax questions the optimality of this constant, which we study here. Introducing the extension of K by p^n-th roots of the uniformizer and relying on Tate's and Colmez's works, we find the optimal constant and some more information about elements in C_p satisfying v(sx - x) >= A for all s in G, we compute the first cohomology group of G with coefficients in the ring of integers of \bar{K}.

math.AG↗