J. Makowsky

activity

20062026

most citedThe quantum FFT can be classically simulated

40 citations · 96 across the 32 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

How I got to like graph polynomials

Johann A. Makowsky

For Boris Zilber on his 75th birthday. I trace the roots of my collaboration with Boris Zilber, which combines categoricity theory, finite model theory, algorithmics, and combinato…

math.CO2023

Counting Finite Topologies

Eldar Fischer, Johann A. Makowsky

In this paper we study the number of finite topologies on an $n$ -element set subject to various restrictions.

math.CO2023★ 1 cited

MC-finiteness of restricted set partition functions

Yuval Filmus, Eldar Fischer, Johann A. Makowsky +1

A sequence $s (n)$ of integers is MC-finite if for every $m \in N^{+}$ the sequence $s^{m} (n) = s (n) mod m$ is ultimately periodic. We discuss various ways of proving and di…