Related papers: Independence Complexes of Cylinders Constructed fr…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
The hexagonal polygon model arises in a natural way via a transformation of the 1-2 model on the hexagonal lattice, and it is related to the high temperature expansion of the Ising model. There are three types of edge, and three…
A method is described by which a function defined on a cubic grid (as from a finite difference solution of a partial differential equation) can be resolved into spherical harmonic components at some fixed radius. This has applications to…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…
We consider the following question: How much of the combinatorial structure determining properties of $\overline{\mathcal{M}_{0, n}}$ is ``intrinsic'' and how much new information do we obtain from using properties specific to this space?…
We use numerical simulations to understand how random deviations from the ideal spherical shape affect the ability of hard particles to form fcc crystalline structures. Using a system of hard spheres as a reference, we determine the…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
We solve some computational problems for triangulated closed three-dimensional manifolds using groups of simplicial homology and cohomology modulo 2. Two efficient algorithms for computing the intersection numbers of 1- and 2-dimensional…
Suppose N is a compressible boundary component of a compact orientable irreducible 3-manifold M and Q is an orientable properly embedded essential surface in M in which each component is incident to N and no component is a disk. Let VN and…
We show that the morphisms from the braid group with n strands in the mapping class group of a surface with a possible non empty boundary, assuming that its genus is smaller or equal to n/2 are either cyclic morphisms (their images are…
We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism $\phi$ between two isomorphic graphs is as hard as computing $\phi$ itself. This result optimally improves upon a result of G\'{a}l et al.…
This paper shows NP-completeness for finding Hamiltonian cycles in induced subgraphs of the dual graphs of semi-regular tessilations. It also shows NP-hardness for a new, wide class of graphs called augmented square grids. This work follows…
The surface Houghton groups $\mathcal{H}_{n}$ are a family of groups generalizing Houghton groups $H_n$, which are constructed as asymptotically rigid mapping class groups. We give a complete computation of the BNSR-invariants…
We establish the following Hadamard--Stoker type theorem: Let $f:M^n\rightarrow\mathscr{H}^n\times\mathbb R$ be a complete connected hypersurface with positive definite second fundamental form, where $\mathscr H^n$ is a Hadamard manifold.…
We develop general techniques for computing the fundamental group of the configuration space of $n$ identical particles, possessing a generic internal structure, moving on a manifold $M$. This group generalizes the $n$-string braid group of…
For every compact almost complex manifold (M,J) equipped with a J-preserving circle action with isolated fixed points, a simple algebraic identity involving the first Chern class is derived. This enables us to construct an algorithm to…
In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A Hamilton…
The structural properties of packed soft-core particles provide a platform to understand the cross-pollinated physical concepts in solid-state- and soft-matter physics. Confined on spherical surface, the traditional differential geometry…
We study the entanglement properties of a quantum lattice-gas model for which we can find the exact ground state (of the Rokhsar-Kivelson type). The ground state can be expressed as a superposition of states, each of which is characterized…
This is the second in a pair of articles that classify the configuration space and kinematic symmetry groups for $N$ identical particles in one-dimensional traps experiencing Galilean-invariant two-body interactions. These symmetries…