Related papers: A bound for crystallographic arrangements

In 1989, Ziegler introduced the concept of a multi-arrangement. One natural example is the reflection arrangement of a unitary reflection group with multiplicity given by the number of reflections associated with each hyperplane. For all…

We use numerical simulations to study the crystallization of monodisperse systems of hard aspherical particles. We find that particle shape and crystallizability can be easily related to each other when particles are characterized in terms…

A central question in the theory of hyperplane arrangements is when the complement of a complex arrangement is aspherical. Barkley and Speyer introduced a class of real arrangements that are called "clean," and Yoshinaga proved that every…

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

Given a real finite hyperplane arrangement A and a point p not on any of the hyperplanes, we define an arrangement vo(A,p), called the *valid order arrangement*, whose regions correspond to the different orders in which a line through p can…

For a crystallographic root system, dominant regions in the Catalan hyperplane arrangement are in bijection with antichains in a partial order on the positive roots. For a noncrystallographic root system, the analogous arrangement and…

We investigate point arrangements $v_i\in\mathbb R^d,i\in \{1,...,n \}$ with certain prescribed symmetries. The arrangement space of $v$ is the column span of the matrix in which the $v_i$ are the rows. We characterize properties of $v$ in…

A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…

In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…

We show that the wall crossing bijections between simples of the category O of the rational Cherednik algebras reduce to particular crystal isomorphisms which can be computed by a simple combinatorial procedure on multipartitions of fixed…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Crystallization is a key step in macromolecular structure determination by crystallography. While a robust theoretical treatment of the process is available, due to the complexity of the system, the experimental process is still largely one…

We study several rigidity properties of $p$-adic local systems on a smooth rigid analytic space $X$ over a $p$-adic field. We prove that the monodromy of the log isocrystal attached to a $p$-adic local system is ''rigid'' along irreducible…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

A theory of structure is formulated for systems of many structureless classical particles with stable local interactions in Euclidean space. Such systems are shown to have their structure in thermodynamic equilibrium determined exactly by a…

In this paper we prove that for each dimension $n$ there are only finitely many isomorphism classes of pairs of groups $(\Gamma,\mathrm{N})$ such that $\Gamma$ is an $n$-dimensional crystallographic group and $\mathrm{N}$ is a normal…

Strongly bounded groups are those groups for which every action by isometries on a metric space has orbits of finite diameter. Many groups have been shown to have this property, and all the known infinite examples so far have cardinality at…

We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…

Finding an optimal match between two different crystal structures underpins many important materials science problems, including describing solid-solid phase transitions, developing models for interface and grain boundary structures. In…

We investigate toric varieties defined by arrangements of hyperplanes and call them strongly symmetric. The smoothness of such a toric variety translates to the fact that the arrangement is crystallographic. As a result, we obtain a…