Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Zeps, Dainis"'
Autor:
Zeps, Dainis
Šajā darbā mēs pētam kombinatoriskās kartes, kas tiek kodētas kā permutāciju pāri, pielietojot ģeometrisku ideju, ka stūri starp šķautnēm grafam, kas izvietots uz virsmas, ir elementi, uz kuriem permutācijas darbojas.Ģeometriskās ko
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00417773
http://tel.archives-ouvertes.fr/docs/00/41/77/73/PDF/thesis.pdf
http://tel.archives-ouvertes.fr/docs/00/41/77/73/PDF/thesis.pdf
Autor:
Zeps, Dainis, Kikusts, Paulis
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other notions a
Externí odkaz:
http://arxiv.org/abs/1207.5673
Autor:
Zeps, Dainis
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 single common graph that can be received as edge
Externí odkaz:
http://arxiv.org/abs/1202.4862
Autor:
Zeps, Dainis
4-critical wheel graphs of higher order are considered concerning their belonging to free-planar or free-Hadwiger classes.
Externí odkaz:
http://arxiv.org/abs/1106.1336
Autor:
Zeps, Dainis
We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization leads to mo
Externí odkaz:
http://arxiv.org/abs/1010.2615
Autor:
Zeps, Dainis
Free-minor closed classes [2] and free-planar graphs [3] are considered. Versions of Kuratowski-like theorem for free-planar graphs and Kuratowski theorem for planar graphs are considered.
Comment: preprint in KAM Series DIMATIA, 98-409, Prague,
Comment: preprint in KAM Series DIMATIA, 98-409, Prague,
Externí odkaz:
http://arxiv.org/abs/0909.0328
Autor:
Zeps, Dainis
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces. Further, we def
Externí odkaz:
http://arxiv.org/abs/0909.0104
Autor:
Zeps, Dainis
The words ΓΝΩΘΙ ΣΕΑΥΤΟΝ (Gnothi Seauton) are inscribed at the entrance to the Temple of Apollo at Delphi. The paraphrase ΓΝΩΘΙ ΜΑΘΗΜΑ we use to ask some questions in addressing the main question – what is the basis of our thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1711::9bdc29a3cfe01e28faac8fd36120a20c
http://scireprints.lu.lv/504/
http://scireprints.lu.lv/504/
Autor:
Zeps, Dainis
Aplūkojam vienu no AI language model rīkiem, ChatGPT, ko matemātiķis var gūt no šādām AI sistēmām. Apskatām sarunas ar GPT, apskatām rekomendācijas, kādas dod gan pats GPT, gan ko izsecinām no prakses, GPT lietojot. Diskutējam par GPT
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1711::f0031333050df0b23f89a9ed535b6f94
http://scireprints.lu.lv/503/
http://scireprints.lu.lv/503/
Autor:
Zeps, Dainis
Galvenais grāmatas jautājums ir: Vai matemātika ir atklājums vai izgudrojums?
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1711::91659c843d13c293526644e5f576759c
http://scireprints.lu.lv/435/
http://scireprints.lu.lv/435/