11 citations · 20 across the 7 of their papers we have counts for
7 papers
A simple division-free algorithm for computing Pfaffians
Adam J. Przezdziecki
We present a very simple algorithm for computing Pfaffians which uses no division operations. Essentially, it amounts to iterating matrix multiplication and truncation. Its complex…
Every countable group is the fundamental group of some compact subspace of R^4
Adam J. Przezdziecki
For every countable group G we construct a compact path connected subspace K of R^4 whose fundamental group is isomorphic to G. Our construction is much simpler than the one found…
An almost full embedding of the category of graphs into the category of abelian groups
Adam J. Przezdziecki
We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose…
Chains of group localizations
Adam J. Przezdziecki
We construct long sequences of localization functors L_a in the category of abelian groups such that L_a > L_b for infinite cardinals a < b less than some k. For sufficiently large…
An "almost" full embedding of the category of graphs into the category of groups
Adam J. Przezdziecki
We construct a functor from the category of graphs to the category of groups which is faithful and "almost" full, in the sense that it induces bijections of the Hom sets up to triv…
Large localizations of finite groups
Adam J. Przezdziecki
We construct examples of localizations in the category of groups which take the Mathieu group to groups of arbitrarily large cardinality which are ``abelian up to finitely…