Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Nicolas Thiéry"'
Autor:
Nicolas Thiéry
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AA,..., Iss Proceedings (2001)
We present a characteristic-free algorithm for computing minimal generating sets of invariant rings of permutation groups. We circumvent the main weaknesses of the usual approaches (using classical Gröbner basis inside the full polynomial ring, or p
Externí odkaz:
https://doaj.org/article/81f867ed998843b18d5ae9817682d81d
Autor:
Eric Cosyn, Arnaud Lenoble, Nicolas Thiéry, Hasan Uzun, Jean-Claude Falmagne, Christopher Doble
Publikováno v:
Knowledge Spaces ISBN: 9783642353284
Knowledge Spaces, Applications in Education
Knowledge Spaces, Applications in Education
According to Knowledge Space Theory (KST) (cf. Doignon and Falmagne, 1999; Falmagne and Doignon, 2011), a student’s competence in a mathematics or science subject, such as elementary school mathematics or first year college chemistry, can be descri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e3b3eb138974970556e938b43a07f6a7
https://doi.org/10.1007/978-3-642-35329-1_2
https://doi.org/10.1007/978-3-642-35329-1_2
Autor:
Eric Cosyn, Nicolas Thiéry
Publikováno v:
Journal of mathematical psychology. 44(3)
Computerized assessment of knowledge is one of the most promising applications of knowledge space theory. The first requirement of any such assessment is to produce as accurate a picture as possible of the organization of the knowledge. So far, all p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::814bb3f4a03a0169b7ae06a963be1611
https://pubmed.ncbi.nlm.nih.gov/10973777
https://pubmed.ncbi.nlm.nih.gov/10973777
Autor:
Falque, Justine
Publikováno v:
Combinatorics [math.CO]. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLS484⟩
This PhD thesis falls under the fields of algebraic combinatorics and group theory. Precisely,it brings a contribution to the domain that studies profiles of oligomorphic permutation groups and their behaviors.The first part of this manuscript introd
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cfdbb92e3e5ec4849858053be761964e
https://tel.archives-ouvertes.fr/tel-02420262/document
https://tel.archives-ouvertes.fr/tel-02420262/document
Autor:
Virmaux, Aladin
Publikováno v:
Combinatoire [math.CO]. Université Paris Saclay (COmUE), 2016. Français. ⟨NNT : 2016SACLS138⟩
This thesis is focused on combinatorical representation theory of finite monoids within the field of algebraic combinatorics. A monoid M is a finite set endowed with a multiplication and a neutralelement. A representation of M is a morphism from M in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b00a5698031aa7d38f81ad97175b68da
https://tel.archives-ouvertes.fr/tel-01404298/document
https://tel.archives-ouvertes.fr/tel-01404298/document
Autor:
Borie, Nicolas
Publikováno v:
Mathématiques générales [math.GM]. Université Paris Sud-Paris XI, 2011. Français. ⟨NNT : 2011PA112294⟩
This thesis concerns algorithmic approaches to three challenging problems in computational algebraic combinatorics.The firsts parts propose a Gröbner basis free approach for calculating the secondary invariants of a finite permutation group, proceed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::a1751ea6ddd4a5902b271d24da10b435
https://tel.archives-ouvertes.fr/tel-00656789
https://tel.archives-ouvertes.fr/tel-00656789
Autor:
Borie, Nicolas
Publikováno v:
Mathématiques générales [math.GM]. Université Paris Sud-Paris XI, 2011. Français. ⟨NNT : 2011PA112294⟩
This thesis concerns algorithmic approaches to three challenging problems in computational algebraic combinatorics.The firsts parts propose a Gröbner basis free approach for calculating the secondary invariants of a finite permutation group, proceed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a1751ea6ddd4a5902b271d24da10b435
https://theses.hal.science/tel-00656789
https://theses.hal.science/tel-00656789