Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1604.00795

Méthodes Matricielles Introduction à la Complexité Algébrique

Jounaïdi Abdeljaoued·Henri Lombardi
View original source ↗Read source document ↗Export metadata ↓

Abstract

The main purpose of this book is to propose an introduction to the modern tools of algebraic complexity. To remain as simple as possible while providing meaningful examples, we chose to focus on effective linear algebra; this is certainly one of the best possible choices to give an idea of the main problems in algebraic complexity. The contents of the book are the following: classical results of linear algebra and basic algorithms in linear algebra, straight-line programs as a model of computation, with an emphasis on Strassen's method known as "elimination of divisions", a discussion on various notions of complexity, a presentation of the general algorithmic strategy "divide and conquer", a first important example: the fast multiplication of polynomials, the very heart of the book: the fast multiplication of matrices, with a discussion of derived fast algorithms for various problems of linear algebra. The particular case of the computation of the determinant is then discussed, and the last chapter deals with the difficult computation of the permanent (Valiant's conjecture). This book gives an introduction to a fascinating subject at a reasonable level. . . for French-speaking people.

Explore related subjects

math.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jounaïdi Abdeljaoued, Henri Lombardi. 2016-04-04. Méthodes Matricielles Introduction à la Complexité Algébrique. https://arxiv.org/abs/1604.00795

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC↗
arXiv2026

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC↗