Related papers: A bound for crystallographic arrangements
The hierarchy associated to clusters in the HDBSCAN algorithm has layers, which are defined by cardinality. The layers define a layer subposet of the HDBSCAN hierarchy, which is a strong deformation retract and admits a stability analysis.…
We perform extensive monomer-resolved computer simulations of suitably-designed amphiphilic dendritic macromolecules over a broad range of densities, proving the existence and stability of cluster crystals formed in these systems, as…
Multi-connected Universe models with space idenfication scales smaller than the size of the observable universe produce topological images in the catalogs of cosmic sources. In this review, we present the recent developments for the search…
In [Pal13] (arXiv:1106.4540) the second author proved that the sequence of "oriented" configuration spaces on an open connected manifold exhibits homological stability as the number of particles goes to infinity. To complement that result…
Classification of entanglement in multipartite quantum systems is an open problem solved so far only for bipartite systems and for systems composed of three and four qubits. We propose here a coarse-grained classification of entanglement in…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…
This paper is devoted to the problem of choosing the most suitable model of a geometrical system for describing the real crystallographic space. It has been shown that all 230 crystallographic groups used to describe the crystalline…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
In this article we describe the crystallization conjecture. It states that, in appropriate physical conditions, interacting particles always place themselves into periodic configurations, breaking thereby the natural translation-invariance…
Constellations are asymmetric generalisations of categories. Although they are not required to possess a notion of range, many natural examples do. These include commonly occurring constellations related to concrete categories (since they…
We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…
We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…
In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…
In an earlier paper \cite{yu2021Finiteness}, we showed that there are finitely many stationary configurations (consisting of equilibria, rigidly translating configurations, relative equilibria and collapse configurations) in the planar…
In this paper, a selection of elegant, highly symmetric examples of three-periodic tangled nets and filaments are presented. They are constructed via familiar crystal nets using edges as geometric scaffolds for n-fold helical windings.…
Detection of crystal structures from particle positions of crystalline assemblies formed in computer simulations is an unsolved problem. The standard protocol, formulated in the reciprocal space, for structure determination from…
We describe an algorithm that allows one to find dense packing configurations of a number of congruent disks in arbitrary domains in two or more dimensions. We have applied it to a large class of two dimensional domains such as rectangles,…
Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…
Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…