Gerhard Ringel

Known as: Ringel 
Gerhard Ringel (October 28, 1919, in Kollnbrunn, Austria – June 24, 2008, in Santa Cruz, California) was a German mathematician who earned his Ph.D… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1968-2017
0204019682017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
  • VALERIO TOLEDANO LAREDO
  • 2008
Let G be a complex algebraic group and∇ a meromorphic connection on the trivial G–bundle over P with a pole of order 2 at zero… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
s of talks Baer modules over tame hereditary algebras Lidia Angeleri Hügel In 1979, Ringel discovered a striking analogy between… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We show that the category of orbits of the bounded derived category of a hereditary category under a well-behaved autoequivalence… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
DIANA MARCULESCU, MEMBER, IEEE, RADU MARCULESCU, MEMBER, IEEE, NICHOLAS H. ZAMORA, PHILLIP STANLEY-MARBELL, STUDENT MEMBER, IEEE… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We provide a quiver-theoretic interpretation of certain smooth complete simplicial fans associated to arbitrary finite root… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Current automatic speech recognition systems make use of a single source of information about their input, viz. a preprocessed… (More)
  • figure 1.2
  • table 1.2
  • table 1.3
  • figure 2.2
  • figure 2.3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Recent studies with patients suffering from epidermolysis bullosa simplex associated with muscular dystrophy and the targeted… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Nonmonotonic reasoning forms one of the main components of the logical approach to Artificial Intelligence and Knowledge… (More)
Is this relevant?
1985
1985
Ifa given graph G can be obtained by s vertex identifications from a suitable planar graph and s is the minimum number for which… (More)
  • figure 2
  • figure 6
  • figure 7
  • figure 9
  • figure 10
Is this relevant?
1983
1983
In this paper we consider a generalization of Heawood's map color theorem. In 1890, P.J. Heawood [2] showed that for a surface… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?