Related papers: Extended Configurational Polyhedra Based on Graph …
This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the topology of the configuration space. We…
Site-occupancy disorder, defined as the non-periodic occupation of lattice sites in a crystal structure, is a ubiquitous phenomenon in solid-state physics and chemistry. Examples are mineral solid solutions, synthetic non-stoichiometric…
The study of spatial symmetries was accomplished during the last century, and had greatly improved our understanding of the properties of solids. Nowadays, the symmetry data of any crystal can be readily extracted from standard…
The structure-property hypothesis says that the properties of all materials are determined by an underlying crystal structure. The main obstacle was the ambiguity of conventional crystal representations based on incomplete or discontinuous…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
The notion of regular cell complexes plays a central role in topological combinatorics because of its close relationship with posets. A generalization, called totally normal cellular stratified spaces, was introduced by the third author by…
Groups defined by presentations for which the components of the corresponding star graph are the incidence graphs of generalized polygons are of interest as they are small cancellation groups that - via results of Edjvet and Vdovina - are…
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
We study hypergraphs which represent finite quantum event structures. We contribute to results of graph theory, regarding bounds on the number of edges, given the number of vertices. We develop a missing one for 3-graphs of girth 4. As an…
The structure of the densest crystal packings is determined for a variety of concave shapes in 2D constructed by the overlap of two or three disks. The maximum contact number per particle pair is defined and proposed as a useful means of…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
In this paper, we present a novel way to summarize the structure of large graphs, based on non-parametric estimation of edge density in directed multigraphs. Following coclustering approach, we use a clustering of the vertices, with a…
We introduce a method for modeling a configuration of objects in 2D or 3D images using a mathematical "skeletal linking structure" which will simultaneously capture the individual shape features of the objects and their positional…
Omnidirectional cameras are widely used in such areas as robotics and virtual reality as they provide a wide field of view. Their images are often processed with classical methods, which might unfortunately lead to non-optimal solutions as…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological…
We have developed a symmetry-adapted modeling procedure for molecules and crystals. By using the completeness of multipoles to express spatial and time-reversal parity-specific anisotropic distributions, we can generate systematically the…