Related papers: Non-very generic arrangements in low dimension

Varchenko defined the Varchenko matrix associated to any real hyperplane arrangement and computed its determinant. In this paper, we show that the Varchenko matrix of a hyperplane arrangement has a diagonal form if and only if it is…

We consider the possibility that the basic space of physics is not spacetime, but configuration space. We illustrate this on the example with a system of gravitationally interacting point particles. It turns out that such system can be…

We show that a proper algebraic n-dimensional scheme Y admits nontrivial vector bundles of rank n, even if Y is non-projective, provided that there is a modification containing a projective Cartier divisor that intersects the exceptional…

In a highly influential paper, Bidigare, Hanlon and Rockmore showed that a number of popular Markov chains are random walks on the faces of a hyperplane arrangement. Their analysis of these Markov chains took advantage of the monoid…

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 introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

A generic rectangulation is a partition of a rectangle into finitely many interior-disjoint rectangles, such that no four rectangles meet in a point. In this work we present a versatile algorithmic framework for exhaustively generating a…

In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…

Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…

An integral coefficient matrix determines an integral arrangement of hyperplanes in R^m. After modulo q reduction, the same matrix determines an arrangement A_q of "hyperplanes" in Z^m. In the special case of central arrangements, Kamiya,…

A second-order invariant of C. Voisin gives a powerful method for bounding from below the geometric genus of a k-dimensional subvariety of a degree-d hypersurface in complex projective n-space. This work uses the Voisin method to establish…

In 1933, van Kampen described the fundamental groups of the complements of plane complex projective algebraic curves. Recently, Ch\'eniot-Libgober proved an analogue of this result for higher homotopy groups of the complements of complex…

The concept of linear set in projective spaces over finite fields was introduced by Lunardon in 1999 and it plays central roles in the study of blocking sets, semifields, rank-distance codes and etc. A linear set with the largest possible…

When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…

Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…

In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p". The main theorem placed restrictions on the parameters of a primitive but not 2-transitive permutation group of degree three times a…

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

Motivated by work of Coxeter (1957), we study a class of algebras associated to Coxeter groups, which we term 'generalized nil-Coxeter algebras'. We construct the first finite-dimensional examples other than usual nil-Coxeter algebras;…

Hexastix is an arrangement of non-overlapping infinite hexagonal prisms in four different directions that cover $\frac{3}{4}$ of space. We consider a possible generalization to $n$ dimensions, based on the permutohedral lattice $A^*_n$. The…

A mixture of variance-gamma distributions is introduced and developed for model-based clustering and classification. The latest in a growing line of non-Gaussian mixture approaches to clustering and classification, the proposed mixture of…