6 citations · 8 across the 8 of their papers we have counts for
8 papers
Comparing different approaches to the concept of determinant: the multiplicative approach is the best!
Peteris Daugulis, Mikhail H Klin, Anita Sondore
The determinant is traditionally introduced through permutation expansions, multilinearity, or recursive expansion formulas - approaches that, while rigorous, often obscure its con…
Optimizing Administrative Divisions: A Vertex -Center Approach for Edge-Weighted Road Graphs
Peteris Daugulis
Efficient and equitable access to municipal services hinges on well-designed administrative divisions. It requires ongoing adaptation to changing demographics, infrastructure, and…
A PCA-based Data Prediction Method
Peteris Daugulis, Vija Vagale, Emiliano Mancini +1
The problem of choosing appropriate values for missing data is often encountered in the data science. We describe a novel method containing both traditional mathematics and machine…
-vertex graphs with automorphism groups and from icosahedron
Peteris Daugulis
The article deals with the problem of finding vertex-minimal graphs with a given automorphism group. We exhibit two undirected -vertex graphs having automorphism groups …
Classifying presentations of finite groups -- the case of dicyclic groups
Peteris Daugulis
The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equiv…
Strong connectivity and its applications
Peteris Daugulis
Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs…