Browsing Matemātikas un informātikas institūts / Institute of Mathematics and Computer Science by Title
Now showing items 30-49 of 79
-
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 ... -
On speeding up synthesis and prediction of functions
(Latvia State University, 1974) -
On the reducibility of function classes
(Latvia State University, 1972)N – the set of all natural numbers, F – the set of all total functions N→N, A, B<=F. We say that A is m-reducible to B (A<=m B), iff there is a recursive operator M such that f in A, iff M(f) in B for all f in F. Similarly, ... -
One more geodesic graph
(2013-12-17)In this note, written in Latvian, a way to build geodesic graphs, graphs with unique shortest path between every two vertices, is considered. Geodesic graphs are trees, odd cycles, and nontrivial example, the graph of ... -
Ornamental sign language in the first order tracery belts
(Prespacetime Journal, 2010)We consider an ornamental sign language of first order where principles of sieve displacement, of asymmetric building blocks as a base of ornament symmetry, color exchangeability and side equivalence principles work. Generic ... -
ORNAMENTAL SIGN LANGUAGE IN THE FIRST ORDER TRACERY BELTS
(QuantumDream, Inc., 2013-09-02) -
Par n dimensiju Eiklīda telpas līknēm
(1936-10) -
Par oskulāciju, superoskulāciju un charakteristiskiem punktiem
(1943-04)No Dr. A.Lūša raksturojuma E.Grinberga zinātniskajam darbam: Doktora disertacija, ko E.Grīnbergs sācis strādāt 1940/41 m.g. Latvija Valsts Universitātē un aizstāvējis Rīgas Universitātē 1944.g. /oponenti prof.Dr.A.Lūsis, ...