Algebraic generalization of the topological theorems of Bolzano and Weierstrass
From the text: The aim of this work is to advertise an algorithmic treatment of the computation of the cohomologies of semisimple Lie algebras. The base is Kostant’s result which describes the representation of the proper reductive subalgebra on the cohomologies space. We show how to (algorithmically) compute the highest weights of irreducible components of this representation using the Dynkin diagrams. The software package offers the data structures and corresponding procedures for computing...
We deal with a numerical solution of nonlinear convection-diffusion equations with the aid of the discontinuous Galerkin method (DGM). We propose a new -adaptation technique, which is based on a combination of a residuum estimator and a regularity indicator. The residuum estimator as well as the regularity indicator are easily evaluated quantities without the necessity to solve any local problem and/or any reconstruction of the approximate solution. The performance of the proposed -DGM is demonstrated....
An interesting connection between the chromatic number of a graph and the connectivity of an associated simplicial complex , its “neighborhood complex”, was found by Lovász in 1978 (cf. L. Lovász [J. Comb. Theory, Ser. A 25, 319-324 (1978; Zbl 0418.05028)]). In 1986 a generalization to the chromatic number of a -uniform hypergraph , for an odd prime, using an associated simplicial complex , was found ([N. Alon, P. Frankl and L. Lovász, Trans. Am. Math. Soc. 298, 359-370 (1986; Zbl 0605.05033)],...