Zobrazeno 1 - 10
of 879
pro vyhledávání: '"Berthomieu P"'
Autor:
Kaufmann, Daniela, Berthomieu, Jérémy
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis with respec
Externí odkaz:
http://arxiv.org/abs/2411.16348
Autor:
Berthomieu, Jérémy, Mohr, Rafael
Publikováno v:
49th International Symposium on Symbolic and Algebraic Computation, Jul 2024, Raleigh, NC, United States. pp.307-315
We describe a version of the FGLM algorithm that can be used to compute generic fibers of positive-dimensional polynomial ideals. It combines the FGLM algorithm with a Hensel lifting strategy. In analogy with Hensel lifting, we show that this algorit
Externí odkaz:
http://arxiv.org/abs/2402.03144
Publikováno v:
Theoretical Computer Science, 2023, 114346, ISSN 0304-3975
The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled transitions
Externí odkaz:
http://arxiv.org/abs/2306.12440
Autor:
Rodolphe Hamel, Quentin Narpon, Idalba Serrato-Pomar, Camille Gauliard, Arnaud Berthomieu, Sineewanlaya Wichit, Dorothée Missé, Mircea T. Sofonea, Julien Pompon
Publikováno v:
iScience, Vol 27, Iss 11, Pp 111099- (2024)
Summary: Understanding the transmission routes of arboviruses is key to determining their epidemiology. Here, we tested whether West Nile viruses (WNVs) are transmitted through mosquito excreta. First, we observed a high concentration of infectious u
Externí odkaz:
https://doaj.org/article/2a7d89cccbfb4c2cb0f7de45186f9e71
Autor:
Laetitia Atlan, Lionel Berthomieu, Caroline Karsenty, Géraldine Gascoin, Catherine Arnaud, Sophie Breinig
Publikováno v:
Frontiers in Pediatrics, Vol 12 (2024)
BackgroundPersistent pulmonary hypertension of the newborn (PPHN) is a serious condition that affects 1–2 per 1,000 newborns. Scientific data report the existence of neurological developmental abnormalities between 10 and 30%, but the description o
Externí odkaz:
https://doaj.org/article/e528de58b15843968297e31b1ee28d1f
Autor:
Murat Uzam, Ding Liu, Bernard Berthomieu, Gokhan Gelen, Zhaolong Zhang, Almetwally M. Mostafa, Zhiwu Li
Publikováno v:
IEEE Access, Vol 12, Pp 135506-135534 (2024)
Deadlock/livelock problems can cause catastrophic results in flexible manufacturing systems (FMS) by forcing them to stop production processes at an unpredictable stage of production. Therefore, they must be handled properly in order to obtain flawle
Externí odkaz:
https://doaj.org/article/9ff9070a396a4b038331f3a81294a243
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a classical tool for
Externí odkaz:
http://arxiv.org/abs/2203.10021
This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical issue in no
Externí odkaz:
http://arxiv.org/abs/2202.13387
Solving zero-dimensional polynomial systems using Gr\"obner bases is usually done by, first, computing a Gr\"obner basis for the degree reverse lexicographic order, and next computing the lexicographic Gr\"obner basis with a change of order algorithm
Externí odkaz:
http://arxiv.org/abs/2202.09226
Publikováno v:
Journal of Symbolic Computation, Elsevier, In press
Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey algorithm.
Externí odkaz:
http://arxiv.org/abs/2107.02582