Related papers: The crossing model for regular $A_n$-crystals
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…
Experimental DSC and Avrami curves for the crystallization of metallic glasses demonstrate nucleation at grain boundaries and thus indicate their grain structure, which refutes the generally accepted idea of glass as a homogeneous frozen…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
Crystal structures can be viewed as assemblies of space-filling polyhedra, which play a critical role in determining material properties such as ionic conductivity and dielectric constant. However, most conventional crystal structure…
We review the existing mathematical models which describe physicochemical mechanisms capable of producing a symmetry-breaking transition to a state in which one chirality dominates the other. A new model is proposed, with the aim of…
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…
A dessin is a 2-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving automorphisms acts regularly on the edges. In this paper we…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
Determining whether a candidate crystalline material is thermodynamically stable depends on identifying its true ground-state structure, a central challenge in computational materials science. We introduce CrystalGRW, a diffusion-based…
Spin-crossover has a wide range of applications from memory devices to sensors. This has to do mainly with the nature of the transition, which may be abrupt, gradual or incomplete and may also present hysteresis. This transition alters the…
We introduce a new "universality class" of artificial optical media - photonic hyper-crystals. These hyperbolic metamaterials with periodic spatial variation of dielectric permittivity on subwavelength scale, combine the features of optical…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…
We prove that the empirical density of states of quantum spin glasses on arbitrary graphs converges to a normal distribution as long as the maximal degree is negligible compared with the total number of edges. This extends the recent…
Quasicrystals can be considered, from the point of view of their electronic properties, as being intermediate between metals and insulators. For example, experiments show that quasicrystalline alloys such as AlCuFe or AlPdMn have…
A simple graph-product type construction shows that for all natural numbers $r \ge q$, there exists an edge-coloring of the complete graph on $2^r$ vertices using $r$ colors where the graph consisting of the union of arbitrary $q$ color…
We suggest a combinatorial classification of metric filtrations in measure spaces; a complete invariant of such a filtration is its combinatorial scheme, a measure on the space of hierarchies of the group~$\mathbb Z$. In turn, the notion of…
The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic…
We introduce a construction to embed a quasiperiodic lattice of obstacles into a single unit cell of a higher-dimensional space, with periodic boundary conditions. This construction transparently shows the existence of channels in these…
We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…