Search
Now showing items 1-10 of 48
Kā mācīties (senās) valodas
(1988)
Author tells about his experience of learning of some ancient languages. Author introduces a notion the road starting paradigm in order to help for a student of ancient language to start to organize his/her study tools ...
Combinatorial Maps. Tutorial
(2012-03-22)
This tutorial introduces a reader in the theory of combinatorial maps theory as it is outlined in the author's article Graphs as rotations, KAM Series, Prague, 1996, arxiv.org/abs/0909.0104.
An Exhaustive Search Algorithm for Finding Hamiltonian Cycles
(EIK,Elektronische Informationsverarbeitung und Kybernetik, Universität Trier, Akademie Verlag, 1980)
The paper suggests an exhaustive search algorithm for finding
Hamiltonian circuits in an undirected graph based on depth-first
search and working successfully on sparse graphs. The method is
based on the idea not to ...
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 ...
The Learning of Ancient Languages as (super)Human Effort
(Cogprints, 2010)
Problems around teaching ancient languages are discussed. It is suggested to assume that learning and teaching of languages require some superhuman effort. Author’s experience of teaching ancient languages and producing ...
Lexical Key to some books of Syriac New Testament.
(2011-03-03)
Lexical Key to some books (Matthew 2-14,Gallatians, Titus) of Syriac New Testament in Latvian.
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?
(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 ...
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 Dirac magnetic monopole and Hopf fibration
(2012-12-18)