Now showing items 1-10 of 166
One more geodesic graph
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 ...
Some reflections on the education of computer scientists
This article in Latvian contains some reflections on educational problems what concerns computer science.
ON CYCLE INVARIANT
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 ...
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 ...
How to draw combinatorial maps?
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 ...
On building 4-critical plane and projective plane multiwheels from odd wheels
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 Dirac magnetic monopole and Hopf fibration
Redzes efekti, Ar redzi saistītas parādības, ilūzijas, iespaidi
Apkopoti dažādi ar redzi saistīti jautājumi, kuri ar studentiem pārrunāti Latvijas Universitātes Fizikas un matemātikas fakultātes Datorikas nodaļas specseminārā „Attēlu sintēze un analīze”. Jautājumi nosacīti grupējami ...