Related papers: Valid Orderings of Real Hyperplane Arrangements

In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.

We are given k points (events) in (n+1)-dimensional Minkowski space. Using the theory of hyperplane arrangments and chromatic polynomials, we obtain information the number of different orders in which the events can occur in different…

We investigate several topological and combinatorial properties of line arrangements. We associate to a line arrangement a link obtained by intersecting the arrangement with some sphere. Several topics are discussed: (a) some link…

Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…

Let $G(V,E)$ be a $k$-uniform hypergraph. A hyperedge $e \in E$ is said to be properly $(r,p)$ colored by an $r$-coloring of vertices in $V$ if $e$ contains vertices of at least $p$ distinct colors in the $r$-coloring. An $r$-coloring of…

We show that the coefficients of the characteristic polynomial of a central hyperplane arrangement $\mathcal A$, coincide with the multidegrees of the Gauss map of a pencil of hypersurfaces naturally associated to $\mathcal A$. As a…

Mixture models on order relations play a central role in recent investigations of transitivity in binary choice data. In such a model, the vectors of choice probabilities are the convex combinations of the characteristic vectors of all…

Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…

Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators.…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

We extend the Billera-Ehrenborg-Readdy map between the intersection lattice and face lattice of a central hyperplane arrangement to affine and toric hyperplane arrangements. For arrangements on the torus, we also generalize Zaslavsky's…

Levine defined the rational algebraic knot concordance group and proved that each nontrivial element is of order two, of order four, or of infinite order. The determination of the order of an element depends on a p-adic analysis for all…

Let $\mathscr{O}(P)$ and $\mathscr{C}(P)$ denote the order polytope and chain polytope, respectively, associated with a finite poset $P$. We prove the following result: if $P$ is a maximal ranked poset, then the number of triangular…

We are concerned with mapping class groups of surfaces with nonempty boundary. We present a very natural method, due to Thurston, of finding many different left orderings of such groups. The construction involves equipping the surface with…

This paper presents a state-of-the-art algorithm for the vertex enumeration problem of arrangements, which is based on the proposed new pivot rule, called the Zero rule. The Zero rule possesses several desirable properties: i) It gets rid…

Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…

We classify proper holomorphic mappings between generalized pseudoellipsoids of different dimensions. Those domains are parametrized by the exponents. The relations among them are also obtained. Main tool is the orthogonal decomposition of…

We give a new proof of the fact that the complement of the complexification of a real hyperplane arrangement is homotopy equivalent to the Salvetti complex of the associated oriented matroid. Our proof involves no choices, is relatively…

Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…

Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by…