| 1. |
- Alveteg, Mattias, et al.
(författare)
-
Vad räknas som belägg för studenters måluppfyllelse?
- 2018
-
Ingår i: 10:e Pedagogiska Inspirationskonferensen 2018. - 2003-3761 .- 2003-377X. ; 10
-
Konferensbidrag (refereegranskat)abstract
- Universitetskanslerämbetet (UKÄ) ställer numera krav på svenska lärosäten att vi ska utvärdera oss själva. Vi på LTH bör då gemensamt försöka hitta sätt att uppfylla UKÄs krav som även ger de verktyg vi själva behöver för att förbättra våra utbildningars kvalitét.Hur tar vi reda på våra utbildningars styrkor och svagheter och vad vi kan göra för att förbättra dem ytterligare? Ett sätt är att undersöka hur väl studenterna uppfyller examensmålen. Vad som ska räknas som belägg för studenters måluppfyllelse är dock svårt, av flera olika skäl. Vår rekommendation blir att triangulera olika typer av belägg samt att tydligt involvera institutionerna i arbetet.
|
|
| 2. |
- Moberg, Christina, et al.
(författare)
-
De unga gör helt rätt när de stämmer staten
- 2022
-
Ingår i: Aftonbladet. - 1103-9000.
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- 1 620 forskare och lärare i forskarvärlden: Vi ställer oss bakom Auroras klimatkrav
|
|
| 3. |
- Månsson, Jonas, et al.
(författare)
-
A generalized Ufnarovski graph
- 2005
-
Ingår i: Applicable Algebra in Engineering, Communication and Computing. - : Springer Science and Business Media LLC. - 1432-0622 .- 0938-1279. ; 16:5, s. 293-306
-
Tidskriftsartikel (refereegranskat)abstract
- An important tool for studying standard finitely presented algebras is the Ufnarovski graph. In this paper we extend the use of the Ufnarovski graph to automaton algebras, introducing the generalized Ufnarovski graph. As an application, we show how this construction can be used to test Noetherianity of automaton algebras.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
- Månsson, Jonas, et al.
(författare)
-
Regular Grobner bases
- 2002
-
Ingår i: Journal of Symbolic Computation. - : Elsevier BV. - 0747-7171. ; 33:2, s. 163-181
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A bi-automaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Grobner basis which can be encoded as a regular set; we call such a Grobner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Grobner bases can be used to perform reduction. (C) 2002 Academic Press.
|
|
| 8. |
- Nordbeck, Patrik
(författare)
-
Canonical Bases for Algebraic Computations
- 2001
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis deals with computational methods in algebra, mainly focusing on the concept of Gröbner and SAGBI bases in non-commutative algebras. The material has a natural division into two parts. The first part is a rather extensive treatment of the basic theory of Gröbner bases and SAGBI bases in the non-commutative polynomial ring. The second part is a collection of six papers. In the first paper we investigate, for quotients of the non-commutative polynomial ring, a property that implies finiteness of Gröbner bases computation, and examine its connection with Noetherianity. We propose a Gröbner bases theory for factor algebras, of particular interest for one-sided ideals, and show a few applications, e.g. how to compute (one-sided) syzygy modules. The material of the third paper is in some sense related to the contents of this first paper; in the third paper, the theory of SAGBI bases is extended to factor algebras. The second and fourth paper concerns composition of polynomials. In the first of those two papers, we give sufficient and necessary conditions on a set of polynomials to guarantee that the property of being a non-commutative Gröbner basis is preserved after composition by this set. The latter paper treats the same problem for SAGBI bases. In the fifth paper we introduce the concept of bi-automaton algebras, generalizing the automaton algebras previously defined by Ufnarovski. A bi-automaton algebra is a quotient of the free algebra, defined by a binomial ideal admitting a Gröbner basis which can be encoded as a regular set; we call such a Gröbner basis regular. We give several examples of bi-automaton algebras, and show how automata connected to regular Gröbner bases can be used to perform reduction. In the last paper we investigate various important properties of regular languages associated with quotients of the free associative algebra. We suggest a generalization of a graph for normal words introduced by Ufnarovski, applicable to testing Noetherian properties of automaton algebras. Finally we show an alternative way to compute the generators for the Jacobson radical of any automaton monomial algebra.
|
|
| 9. |
- Nordbeck, Patrik
(författare)
-
Canonical bases for subalgebras of factor algebras
- 1999
-
Ingår i: Computer Science Journal of Moldova. - 1561-4042. ; 7:1, s. 63-77
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce canonical bases for subalgebras of quotients of the commutative and non-commutative polynomial ring. The usual theory for Gröbner bases and its counterpart for subalgebras of polynomial rings, also called SAGBI bases, are combined to obtain a tool for computation in subalgebras of factor algebras.
|
|
| 10. |
- Nordbeck, Patrik, et al.
(författare)
-
Canonical subalgebra bases in non-commutative polynomial rings
- 1998
-
Ingår i: Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation. - New York, NY, USA : ACM. - 1581130023 ; , s. 140-146
-
Konferensbidrag (refereegranskat)abstract
- Canonical bases, also called SAGBI bases, for subalgebras of the non-commutative polynomial ring are investigated. The process of subalgebra reduction is defined. Methods, including generalizations of the standard Gröbner bases techniques, are developed for the test whether bases are canonical, and for the completion procedure of constructing canonical bases. The special case of homogeneous subalgebras is discussed.
|
|
