diff --git a/cpp/dolfinx/mesh/Topology.cpp b/cpp/dolfinx/mesh/Topology.cpp
index c4249e7aa16..88c4c1c2566 100644
--- a/cpp/dolfinx/mesh/Topology.cpp
+++ b/cpp/dolfinx/mesh/Topology.cpp
@@ -814,8 +814,8 @@ Topology::index_maps(int dim) const
   for (std::size_t i = 0; i < _entity_types[dim].size(); ++i)
   {
     auto it = _index_maps.find({dim, int(i)});
-    assert(it != _index_maps.end());
-    maps.push_back(it->second);
+    if (it != _index_maps.end())
+      maps.push_back(it->second);
   }
   return maps;
 }
diff --git a/cpp/dolfinx/refinement/CMakeLists.txt b/cpp/dolfinx/refinement/CMakeLists.txt
index 9560e45c823..0d9d997c490 100644
--- a/cpp/dolfinx/refinement/CMakeLists.txt
+++ b/cpp/dolfinx/refinement/CMakeLists.txt
@@ -1,14 +1,16 @@
 set(HEADERS_refinement
-    ${CMAKE_CURRENT_SOURCE_DIR}/dolfinx_refinement.h
-    ${CMAKE_CURRENT_SOURCE_DIR}/interval.h
-    ${CMAKE_CURRENT_SOURCE_DIR}/plaza.h
-    ${CMAKE_CURRENT_SOURCE_DIR}/refine.h
-    ${CMAKE_CURRENT_SOURCE_DIR}/utils.h
-    ${CMAKE_CURRENT_SOURCE_DIR}/option.h
-    PARENT_SCOPE
+  ${CMAKE_CURRENT_SOURCE_DIR}/dolfinx_refinement.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/interval.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/plaza.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/refine.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/utils.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/option.h
+  ${CMAKE_CURRENT_SOURCE_DIR}/uniform.h
+  PARENT_SCOPE
 )
 
 target_sources(
   dolfinx PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/plaza.cpp
-                  ${CMAKE_CURRENT_SOURCE_DIR}/utils.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/uniform.cpp
+  ${CMAKE_CURRENT_SOURCE_DIR}/utils.cpp
 )
diff --git a/cpp/dolfinx/refinement/dolfinx_refinement.h b/cpp/dolfinx/refinement/dolfinx_refinement.h
index 46588b267b4..802cdc2eff6 100644
--- a/cpp/dolfinx/refinement/dolfinx_refinement.h
+++ b/cpp/dolfinx/refinement/dolfinx_refinement.h
@@ -12,3 +12,4 @@ namespace dolfinx::refinement
 
 #include <dolfinx/refinement/interval.h>
 #include <dolfinx/refinement/refine.h>
+#include <dolfinx/refinement/uniform.h>
diff --git a/cpp/dolfinx/refinement/uniform.cpp b/cpp/dolfinx/refinement/uniform.cpp
new file mode 100644
index 00000000000..ae9cc499ed5
--- /dev/null
+++ b/cpp/dolfinx/refinement/uniform.cpp
@@ -0,0 +1,291 @@
+
+#include <dolfinx/common/IndexMap.h>
+#include <dolfinx/common/Scatterer.h>
+#include <dolfinx/mesh/Mesh.h>
+#include <dolfinx/mesh/utils.h>
+#include <iterator>
+#include <vector>
+
+#include "uniform.h"
+
+using namespace dolfinx;
+
+template <typename T>
+mesh::Mesh<T>
+refinement::uniform_refine(const mesh::Mesh<T>& mesh,
+                           const mesh::CellPartitionFunction& partitioner)
+{
+  // Requires edges (and facets for some 3D meshes) to be built already
+  auto topology = mesh.topology();
+  int tdim = topology->dim();
+  if (tdim < 2)
+    throw std::runtime_error("Uniform refinement only for 2D and 3D meshes");
+
+  spdlog::info("Topology dim = {}", tdim);
+
+  // Collect up entity types on each dimension
+  std::vector<std::vector<mesh::CellType>> entity_types;
+  for (int i = 0; i < tdim + 1; ++i)
+    entity_types.push_back(topology->entity_types(i));
+  const std::vector<mesh::CellType>& cell_entity_types = entity_types.back();
+
+  // Get index maps for vertices and edges and create maps for new vertices
+  // New vertices are created for each old vertex, and also at the centre of
+  // each edge, each quadrilateral facet, and each hexahedral cell.
+  std::vector<std::vector<std::int64_t>> new_v;
+  std::vector<std::shared_ptr<const common::IndexMap>> index_maps;
+
+  // Indices for vertices and edges on dim 0 and dim 1.
+  std::vector<int> e_index = {0, 0};
+
+  // Check for quadrilateral faces and get index, if any.
+  if (auto it = std::find(entity_types[2].begin(), entity_types[2].end(),
+                          mesh::CellType::quadrilateral);
+      it != entity_types[2].end())
+    e_index.push_back(std::distance(entity_types[2].begin(), it));
+
+  if (tdim == 3)
+  {
+    // In 3D, check for hexahedral cells, and get index, if any.
+    if (auto it = std::find(cell_entity_types.begin(), cell_entity_types.end(),
+                            mesh::CellType::hexahedron);
+        it != entity_types[3].end())
+      e_index.push_back(std::distance(cell_entity_types.begin(), it));
+  }
+
+  // Add up all local vertices, edges, quad facets and hex cells.
+  std::int64_t nlocal = 0;
+  for (std::size_t dim = 0; dim < e_index.size(); ++dim)
+  {
+    if (topology->index_maps(dim).empty())
+      throw std::runtime_error(
+          "Missing entities of dimension " + std::to_string(dim)
+          + ", need to call create_entities(" + std::to_string(dim) + ")");
+    index_maps.push_back(topology->index_maps(dim)[e_index[dim]]);
+    new_v.push_back(std::vector<std::int64_t>(
+        index_maps.back()->size_local() + index_maps.back()->num_ghosts()));
+    nlocal += index_maps.back()->size_local();
+  }
+
+  // Get current geometry and put into new array for vertices
+  std::vector<std::int32_t> vertex_to_x(index_maps[0]->size_local()
+                                        + index_maps[0]->num_ghosts());
+
+  // Iterate over cells for each cell type
+  for (int j = 0; j < static_cast<int>(cell_entity_types.size()); ++j)
+  {
+    // Get geometry for each cell type
+    auto x_dofmap = mesh.geometry().dofmap(j);
+    auto c_to_v = topology->connectivity({tdim, j}, {0, 0});
+    auto dof_layout = mesh.geometry().cmaps().at(j).create_dof_layout();
+    std::vector<int> entity_dofs(dof_layout.num_dofs());
+    for (int k = 0; k < dof_layout.num_dofs(); ++k)
+      entity_dofs[k] = dof_layout.entity_dofs(0, k).front();
+
+    // Iterate over cells of this type
+    const auto im = topology->index_maps(tdim)[j];
+    for (std::int32_t c = 0; c < im->size_local() + im->num_ghosts(); ++c)
+    {
+      auto vertices = c_to_v->links(c);
+      for (std::size_t i = 0; i < vertices.size(); ++i)
+        vertex_to_x[vertices[i]] = x_dofmap(c, entity_dofs[i]);
+    }
+  }
+
+  // Compute offset for vertices related to each entity type
+  std::vector<std::int32_t> entity_offsets(index_maps.size() + 1, 0);
+  for (std::size_t i = 0; i < index_maps.size(); ++i)
+    entity_offsets[i + 1] = entity_offsets[i] + index_maps[i]->size_local();
+
+  // Copy existing vertices
+  std::vector<T> new_x(nlocal * 3);
+  auto x_g = mesh.geometry().x();
+  for (int i = 0; i < index_maps[0]->size_local(); ++i)
+    for (int j = 0; j < 3; ++j)
+      new_x[i * 3 + j] = x_g[vertex_to_x[i] * 3 + j];
+
+  // Create vertices on edges, quad facet and hex cell centres
+  for (int j = 1; j < static_cast<int>(index_maps.size()); ++j)
+  {
+    auto e_to_v = topology->connectivity({j, e_index[j]}, {0, 0});
+    std::int32_t w_off = entity_offsets[j];
+    std::int32_t num_entities = index_maps[j]->size_local();
+    assert(num_entities == entity_offsets[j + 1] - entity_offsets[j]);
+
+    for (std::int32_t w = 0; w < num_entities; ++w)
+    {
+      auto vt = e_to_v->links(w);
+      std::size_t nv_ent = vt.size();
+      std::array<T, 3> v = {0, 0, 0};
+      for (std::size_t i = 0; i < nv_ent; ++i)
+      {
+        for (int k = 0; k < 3; ++k)
+          v[k] += x_g[3 * vertex_to_x[vt[i]] + k];
+      }
+      // Get the (linear) center of the entity.
+      // TODO: change for higher-order geometry to use map.
+      for (int k = 0; k < 3; ++k)
+        new_x[(w + w_off) * 3 + k] = v[k] / static_cast<T>(nv_ent);
+    }
+  }
+
+  // Get this process global offset and range
+  std::int64_t nscan;
+  MPI_Scan(&nlocal, &nscan, 1, MPI_INT64_T, MPI_SUM, mesh.comm());
+  std::array<std::int64_t, 2> local_range = {nscan - nlocal, nscan};
+
+  // Compute indices for new vertices and share across processes
+  for (std::size_t j = 0; j < index_maps.size(); ++j)
+  {
+    std::int32_t num_entities = index_maps[j]->size_local();
+    assert(num_entities == entity_offsets[j + 1] - entity_offsets[j]);
+    std::iota(new_v[j].begin(), std::next(new_v[j].begin(), num_entities),
+              local_range[0] + entity_offsets[j]);
+
+    common::Scatterer sc(*index_maps[j], 1);
+    sc.scatter_fwd(std::span<const std::int64_t>(new_v[j]),
+                   std::span(std::next(new_v[j].begin(), num_entities),
+                             index_maps[j]->num_ghosts()));
+  }
+
+  // Create new topology
+  std::vector<std::vector<std::int64_t>> mixed_topology(
+      cell_entity_types.size());
+
+  // Find index of tets in topology list, if any
+  int ktet = -1;
+  auto it = std::find(cell_entity_types.begin(), cell_entity_types.end(),
+                      mesh::CellType::tetrahedron);
+  if (it != cell_entity_types.end())
+    ktet = std::distance(cell_entity_types.begin(), it);
+  // Topology for tetrahedra which arise from pyramid subdivision
+  std::array<int, 16> pyr_to_tet_list
+      = {5, 13, 7, 9, 6, 13, 11, 7, 10, 13, 12, 11, 8, 13, 9, 12};
+
+  std::vector<int> refined_cell_list;
+  for (int k = 0; k < static_cast<int>(cell_entity_types.size()); ++k)
+  {
+    // Reserve an estimate of space for the topology of each type
+    mixed_topology[k].reserve(mesh.topology()->index_maps(tdim)[k]->size_local()
+                              * 8 * 6);
+
+    // Select correct subdivision for celltype
+    // Hex -> 8 hex, Prism -> 8 prism, Tet -> 8 tet, Pyr -> 5 pyr + 4 tet
+    // Each `refined_cell_list` is the topology for cells of the same type,
+    // flattened, hence 64 entries for hex, 32 for tet, 48 for prism, 25 for
+    // pyramid. Additionally for pyramid there are 16 tetrahedron entries (see
+    // above).
+
+    switch (cell_entity_types[k])
+    {
+    case mesh::CellType::hexahedron:
+      spdlog::debug("Hex subdivision [{}]", k);
+      refined_cell_list
+          = {0, 9,  8,  20, 10, 22, 21, 26, 1, 11, 8,  20, 12, 23, 21, 26,
+             2, 13, 9,  20, 14, 24, 22, 26, 3, 13, 11, 20, 15, 24, 23, 26,
+             4, 16, 10, 21, 17, 25, 22, 26, 5, 16, 12, 21, 18, 25, 23, 26,
+             6, 17, 14, 22, 19, 25, 24, 26, 7, 18, 15, 23, 19, 25, 24, 26};
+      break;
+
+    case mesh::CellType::tetrahedron:
+      spdlog::debug("Tet subdivision [{}]", k);
+      refined_cell_list = {0, 7, 8, 9, 1, 5, 6, 9, 2, 4, 6, 8, 3, 4, 5, 7,
+                           9, 4, 6, 8, 9, 4, 8, 7, 9, 4, 7, 5, 9, 4, 5, 6};
+      break;
+
+    case mesh::CellType::prism:
+      spdlog::debug("Prism subdivision [{}]", k);
+      refined_cell_list
+          = {0,  6,  7,  8,  15, 16, 6,  1,  9,  15, 10, 17, 7,  9,  2,  16,
+             17, 11, 6,  9,  7,  15, 17, 16, 15, 17, 16, 12, 14, 13, 8,  15,
+             16, 3,  12, 13, 11, 17, 16, 5,  14, 13, 10, 15, 17, 4,  12, 14};
+      break;
+
+    case mesh::CellType::pyramid:
+      spdlog::debug("Pyramid subdivision [{}]", k);
+      refined_cell_list = {0,  5,  6, 13, 7,  1,  8,  5, 13, 9,  3,  10, 8,
+                           13, 12, 2, 6,  10, 13, 11, 7, 9,  11, 12, 4};
+      if (ktet == -1)
+        throw std::runtime_error("Cannot refine mesh with pyramids and no "
+                                 "tetrahedra.");
+      break;
+
+    case mesh::CellType::triangle:
+      spdlog::debug("Triangle subdivision [{}]", k);
+      refined_cell_list = {0, 4, 5, 1, 5, 3, 2, 3, 4, 3, 4, 5};
+      break;
+
+    case mesh::CellType::quadrilateral:
+      spdlog::debug("Quad subdivision [{}]", k);
+      refined_cell_list = {0, 4, 5, 8, 1, 6, 4, 8, 2, 7, 5, 8, 3, 7, 6, 8};
+      break;
+
+    default:
+      throw std::runtime_error("Unhandled cell type");
+    }
+
+    auto c_to_v = topology->connectivity({tdim, k}, {0, 0});
+    auto c_to_e = topology->connectivity({tdim, k}, {1, 0});
+
+    for (int c = 0; c < topology->index_maps(tdim)[k]->size_local(); ++c)
+    {
+      // Cell topology defined through its globally numbered vertices
+      std::vector<std::int64_t> entities;
+      // Extract new global vertex number for existing vertices
+      for (std::int32_t i : c_to_v->links(c))
+        entities.push_back(new_v[0][i]);
+      // Indices for vertices inserted on edges
+      for (std::int32_t i : c_to_e->links(c))
+        entities.push_back(new_v[1][i]);
+      if (e_index.size() > 2)
+      {
+        if (tdim == 3)
+        {
+          // Add any vertices on quadrilateral facets (3D mesh)
+          auto conn = topology->connectivity({3, k}, {2, e_index[2]});
+          if (conn)
+          {
+            for (std::int32_t i :
+                 topology->connectivity({3, k}, {2, e_index[2]})->links(c))
+              entities.push_back(new_v[2][i]);
+          }
+        }
+        // Add vertices for quadrilateral cells (2D mesh)
+        else if (cell_entity_types[k] == mesh::CellType::quadrilateral)
+          entities.push_back(new_v[2][c]);
+      }
+
+      // Add vertices for hex cell centres
+      if (e_index.size() > 3
+          and cell_entity_types[k] == mesh::CellType::hexahedron)
+        entities.push_back(new_v[3][c]);
+
+      for (int i : refined_cell_list)
+        mixed_topology[k].push_back(entities[i]);
+
+      if (cell_entity_types[k] == mesh::CellType::pyramid)
+      {
+        for (int i : pyr_to_tet_list)
+          mixed_topology[ktet].push_back(entities[i]);
+      }
+    }
+  }
+
+  spdlog::debug("Create new mesh");
+  std::vector<std::span<const std::int64_t>> topo_span(mixed_topology.begin(),
+                                                       mixed_topology.end());
+  mesh::Mesh new_mesh = mesh::create_mesh(
+      mesh.comm(), mesh.comm(), topo_span, mesh.geometry().cmaps(), mesh.comm(),
+      new_x, {new_x.size() / 3, 3}, partitioner);
+
+  return new_mesh;
+}
+
+/// @cond Explicit instatiation for float and double
+template mesh::Mesh<double>
+refinement::uniform_refine(const mesh::Mesh<double>& mesh,
+                           const mesh::CellPartitionFunction&);
+template mesh::Mesh<float>
+refinement::uniform_refine(const mesh::Mesh<float>& mesh,
+                           const mesh::CellPartitionFunction&);
+/// @endcond
diff --git a/cpp/dolfinx/refinement/uniform.h b/cpp/dolfinx/refinement/uniform.h
new file mode 100644
index 00000000000..5f70c150e4f
--- /dev/null
+++ b/cpp/dolfinx/refinement/uniform.h
@@ -0,0 +1,24 @@
+#include <dolfinx/mesh/Mesh.h>
+
+#pragma once
+
+namespace dolfinx::refinement
+{
+
+/// @brief Uniform refinement of a 2D or 3D mesh, containing any supported cell
+/// types.
+/// Hexahedral, tetrahedral and prism cells are subdivided into 8, each being
+/// similar to the original cell. Pyramid cells are subdivided into 5 similar
+/// pyramids, plus 4 tetrahedra. Triangle and quadrilateral cells are subdivided
+/// into 4 similar subcells.
+/// @tparam T Scalar type of the mesh geometry
+/// @param mesh Input mesh
+/// @param partitioner Function to partition new mesh across processes.
+/// @returns Uniformly refined mesh
+template <typename T>
+mesh::Mesh<T>
+uniform_refine(const mesh::Mesh<T>& mesh,
+               const mesh::CellPartitionFunction& partitioner
+               = mesh::create_cell_partitioner(mesh::GhostMode::none));
+
+} // namespace dolfinx::refinement
diff --git a/python/CMakeLists.txt b/python/CMakeLists.txt
index 42a5b6ef045..68e45482cab 100644
--- a/python/CMakeLists.txt
+++ b/python/CMakeLists.txt
@@ -1,6 +1,6 @@
 cmake_minimum_required(VERSION 3.21)
 
-project(dolfinx_nanobind LANGUAGES CXX)
+project(dolfinx_nanobind LANGUAGES CXX C)
 
 if(WIN32)
   # Windows requires all symbols to be manually exported. This flag exports all
diff --git a/python/dolfinx/mesh.py b/python/dolfinx/mesh.py
index 28c5eacdb55..8109794ec8e 100644
--- a/python/dolfinx/mesh.py
+++ b/python/dolfinx/mesh.py
@@ -189,6 +189,24 @@ def index_map(self, dim: int) -> _cpp.common.IndexMap:
                 f"Call `dolfinx.mesh.Topology.create_entities({dim}) first."
             )
 
+    def index_maps(self, dim: int) -> list[_cpp.common.IndexMap]:
+        """Get the IndexMaps that describes the parallel distribution of
+           the mesh entities, for each entity type of the dimension.
+
+        Args:
+            dim: Topological dimension.
+
+        Returns:
+            List of IndexMaps for the entities of dimension ``dim``.
+        """
+        if (imaps := self._cpp_object.index_maps(dim)) is not None:
+            return imaps
+        else:
+            raise RuntimeError(
+                f"Entities of dimension {dim} have not been computed."
+                f"Call `dolfinx.mesh.Topology.create_entities({dim}) first."
+            )
+
     def interprocess_facets(self) -> npt.NDArray[np.int32]:
         """List of inter-process facets, if facet topology has been
         computed."""
diff --git a/python/dolfinx/wrappers/fem.cpp b/python/dolfinx/wrappers/fem.cpp
index 594624f86b5..0f71e0d1010 100644
--- a/python/dolfinx/wrappers/fem.cpp
+++ b/python/dolfinx/wrappers/fem.cpp
@@ -734,6 +734,7 @@ void declare_form(nb::module_& m, std::string type)
       .def_prop_ro("dtype", [](const dolfinx::fem::Form<T, U>&)
                    { return dolfinx_wrappers::numpy_dtype<T>(); })
       .def_prop_ro("coefficients", &dolfinx::fem::Form<T, U>::coefficients)
+      .def_prop_ro("constants", &dolfinx::fem::Form<T, U>::constants)
       .def_prop_ro("rank", &dolfinx::fem::Form<T, U>::rank)
       .def_prop_ro("mesh", &dolfinx::fem::Form<T, U>::mesh)
       .def_prop_ro("function_spaces",
diff --git a/python/dolfinx/wrappers/refinement.cpp b/python/dolfinx/wrappers/refinement.cpp
index 1e7c73a8e96..f79add65eda 100644
--- a/python/dolfinx/wrappers/refinement.cpp
+++ b/python/dolfinx/wrappers/refinement.cpp
@@ -14,6 +14,7 @@
 #include <dolfinx/refinement/interval.h>
 #include <dolfinx/refinement/option.h>
 #include <dolfinx/refinement/refine.h>
+#include <dolfinx/refinement/uniform.h>
 #include <dolfinx/refinement/utils.h>
 #include <functional>
 #include <nanobind/nanobind.h>
@@ -33,6 +34,11 @@ namespace
 template <std::floating_point T>
 void export_refinement(nb::module_& m)
 {
+  m.def(
+      "uniform_refine", [](const dolfinx::mesh::Mesh<T>& mesh)
+      { return dolfinx::refinement::uniform_refine<T>(mesh); },
+      nb::arg("mesh"));
+
   m.def(
       "refine",
       [](const dolfinx::mesh::Mesh<T>& mesh,
diff --git a/python/test/unit/refinement/test_uniform.py b/python/test/unit/refinement/test_uniform.py
new file mode 100644
index 00000000000..a9d49adf5f4
--- /dev/null
+++ b/python/test/unit/refinement/test_uniform.py
@@ -0,0 +1,58 @@
+from mpi4py import MPI
+
+import pytest
+
+import dolfinx
+from dolfinx.mesh import CellType, Mesh, create_unit_cube, create_unit_square
+
+
+@pytest.mark.parametrize("ctype", [CellType.hexahedron, CellType.tetrahedron, CellType.prism])
+def test_uniform_refinement_3d(ctype):
+    mesh = create_unit_cube(MPI.COMM_WORLD, 3, 2, 1, cell_type=ctype)
+
+    ncells0 = mesh.topology.index_map(3).size_local
+    mesh.topology.create_entities(1)
+    mesh.topology.create_entities(2)
+
+    m2 = Mesh(dolfinx.cpp.refinement.uniform_refine(mesh._cpp_object), None)
+    ncells1 = m2.topology.index_map(3).size_local
+
+    assert mesh.comm.allreduce(ncells0) * 8 == mesh.comm.allreduce(ncells1)
+
+
+@pytest.mark.parametrize("ctype", [CellType.triangle, CellType.quadrilateral])
+def test_uniform_refinement_2d(ctype):
+    mesh = create_unit_square(MPI.COMM_WORLD, 12, 11, cell_type=ctype)
+
+    ncells0 = mesh.topology.index_map(2).size_local
+    mesh.topology.create_entities(1)
+
+    m2 = Mesh(dolfinx.cpp.refinement.uniform_refine(mesh._cpp_object), None)
+    ncells1 = m2.topology.index_map(2).size_local
+
+    assert mesh.comm.allreduce(ncells0) * 4 == mesh.comm.allreduce(ncells1)
+
+
+def test_uniform_refine_mixed_mesh(mixed_topology_mesh):
+    mesh = Mesh(mixed_topology_mesh, None)
+
+    ct = mesh.topology.entity_types[3]
+    ncells0 = {ct[j]: mesh.topology.index_maps(3)[j].size_local for j in range(4)}
+    print(ncells0)
+    mesh.topology.create_entities(1)
+    mesh.topology.create_entities(2)
+
+    m2 = Mesh(dolfinx.cpp.refinement.uniform_refine(mesh._cpp_object), None)
+    ncells1 = {ct[j]: m2.topology.index_maps(3)[j].size_local for j in range(4)}
+
+    comm = mesh.comm
+    assert comm.allreduce(ncells0[CellType.hexahedron]) * 8 == comm.allreduce(
+        ncells1[CellType.hexahedron]
+    )
+    assert comm.allreduce(ncells0[CellType.prism]) * 8 == comm.allreduce(ncells1[CellType.prism])
+    assert comm.allreduce(ncells0[CellType.pyramid]) * 5 == comm.allreduce(
+        ncells1[CellType.pyramid]
+    )
+    assert comm.allreduce(ncells0[CellType.tetrahedron]) * 8 + comm.allreduce(
+        ncells0[CellType.pyramid]
+    ) * 4 == comm.allreduce(ncells1[CellType.tetrahedron])