Visar resultat 1 - 5 av 7 avhandlingar innehållade ordet galois.
Sammanfattning : Constraint programming (CP) is a technology in which a combinatorial problem is modeled declaratively as a conjunction of constraints, each of which captures some of the combinatorial substructure of the problem. Constraints are more than a modeling convenience: every constraint is partially implemented by an inference algorithm, called a propagator, that rules out some but not necessarily all infeasible candidate values of one or more unknowns in the scope of the constraint. LÄS MER
Sammanfattning : On the category of representations of a given quiver we define a tensor product point-wise and arrow-wise. The corresponding Clebsch-Gordan problem of how the tensor product of indecomposable representations decomposes into a direct sum of indecomposable representations is the topic of this thesis. LÄS MER
Sammanfattning : Any cover of the Riemann sphere with rational branch points is known to be defined over the algebraic numbers. Hence the Galois group of the rationals acts on the category of such branched covers. Particulars about this action are still scarce, even in the simplest non-abelian case, the case with just three branch points. LÄS MER
Sammanfattning : In Paper A we classify plethories over a field of characteristic zero. All plethories over characteristic zero fields are ``linear", in the sense that they are free plethories on a bialgebra. For the proof of this classification we need some facts from the theory of ring schemes where we extend previously known results. LÄS MER
Sammanfattning : This thesis treats various aspects of stable reduction of curves, and consists of two separate papers. In Paper I of this thesis, we study stable reduction of curves in the case where a tamely ramified base extension is sufficient. LÄS MER