Browsing Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science by Title
Now showing items 21-40 of 79
-
Geodesic graphs
(2013-12-17)In the article, written in Russian, geodesic graphs, graphs with unique shortest path between every two vertices, are considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of Petersen. ... -
How to draw combinatorial maps?
(2013-01-31)In this article we consider the combinatorial map (rendered by permutations) approach to graphs on surfaces and how between both could be establish some terminological uniformity in favor of combinatorial maps in the way ... -
Inductive inference of recursive functions: complexity bounds
(Springer Verlag, 1991)This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. ... -
Matemātiķim Emanuelam Grinbergam - 80
(Zvaigžņotā Debess, 1990-01)īss izcilā latviešu matemātiķa Emanuela Grinberga dzīves un darbības apraksts -
MDA: correctness of model transformations. Which models are schemas?
(IOS Press, 2005)How to determine, is a proposed model transformation correct, or not? In general, the answer may depend on the model semantics. Of course, a model transformation is “correct”, if we can extend it to a “correct” instance ... -
Modeling and Query Language for Hospitals
(Springer, 2013) -
Motives for reflections Addendum to part one
(2013-12-17)The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973. -
Motives for reflections. Part one
(2013-12-12)Facsimile of manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in 1973. -
Motives for reflections. Part two
(2013-12-13)Facsimile of a manuscript from the archive of Emanuels Grinbergs, University of Latvia. The article (in three pieces of manuscripts), written in Russian, contains some reflections on graph theory. It may be written in ... -
Nonlinear Spectra: the Neumann Problem
(Vilnius Gediminas Technical University, 2009) -
Notes in the graph theory. A manuscript (with flower snark J5)
(2013-12-13)This fragment of manuscripts, written in Latvian, is taken from a hardcover notebook of E.Grinbergs. The date when these notes started 29.7.72 is clearly seen on the first page, on the page 7 the date is 31.8.72, on 10th ... -
On building 4-critical plane and projective plane multiwheels from odd wheels
(2013-01-31)We build unbounded classes of plane and projective plane multiwheels that are 4-critical that are received summing odd wheels as edge sums modulo two. These classes can be considered as ascending from a single common graph ... -
On computation in the limit by non-deterministic Turing machines
(Latvia State University, 1974) -
On computation in the limit by non-deterministic Turing machines
(Scientific Proceedings of Latvia State University, 1974) -
ON CYCLE INVARIANT
(2013-04-23)Taking the programming paradigm with the cycle invariant as a base notion there for a ground cycle paradigm, in a more general setting here these things are considered. Epistemological aspects with reference to Rene Descartes ... -
On Dirac magnetic monopole and Hopf fibration
(2012-12-18) -
On educational problems of mathematics for the faculty of economics and management
(2013-12-17)Problems concerning education of mathematics for the students of the Faculty of economics and managements are considered. -
On Grinbergs' differential geometry and finite fields
(2019-03-27)Emanuels Grinbergs, in his youth, during ten years, from 1933 until 1943, wrote three dissertations on one subject, namely, differential geometry [1, 2, 3]. We think that his work in this direction has been neglected for ... -
On Grinberg’s Criterion
(Universiteit Gent, Faculty of Science, 2019)We generalize Grinberg’s hamiltonicity criterion for planar graphs. To this end, we first prove a technical theorem for embedded graphs. As a special case of a corollary of this theorem we obtain Zaks’ extension of Grinberg’s ... -
On osculation, superosculation and characteristic points
(1943-04)Translated into English by D. Zeps Original text: Par oskulāciju, superoskulāciju un charakteristiskiem punktiem, https://dspace.lu.lv/dspace/handle/7/46435 Facsimile of the manuscript of dissertation: https://dspace ...