2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2021
Undirected determinant, permanent and their complexity
Diana Dziewa-Dawidczyk, Adam J. Przeździecki
We view the determinant and permanent as functions on directed weighted graphs and introduce their analogues for the undirected graphs. We prove that the task of computing the undi…
math.GN2017
The Haar Measure Problem
Adam J. Przeździecki, Piotr Szewczak, Boaz Tsaban
An old problem asks whether every compact group has a Haar-nonmeasurable subgroup. A series of earlier results reduce the problem to infinite metrizable profinite groups. We provid…
math.RA2013★ 2 cited
An axiomatic construction of an almost full embedding of the category of graphs into the category of R-objects
Rüdiger Göbel, Adam J. Przeździecki
We construct embeddings G of the category of graphs into categories of R-modules over a commutative ring R which are almost full in the sense that the maps induced by the functoria…