Searcharxiv⌕ Search

arXiv subjects

Adam J. Przezdziecki

Publications and source records attributed to Adam J. Przezdziecki.

7 recordsLinked to original sources
arXiv2023

A simple division-free algorithm for computing Pfaffians

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 cost of matrix multiplication. In case of a sparse matrix, $M(n)$ is the cost of the dense-sparse matrix multiplication. The algorithm is an adaptation of the Bird algorithm for determinants. We show how to extract, with practically no additional work, the characteristic polynomial and the Pfaffian characteristic polynomial from these algorithms.

cs.DS↗
arXiv2014

An almost full embedding of the category of graphs into the category of abelian groups

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. The existence of such an embedding implies that, contrary to a common belief, the category of abelian groups is as complex and comprehensive as any other concrete category. We use this embedding to settle an old problem of Isbell whether every full subcategory of the category of abelian groups, which is closed under limits, is reflective. A positive answer turns out to be equivalent to weak Vopenka's principle, a large cardinal axiom which is not provable but believed to be consistent with standard set theory. Several known constructions in the category of abelian groups are obtained as quick applications of the embedding. In the revised version we add some consequences to the Hovey-Palmieri-Stricland problem about existence of arbitrary localizations in a stable homotopy category

math.CT↗
arXiv2010

An "almost" full embedding of the category of graphs into the category of groups

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 provide several applications of this construction to localizations (i.e. idempotent functors) in the category of groups and the homotopy category.

math.GR↗
arXiv2009

Chains of group localizations

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 into L_bF.

math.GR↗
arXiv2008

Large localizations of finite groups

We construct examples of localizations in the category of groups which take the Mathieu group $M_{11}$ to groups of arbitrarily large cardinality which are ``abelian up to finitely many generators''. The paper is part of a broader study on the group theoretic properties which are or are not preserved by localizations.

math.GR↗
arXiv2002

Homotopical localizations at a space

Our main motivation for the work presented in this paper is to construct a localization functor, in a certain sense dual to the f-localization of Bousfield and Farjoun, and to study some of its properties. We succeed in a case which is related to the Sullivan profinite completion. As a corollary we prove the existence of certain cohomological localizations.

math.AT↗