Related papers: Face Counting for Topological Hyperplane Arrangeme…

Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…

This paper culminates in the count of the number of 3-Veronese surfaces passing through 13 general points. This follows the case of 2-Veronese surfaces discovered by Coble in the 1920's. One important element of the calculation is a direct…

An $n$ arc in $(k-1)$-dimensional projective space is a set of $n$ points so that no $k$ lie on a hyperplane. In 1988, Glynn gave a formula to count $n$-arcs in the projective plane in terms of simpler combinatorial objects called…

In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…

Given a set $S$ of $n$ points in $\mathbb{R}^d$, a $k$-set is a subset of $k$ points of $S$ that can be strictly separated by a hyperplane from the remaining $n-k$ points. Similarly, one may consider $k$-facets, which are hyperplanes that…

We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…

We consider the space $F_n$ of configurations of $n$ points in $P^2$ satisfying the condition that no three of the points lie on a line. For $n = 4, 5, 6$, we compute $H^*(F_n; \mathbb{Q})$ as an $S_n$-representation. The cases $n = 5, 6$…

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

We introduce toric arrangements, essentially finite families of codimension 1 subtori of a torus or of their cosets, as a periodic generalization of hyperplane arrangements, compute cohomology of the complement of such an arrangement and…

We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…

Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approaches rely on explicit rules to derive valid inequalities that…

In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…

Given a general plane curve Y of degree d, we compute the number n_d of irreducible plane conics that are 5-fold tangent to Y. This problem has been studied before by Vainsencher using classical methods, but it could not be solved there…

This is a glossary of notions and methods related with the topological theory of collections of affine planes, including braid groups, configuration spaces, order complexes, stratified Morse theory, simplicial resolutions, complexes of…

This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…

Stanley in his paper [Stanley, Richard P.: Acyclic orientations of graphs In: Discrete Mathematics 5 (1973), Nr. 2, S. 171-178.] provided interpretations of the chromatic polynomial when it is substituted with negative integers. Greene and…

Originally in 1954 the Tutte polynomial was a bivariate polynomial associated to a graph in order to enumerate the colorings of this graph and of its dual graph at the same time. However the Tutte polynomial reveals more of the internal…

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…