Related papers: Hyperplane arrangements in polymake
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve…
We present a recursive way to partition hypergraphs which creates and exploits hypergraph geometry and is suitable for many-core parallel architectures. Such partitionings are then used to bring sparse matrices in a recursive Bordered Block…
We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be…
M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give an alternate proof using a log resolution, which is simpler and allows us to consider non-reduced arrangements. By applying the idea 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…
We consider optimal planning in a large-scale system formalised as a hierarchical finite state machine (HFSM). A planning algorithm is proposed computing an optimal plan between any two states in the HFSM, consisting of two steps: A…
The matrix formation associated to high-order discretizations is known to be numerically demanding. Based on the existing procedure of interpolation and lookup, we design a multiscale assembly procedure to reduce the exorbitant assembly…
We conjecture an algorithm to construct spin multipartitions and prove that all the level one Fock spaces using our combinatorics are modules over the quantum enveloping algebra.
The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
We describe the implementation of a subfield of the field of formal Puiseux series in polymake. This is employed for solving linear programs and computing convex hulls depending on a real parameter. Moreover, this approach is also useful…
We define and study the magnitude and magnitude homology of a real hyperplane arrangement by regarding its tope graph as a metric space. We prove several structural results for the magnitude of arrangements, including a symmetry formula,…
High-order reconstruction schemes for the solution of hyperbolic conservation laws in orthogonal curvilinear coordinates are revised in the finite volume approach. The formulation employs a piecewise polynomial approximation to the…
We give a numerical characterization of weighted hyperplane arrangements arising from Dunkl systems.
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We study the equilibrium phase diagram of binary mixtures of hard spheres as well as of parallel hard cubes. A superior cluster algorithm allows us to establish and to access the demixed phase for both systems and to investigate the subtle…
As modern architectures introduce additional heterogeneity and parallelism, we look for ways to deal with this that do not involve specialising software to every platform. In this paper, we take the Join Calculus, an elegant model for…
We construct a combinatorial generalization of the Leray models for hyperplane arrangement complements. Given a matroid and some combinatorial blowup data, we give a presentation for a bigraded (commutative) differential-graded algebra. If…
We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…
A union of an arrangement of affine hyperplanes $H$ in $R^d$ is the real algebraic variety associated to the principal ideal generated by the polynomial $p_{H}$ given as the product of the degree one polynomials which define the hyperplanes…