Fenomenologie matematiky
25 ročníků Putnamovy matematické soutěže
Henri Poincaré a psychologie matematiky
Šrínivása Rámanudžan a svět krásných formulí
Je elementární logika totéž co predikátová logika prvního řádu?
Interpolation with prescribed values of derivatives instead of function values
A note on the integrals involving product of Hermite's polynomials
O kompaktních množinách v lokálně konvexních prostorech
Axiomatic theory of investment evaluating
Zeroes of orthogonal polynomials by QD-algorithm
In the paper a method for computing zeroes of orthogonal polynomials is presented. An algorithm is given for computing directly the top row of the QD-scheme for some recurrently defined polynomials. The algorithm is then applied to classical orthogonal polynomials.
An algorithm for Hermite-Birkhoff interpolation
Representations of generalized measures by integrals
Eine Verallgemeinerung der Mehlerschen Formel
Úvodní slovo za JČMF
New lower bounds on the weighted chromatic number of a graph
In this paper we present theoretical and algorithmic results for the computation of lower bounds on the chromatic number of a weighted graph. In particular, we study different ways of a possible improvement of the lower bound offered by a maximum weighted clique. Based on our findings we devise new algorithms and show their performance on random graphs.
Partial covers of graphs
Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for every edge (u,v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the problems of...
Sjezd JČMF
International seminar on excitation energy transfer in condensed matter
The period of oscillations in non-linear systems
Page 1