• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 26
  • 9
  • Tagged with
  • 35
  • 35
  • 35
  • 6
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

On Poicarés Uniformization Theorem

Bartolini, Gabriel January 2006 (has links)
<p>A compact Riemann surface can be realized as a quotient space $\mathcal{U}/\Gamma$, where $\mathcal{U}$ is the sphere $\Sigma$, the euclidian plane $\mathbb{C}$ or the hyperbolic plane $\mathcal{H}$ and $\Gamma$ is a discrete group of automorphisms. This induces a covering $p:\mathcal{U}\rightarrow\mathcal{U}/\Gamma$.</p><p>For each $\Gamma$ acting on $\mathcal{H}$ we have a polygon $P$ such that $\mathcal{H}$ is tesselated by $P$ under the actions of the elements of $\Gamma$. On the other hand if $P$ is a hyperbolic polygon with a side pairing satisfying certain conditions, then the group $\Gamma$ generated by the side pairing is discrete and $P$ tesselates $\mathcal{H}$ under $\Gamma$.</p>
22

Elevers svårigheter i geometri : En studie om elever i skolår nio

Pettersson, Marie January 2010 (has links)
Geometri är ett matematiskt område som visat sig vara svårt för svenska elever. Denna undersökning syftar till att ta reda på vilka aspekter på geometri elever i år nio, med särskilt stöd i matematik, behöver utveckla för att nå godkända resultat. Den söker även svar på vilka faktorer som påverkar eleven i inlärningssituationer. Empirin inhämtades genom sju semistrukturerade intervjuer. Resultatet visar att begreppsförståelse, formelhantering och förmåga att kommunicera är aspekter som måste fördjupas för att målen i matematik ska nås. De mest frekventa påverkansfaktorer som angavs i inlärningssituationer var läraren, tiden, kompisar och läromedlet.
23

On Poicarés Uniformization Theorem

Bartolini, Gabriel January 2006 (has links)
A compact Riemann surface can be realized as a quotient space $\mathcal/\Gamma$, where $\mathcal$ is the sphere $\Sigma$, the euclidian plane $\mathbb$ or the hyperbolic plane $\mathcal$ and $\Gamma$ is a discrete group of automorphisms. This induces a covering $p:\mathcal\rightarrow\mathcal/\Gamma$. For each $\Gamma$ acting on $\mathcal$ we have a polygon $P$ such that $\mathcal$ is tesselated by $P$ under the actions of the elements of $\Gamma$. On the other hand if $P$ is a hyperbolic polygon with a side pairing satisfying certain conditions, then the group $\Gamma$ generated by the side pairing is discrete and $P$ tesselates $\mathcal$ under $\Gamma$.
24

Simplicial Complexes of Graphs

Jonsson, Jakob January 2005 (has links)
Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. The subject of this thesis is the topology of graph complexes, the emphasis being placed on homology, homotopy type, connectivity degree, Cohen-Macaulayness, and Euler characteristic. We are particularly interested in the case that G is the complete graph on V. Monotone graph properties are complexes on such a graph satisfying the additional condition that they are invariant under permutations of V. Some well-studied monotone graph properties that we discuss in this thesis are complexes of matchings, forests, bipartite graphs, disconnected graphs, and not 2-connected graphs. We present new results about several other monotone graph properties, including complexes of not 3-connected graphs and graphs not coverable by p vertices. Imagining the vertices as the corners of a regular polygon, we obtain another important class consisting of those graph complexes that are invariant under the natural action of the dihedral group on this polygon. The most famous example is the associahedron, whose faces are graphs without crossings inside the polygon. Restricting to matchings, forests, or bipartite graphs, we obtain other interesting complexes of noncrossing graphs. We also examine a certain "dihedral" variant of connectivity. The third class to be examined is the class of digraph complexes. Some well-studied examples are complexes of acyclic digraphs and not strongly connected digraphs. We present new results about a few other digraph complexes, including complexes of graded digraphs and non-spanning digraphs. Many of our proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this thesis provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees, which we successfully apply to a large number of graph and digraph complexes. / QC 20100622
25

On the Clebsch-Gordan problem for quiver representations

Herschend, Martin January 2008 (has links)
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. The choice of tensor product is motivated by an investigation of possible ways to modify the classical tensor product from group representation theory to the case of quiver representations. It turns out that all of them yield tensor products which essentially are the same as the point-wise tensor product. We solve the Clebsch-Gordan problem for all Dynkin quivers of type A, D and E6, and provide explicit descriptions of their respective representation rings. Furthermore, we investigate how the tensor product interacts with Galois coverings. The results obtained are used to solve the Clebsch-Gordan problem for all extended Dynkin quivers of type Ãn and the double loop quiver with relations βα=αβ=αn=βn=0.
26

On the Clebsch-Gordan problem for quiver representations

Herschend, Martin January 2008 (has links)
<p>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.</p><p>The choice of tensor product is motivated by an investigation of possible ways to modify the classical tensor product from group representation theory to the case of quiver representations. It turns out that all of them yield tensor products which essentially are the same as the point-wise tensor product.</p><p>We solve the Clebsch-Gordan problem for all Dynkin quivers of type A, D and E<sub>6</sub>, and provide explicit descriptions of their respective representation rings. Furthermore, we investigate how the tensor product interacts with Galois coverings. The results obtained are used to solve the Clebsch-Gordan problem for all extended Dynkin quivers of type Ã<sub>n</sub> and the double loop quiver with relations βα=αβ=α<sup>n</sup>=β<sup>n</sup>=0.</p>
27

De 17 tapetgrupperna

Pencz, Jack January 1999 (has links)
<p>Avstånd och bevarandet av avstånd är centrala begrepp i denna uppsats. Det är nämligen bevarandet av avstånd som ger symmetriska kompositioner, s. k. isometrier. Ett symmetriskt tapetmönster innebär att ett grundläggande motiv upprepas över hela tapeten. Beroende på hur motivet ser ut så kan det förflyttas, roteras och speglas. Dessa transformationer är de naturliga isometrierna som också kan sättas samman till godtyckliga isometrier. Enligt D. J. S. Robinson är det tillräckligt om vi förutom de naturliga isometrierna sätter samman produkten av förflyttning och spegling. Denna sammansättning kallar vi förskjuten spegling. Det är isometrierna som vi representerar med element i matrisgrupperna och den euklidiska gruppen. Dessa grupper ligger till grund för den kristallografiska rymdgruppen som gör det möjligt att klassificera både tapetmönster och kristallstrukturer. I uppsatsen visas att det finns 10 kristallklasser och 17 kristallografiska rymdgrupper som beskriver såväl kristaller i två dimensioner som tapetmönster.</p>
28

On Stratified Algebras and Lie Superalgebras

Frisk, Anders January 2007 (has links)
<p>This thesis, consisting of three papers and a summary, studies properties of stratified algebras and representations of Lie superalgebras.</p><p>In Paper I we give a characterization when the Ringel dual of an SSS-algebra is properly stratified.</p><p>We show that for an SSS-algebra, whose Ringel dual is properly stratified, there is a (generalized) tilting module which allows one to compute the finitistic dimension of the SSS-algebra, and moreover, it gives rise to a new covariant Ringel-type duality.</p><p>In Paper II we give a characterization of standardly stratified algebras in terms of certain filtrations of (left or right) projective modules, generalizing the corresponding theorem of V. Dlab. We extend the notion of Ringel duality to standardly stratified algebras and estimate their finitistic dimension in terms of endomorphism algebras of standard modules.</p><p>Paper III deals with the queer Lie superalgebra and the corresponding BGG-category O. We show that the typical blocks correspond to standardly stratified algebras, and we generalize Kostant's Theorem to the queer Lie superalgebra.</p>
29

On Stratified Algebras and Lie Superalgebras

Frisk, Anders January 2007 (has links)
This thesis, consisting of three papers and a summary, studies properties of stratified algebras and representations of Lie superalgebras. In Paper I we give a characterization when the Ringel dual of an SSS-algebra is properly stratified. We show that for an SSS-algebra, whose Ringel dual is properly stratified, there is a (generalized) tilting module which allows one to compute the finitistic dimension of the SSS-algebra, and moreover, it gives rise to a new covariant Ringel-type duality. In Paper II we give a characterization of standardly stratified algebras in terms of certain filtrations of (left or right) projective modules, generalizing the corresponding theorem of V. Dlab. We extend the notion of Ringel duality to standardly stratified algebras and estimate their finitistic dimension in terms of endomorphism algebras of standard modules. Paper III deals with the queer Lie superalgebra and the corresponding BGG-category O. We show that the typical blocks correspond to standardly stratified algebras, and we generalize Kostant's Theorem to the queer Lie superalgebra.
30

Computational algorithms for algebras

Lundqvist, Samuel January 2009 (has links)
This thesis consists of six papers. In Paper I, we give an algorithm for merging sorted lists of monomials and together with a projection technique, we obtain a new complexity bound for the Buchberger-Möller algorithm and the FGLM algorithm. In Paper II, we discuss four different constructions of vector space bases associated to vanishing ideals of points. We show how to compute normal forms with respect to these bases and give complexity bounds. As an application we drastically improve the computational algebra approach to the reverse engineering of gene regulatory networks. In Paper III, we introduce the concept of multiplication matrices for ideals of projective dimension zero. We discuss various applications and, in particular, we give a new algorithm to compute the variety of an ideal of projective dimension zero. In Paper IV, we consider a subset of projective space over a finite field and give a geometric description of the minimal degree of a non-vanishing form with respect to this subset. We also give bounds on the minimal degree in terms of the cardinality of the subset. In Paper V, we study an associative version of an algorithm constructed to compute the Hilbert series for graded Lie algebras. In the commutative case we use Gotzmann's persistence theorem to show that the algorithm terminates in finite time. In Paper VI, we connect the commutative version of the algorithm in Paper V with the Buchberger algorithm. / At the time of doctoral defence, the following papers were unpublished and had a status as follows: Paper 3: Manuscript. Paper 4: Manuscript. Paper 5: Manuscript. Paper 6: Manuscript

Page generated in 0.0785 seconds