Related papers: A bound for crystallographic arrangements
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…
A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…
We show that big bang cosmology implies a high degree of entanglement of particles in the universe. In fact, a typical particle is entangled with many particles far outside our horizon. However, the entanglement is spread nearly uniformly…
We investigate the interplay of crystal bases and completions in the sense of Enright on certain nonintegrable representations of quantum groups. We define completions of crystal bases, show that this notion of completion is compatible with…
Given a partition $\lambda$ corresponding to a dominant integral weight of $\mathfrak{sl}_n$, we define the structure of crystal on the set of 5-vertex ice models satisfying certain boundary conditions associated to $\lambda$. We then show…
In [7, Papadima and Suciu, When does the associated graded Lie algebra of an arrangement group decompose? Comment. Math. Helv. {\bf 81:4} (2006), 859--875] it is proved that the holonomy Lie algebra of an arrangement of hyperplanes through…
In this article we show that any free hyperplane arrangement with exponents 1's and 2's is a supersolvable arrangement. We conjecture that any free arrangement with exponents 1's, 2's and exactly one 3, is also supersolvable, and we show…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
In this paper, we construct an infinite series of line arrangements in characteristic two, each featuring only triple intersection points. This finding challenges the existing conjecture that suggests the existence of only a finite number…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We define cone structures and asymptotic invariants for multigraded systems of ideals, and show that essentially the only restrictions on such structures is convexity, which is imposed formally.
In this article we prove two main results. Firstly, we show that any six-line arrangement, consisting of three pairs of mutually perpendicular lines, does not give rise to a "very generic or sufficiently general" discriminantal arrangement…
Complexity is a measure of information content. Crystalline materials are not complex systems because their structures can be represented tersely using the language of crystallography. Disordered materials are also structurally simple if…
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…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
Hierarchical clustering is a common algorithm in data analysis. It is unique among many clustering algorithms in that it draws dendrograms based on the distance of data under a certain metric, and group them. It is widely used in all areas…
Discriminantal arrangements are hyperplane arrangements, which are generalized braid ones. They are constructed from given hyperplane arrangements, but their combinatorics are not invariant under combinatorial equivalence. However, it is…
Constellations are partial algebras that are one-sided generalisations of categories. It has previously been shown that the category of inductive constellations is isomorphic to the category of left restriction semigroups. Here we consider…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…