Related papers: Generalized threshold arrangements
In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…
Hyperplanes of the form x_j = x_i + c are called affinographic. For an affinographic hyperplane arrangement in R^n, such as the Shi arrangement, we study the function f(M) that counts integral points in [1,M]^n that do not lie in any…
We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…
We classify complex hyperplane arrangements $\mathcal A$ whose intersection posets $L(\mathcal A)$ satisfy $L(\mathcal A)=\pi_i^{-1}\circ\pi_i\bigl(L(\mathcal A)\bigr)$ for $i=1,\dots,n$. Here $\pi_i$ denotes the projection from $\mathbb…
In this article, by introducing a new method in estimating the counting function of the auxiliary function, we prove a new generalization of uniqueness theorems for meromorphic mappings into $\P^n(\C )$ which share few hyperplanes…
It is shown that the structure of the generalized quadrangle of order two is fully encoded in the properties of the Desargues configuration. A point of the quadrangle is represented by a geometric hyperplane of the Desargues configuration…
We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…
We show that the integral \int e^{S(x_1,...,x_n)}dx_1...dx_n, for an arbitrary polynomial S, satisfies a generalized hypergeometric system of differential equations in the sense of I. M. Gelfand et al.
For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…
The main aim of the note is to provide an upper-bound for the characteristic number of conic-line arrangements with ordinary singularities in the complex projective plane.
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…
To any semigroup presentation $\mathcal{P}= \langle \Sigma \mid \mathcal{R} \rangle$ and base word $w \in \Sigma^+$ may be associated a nonpositively curved cube complex $S(\mathcal{P},w)$, called a Squier complex, whose underlying graph…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…
By using the Poisson formula for resultants and the variants of chip-firing game on graphs, we provide a combinatorial method for computing a class of of resultants, i.e. the characteristic polynomials of the adjacency tensors of starlike…
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.