Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Przeździecki, Adam J."'
Autor:
Przezdziecki, Adam J.
We present a very simple algorithm for computing Pfaffians which uses no division operations. Essentially, it amounts to iterating matrix multiplication and truncation. Its complexity, for a $2n\times 2n$ matrix, is $O(nM(n))$, where $M(n)$ is the co
Externí odkaz:
http://arxiv.org/abs/2302.12081
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 undirected determinants as well as permanents for planar graphs, whose ver
Externí odkaz:
http://arxiv.org/abs/2108.13090
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 provide a positive answer, assuming a weak, potentially provable, consequenc
Externí odkaz:
http://arxiv.org/abs/1709.02312
Autor:
Dziewa-Dawidczyk, Diana1 (AUTHOR), Przeździecki, Adam J.1 (AUTHOR) adam_przezdziecki@sggw.edu.pl
Publikováno v:
Graphs & Combinatorics. Aug2023, Vol. 39 Issue 4, p1-26. 26p.
Autor:
Przezdziecki, Adam J.
Publikováno v:
Bulletin of the Australian Mathematical Society 92 (2015) 145-148
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 recently by Virk.
Comment: 4 pages; figure on page 1 corrected
Comment: 4 pages; figure on page 1 corrected
Externí odkaz:
http://arxiv.org/abs/1411.2546
Autor:
Göbel, Rüdiger, Przeździecki, Adam J.
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 functoriality of G R[Hom_Graphs(X,Y)] --> Hom_R(GX,GY) are isomorphisms. The sy
Externí odkaz:
http://arxiv.org/abs/1305.3458
Autor:
Przezdziecki, Adam J.
Publikováno v:
Adv. Math. 257 (2014) 527 - 545
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 basis is the set Hom(X,Y). The isomorphism is functorial in X and Y. T
Externí odkaz:
http://arxiv.org/abs/1104.5689
Autor:
Przezdziecki, Adam J.
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 free abelian groups F and a < b we have proper inclusions of L_aF int
Externí odkaz:
http://arxiv.org/abs/0912.0582
Autor:
Przezdziecki, Adam J.
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 trivial homomorphisms and conjugation in the category of groups. We provid
Externí odkaz:
http://arxiv.org/abs/0912.0510