Andrzej Kisielewicz
Professor of Mathematics

Research interests

General: algebra, combinatorics, logic, computer science;
Structures: permutation groups, semigroups, ordered sets, graphs, clones, equational theories, integer sequences;
Also: philosophy of logic, artificial intelligence.

Teaching (in Polish)

Selected publications

• On the problem of freenes of multiplicative matrix semigroups, Theoretical Computer Science 411 (2010), 1115-1120 (with: P. Gawrychowski, M. Gutan).
• Collapsing words, permutation conditions and coherent colorings of trees, Theoretical Computer Science 410 (2009), 2135-2147 (with: A. Cherubini).
• Totally symmetric colored graphs, J. Graph Theory 62 (2009), 329-345 (with: M. Grech ).
• Rings and semigroups with permutable zero products, J. Pure and Applied Algebra, 206 (2006), 355-369 (with: M. Gutan).
• Reversible group rings, J. Algebra. 279 (2004), 280-291 (with M. Gutan).
• Pseudo-random properties of self-complementary symmetric graphs, J. Graph Theory 47 (2004), 310-316 (with W. Peisert) .
• Definabilty in the lattice of equational theories of commutative semigroups, Trans. Amer. Math. Soc. 356 (2004), 3483-3504.
• A very strong set theory, Studia Logica 61 (1998), 171-178 (results reported in Stanford Encyclopedia of Philosophy )
• Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998), 379-403.
• The complexity of upward drawings on spheres, Order 14 (1997), 327-363 (with S.M. Hashemi, I. Rival).
• Varieties of commutative semigroups, Trans. Amer. Math. Soc. 342 (1994), 275-306.
• A solution of Dedekind`s problem on the number of isotone Boolean functions, J. Reine Angew. Math. 386 (1988), 139-144. (the result reported in Wikipedia )

Brief Bio