Algorithm 48. Solving boundary value problems for the biharmonic equation by the method of summary representations
S. Lewanowicz (1976)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “A transvection decomposition in GL(n,2)”
Algorithm 48. Solving boundary value problems for the biharmonic equation by the method of summary representations
On representations of the Weil group with bounded conductor.
D. Blasius, G. Anderson, G. Zettler (1994)
Forum mathematicum
Similarity:
Deformations of Galois representations arising from degenerate extensions
Adam Logan (2002)
Acta Arithmetica
Similarity:
Galois coverings and the Clebsch-Gordan problem for quiver representations
Martin Herschend (2007)
Colloquium Mathematicae
Similarity:
We study the Clebsch-Gordan problem for quiver representations, i.e. the problem of decomposing the point-wise tensor product of any two representations of a quiver into its indecomposable direct summands. For this purpose we develop results describing the behaviour of the point-wise tensor product under Galois coverings. These are applied to solve the Clebsch-Gordan problem for the double loop quivers with relations αβ = βα = αⁿ = βⁿ = 0. These quivers were originally studied by I....
Explicit deformation of Galois representations.
Nigel Boston (1991)
Inventiones mathematicae
Similarity:
New forms and Galois representations of octahedral type. (Formes primitives et représentations galoisiennes de type octaédral.)
Cassou-Noguès, Philippe, Jehanne, Arnaud (1996)
Experimental Mathematics
Similarity:
An infinite ferm in the universal deformation space of Galois representations.
B. Mazur (1997)
Collectanea Mathematica
Similarity:
I hope this article will be helpful to people who might want a quick overview of how modular representations fit into the theory of deformations of Galois representations. There is also a more specific aim: to sketch a construction of a point-set topological'' configuration (the image of an infinite fern'') which emerges from consideration of modular representations in the universal deformation space of all Galois representations. This is a configuration hinted previously, but now, thanks...
Galois representations of dihedral type over ℚₚ
Peder Frederiksen, Ian Kiming (2004)
Acta Arithmetica
Similarity:
Explicit solutions to embedding problems associated to orthogonal Galois representations.
Teresa Crespo (1990)
Journal für die reine und angewandte Mathematik
Similarity:
Block systems of a Galois group.
Hulpke, Alexander (1995)
Experimental Mathematics
Similarity:
Modularity of Galois representations
Chris Skinner (2003)
Journal de théorie des nombres de Bordeaux
Similarity:
This paper is essentially the text of the author’s lecture at the 2001 Journées Arithmétiques. It addresses the problem of identifying in Galois-theoretic terms those two-dimensional, -adic Galois representations associated to holomorphic Hilbert modular newforms.
Singleton representations of
Dobrev, V. K., Moylan, P.
Similarity:
On the representations of GL (2). II. ...-factors of the representations of GL(2) x GL(2).
Wen-Ch'ing Winnie Li (1980)
Journal für die reine und angewandte Mathematik
Similarity:
On cohomological systems of Galois representations
Wojciech Gajda, Sebastian Petersen (2016)
Banach Center Publications
Similarity:
The paper contains an expanded version of the talk delivered by the first author during the conference ALANT3 in Będlewo in June 2014. We survey recent results on independence of systems of Galois representations attached to ℓ-adic cohomology of schemes. Some other topics ranging from the Mumford-Tate conjecture and the Geyer-Jarden conjecture to applications of geometric class field theory are also considered. In addition, we have highlighted a variety of open questions which can lead...
Towards the automated synthesis of a Gröbner bases algorithm.
Bruno Buchberger (2004)
RACSAM
Similarity:
We discuss the question of whether the central result of algorithmic Gröbner bases theory, namely the notion of S?polynomials together with the algorithm for constructing Gröbner bases using S?polynomials, can be obtained by ?artificial intelligence?, i.e. a systematic (algorithmic) algorithm synthesis method. We present the ?lazy thinking? method for theorem and algorithm invention and apply it to the ?critical pair / completion? algorithm scheme. We present a road map that demonstrates...