Related papers: Non-very generic arrangements in low dimension

An abstract $(v_k,b_r)$-configuration is a pair of finite sets of cardinalities $v$ and $b$ with a relation on the product of the sets such that each element of the first set is related to the same number $k$ of elements from the second set…

By means of associated structural invariants, we efficiently construct four biplanes of order 9 - except the one with the smallest automorphism group, that is found by Janko and Trung. The notion of non-transversal vector is introduced…

The combinatorial basis of entropy by Boltzmann can be written $H= {N}^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy of a system, per unit entity, $N$ is the number of entities and $\mathbb{W}$ is the number of ways in which…

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…

One of the central problems in the topology of hyperplane arrangements is determining whether the complement is a $K(\pi,1)$-space. In this paper, we study Manin--Schechtman arrangements, introduced as higher-dimensional analogs of the…

This article computes the Varchenko determinant of dehyperplane arrangements which are generalizations of pseudohyperplane arrangements. But unlike those latter, they are defined on a real manifold, and it is not always possible to obtain a…

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is the so-called signotopes. Introduced by Manin and…

Let $n\geq 1$ and $X_{n}$ be the random variable representing the size of the smallest component of a random combinatorial object made of $n$ elements. A combinatorial object could be a permutation, a monic polynomial over a finite field, a…

We formulate a new class of tensor gauge field theories in any dimension that is a hybrid class between symmetric higher-rank tensor gauge theory (i.e., higher-spin gauge theory) and anti-symmetric tensor topological field theory. Our…

Given a symmetrizable Kac-Moody algebra $\mathfrack{g}$, we study its $\pi$-systems, which are subsets of real roots, the pairwise differences of whose elements are not roots. Such systems arise as simple systems of regular subalgebras of…

The geometry of cosets in the subgroups H of the two-generator free group G =\textless{} a, b \textgreater{} nicely fits, via Grothendieck's dessins d'enfants, the geometry of commutation for quantum observables. Dessins stabilize…

In a series of recent contributions on the notion of global breadth $\mathbf{B}(G)$ of a finite group $G$, it was interesting to observe the structural conditions arising from the classification of finite groups of $\mathbf{B}(G)=8$. This…

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…

Given a subspace arrangement, there are several De Concini-Procesi models associated to it, depending on distinct sets of initial combinatorial data (building sets). The first goal of this paper is to describe, for the root arrangements of…

We present noncommutative nonlinear supersymmetric theories. The first example is a non-polynomial Akulov-Volkov-type lagrangian with noncommutative nonlinear global supersymmetry in arbitrary space-time dimensions. The second example is…

In 1989, Erd\H{o}s conjectured that for a sufficiently large $n$ it is impossible to place $n$ points in general position in a plane such that for every $1\le i \le n-1$ there is a distance that occurs exactly $i$ times. For small $n$ this…

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…