Related papers: Three-dimensional maps and subgroup growth
We investigate the Tits buildings of the paramodular groups with or without canonical level structure, respectively. These give important combinatorical information about the boundary of the toroidal compactification of the moduli spaces of…
In the present paper, we discuss the class of Type III and Type IV codes from the perspectives of neighbors. Our investigation analogously extends the results originally presented by Dougherty [8] concerning the neighbor graph of binary…
Much information about a graph can be obtained by studying its spanning trees. On the other hand, a graph can be regarded as a 1-dimensional cell complex, raising the question of developing a theory of trees in higher dimension. As observed…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
We consider a class of matrix integrals over the unitary group $U(N)$ with an infinite set of couplings characterized by a series $f(q)=\sum_{n \ge 1} a_n q^n$, with $a_n \in \mathbb{Z}$. Such integrals arise in physics as the partition…
This paper deals with computing topological invariants such as connected components, boundary surface genus, and homology groups. For each input data set, we have designed or implemented algorithms to calculate connected components,…
In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…
In this paper we study ternary algebras of third-order hypermatrices. By hypermatrix we mean a complex-valued variable with three indices, which is also called a three-dimensional matrix or spatial matrix. We assume that a hypermatrix is…
In this paper, firstly, we introduce a higher-dimensional analogue of hypergraphs, namely $\omega$-hypergraphs. This notion is thoroughly flexible because unlike ordinary $\omega$-graphs, an n-dimensional edge called an n-cell has many…
This article first answers to questions about connectedness of a new family of graphs on unicellular maps. Answering these questions goes through a description of the mapping class group as surgeries on unicellular maps. We also show how…
We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
We investigate the tensor-triangular geometry of the categories of isotropic Tate motives, isotropic Artin motives and isotropic Artin--Tate motives. In particular, we study the categories $DTM_{gm}(k/k;\mathbb{F}_2)$,…
We classify $n$-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if $n>3$, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
It is well-known that the space of derivations of $n$-dimensional evolution algebras with non-singular matrices is zero. On the other hand, the space of derivations of evolution algebras with matrices of rank $n-1$ has also been completely…
There are a number of ways to procedurally generate interesting three-dimensional shapes, and a method where a cellular neural network is combined with a mesh growth algorithm is presented here. The aim is to create a shape from a genetic…
We solve Dehn's isomorphism problem for virtually torsion-free relatively hyperbolic groups with nilpotent parabolic subgroups. We do so by reducing the isomorphism problem to three algorithmic problems in the parabolic subgroups, namely…
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…
We consider the isomorphism problem for groups specified by their multiplication tables. Until recently, the best published bound for the worst-case was achieved by the n^(log_p n + O(1)) generator-enumeration algorithm. In previous work…