126 citations · 136 across the 18 of their papers we have counts for
18 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…
A note on a generalization of eigenvector centrality for bipartite graphs and applications
Peteris Daugulis
Eigenvector centrality is a linear algebra based graph invariant used in various rating systems such as webpage ratings for search engines. A generalization of the eigenvector cent…
Nonuniqueness of semidirect decompositions for semidirect products with directly decomposable factors and applications for dihedral groups
Peteris Daugulis
Nonuniqueness of semidirect decompositions of groups is an insufficiently studied question in contrast to direct decompositions. We obtain some results about semidirect decompositi…
Normal forms of triangles and quadrilaterals up to similarity
Peteris Daugulis, Vija Vagale
In this paper the problem of finding a normal form of triangles and plane quadrilaterals up to similarity is considered. Several normal forms for triangles and a normal form for qu…
Graphs with vertices and cyclic automorphism group of order
Peteris Daugulis
The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic -groups. We show that…
Linear Optical Quantum Metrology with Single Photons: Exploiting Spontaneously Generated Entanglement to Beat the Shot-Noise Limit
Keith R. Motes, Jonathan P. Olson, Evan J. Rabeaux +3
Quantum number-path entanglement is a resource for super-sensitive quantum metrology and in particular provides for sub-shotnoise or even Heisenberg-limited sensitivity. However, s…
Connectome graphs and maximum flow problems
Peteris Daugulis
We propose to study maximum flow problems for connectome graphs. We suggest a few computational problems: finding vertex pairs with maximal flow, finding new edges which would incr…
Homomorphisms of connectome graphs
Peteris Daugulis
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fol…
-vertex graphs with cyclic automorphism group of order
Peteris Daugulis
We describe computational results about undirected graphs having vertices and automorphism group isomorphic to .
Graph structure of commuting functions
Peteris Daugulis
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting f…
On coordinatization of mathematics
Peteris Daugulis
The problem of advancing coordinatization of mathematics is considered. The need to develop a theory for measuring value and complexity of mathematical implications and proofs is d…
A parametrization of matrix conjugacy orbit sets as unions of affine planes
Peteris Daugulis
The problem of finding a canonical form of complex matrices up to conjugacy with the set of canonical matrices being a union of affine planes in the matrix space is considered. A s…
Coarsifications of the module isomorphism relation
Peteris Daugulis
In this paper new equivalence relations on the category for any associative algebra and several related results are given. The new equivalence relations are defined us…