English
Related papers

Related papers: Root Cones and the Resonance Arrangement

200 papers

We study a family of polynomials associated with ascent-descent statistics on labeled rooted plane k-ary trees introduced by Gessel, from a rook-theoretic perspective. We generalize the excedance statistic on permutations to maximal…

Combinatorics · Mathematics 2016-04-26 Vasu Tewari

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…

Algebraic Geometry · Mathematics 2025-06-05 Thiago Fassarella , Nivaldo Medeiros

Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…

Number Theory · Mathematics 2020-09-28 Hideki Murahara , Tatsushi Tanaka

The need of mathematically formulate relations between composite materials' properties and its resonance response is growing. This is due the fast technological advancement in micro-material manufacturing, present in chips for instance. In…

Mathematical Physics · Physics 2022-05-03 Taoufik Meklachi

We use stratified Morse theory to construct a complex to compute the cohomology of the complement of a hyperplane arrangement with coefficients in a complex rank one local system. The linearization of this complex is shown to be the…

Algebraic Geometry · Mathematics 2007-05-23 Daniel C. Cohen , Peter Orlik

This is the first in a series of papers in which we describe explicit structural properties of spaces of diagonal rectangular harmonic polynomials in $k$ sets of $n$ variables, both as $GL_k$-modules and $S_n$-modules, as well as some of…

Combinatorics · Mathematics 2020-03-18 François Bergeron

We introduce a notion of finite sampling consistency for phylogenetic trees and show that the set of finitely sampling consistent and exchangeable distributions on n leaf phylogenetic trees is a polytope. We use this polytope to show that…

Combinatorics · Mathematics 2019-03-06 Ben Hollering , Seth Sullivant

A well studied problem in algebraic complexity theory is the determination of the complexity of problems relying on evaluations of bilinear maps. One measure of the complexity of a bilinear map (or 3-tensor) is the optimal number of…

Information Theory · Computer Science 2021-03-23 Eimear Byrne , Giuseppe Cotardo

In this paper, we study simplicial hyperplane arrangements in real projective $3$-space. We give a necessary condition for the characteristic polynomial to have only real roots, valid also for non-simplicial arrangements. As application, we…

Combinatorics · Mathematics 2021-08-31 David Geis

This article deals with the construction of surfaces that are suitable for representing pentachords or 5-pitch segments that are in the same $T/I$ class. It is a generalization of the well known \"Ottingen-Riemann torus for triads of…

History and Overview · Mathematics 2013-01-21 Luis A. Piovan

In this paper we consider the hyperplane arrangement in $\mathbb{R}^n$ whose hyperplanes are $\{x_i + x_j = 1\mid 1\leq i < j\leq n\}\cup \{x_i=0,1\mid 1\leq i\leq n\}$. We call it the \emph{boxed threshold arrangement} since we show that…

Combinatorics · Mathematics 2021-02-25 Priyavrat Deshpande , Krishna Menon , Anurag Singh

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…

Databases · Computer Science 2007-05-23 Georg Gottlob , Christoph Koch , Klaus U. Schulz

We investigate several hyperplane arrangements that can be viewed as deformations of Coxeter arrangements. In particular, we prove a conjecture of Linial and Stanley that the number of regions of the arrangement x_i - x_j = 1, 1 \leq i<j…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Richard P. Stanley

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…

Computational Geometry · Computer Science 2020-08-10 David Eppstein

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…

Computational Geometry · Computer Science 2026-03-12 Mathilde Bouvel , Valentin Féray , Xavier Goaoc , Florent Koechlin

This work presents the tessellations and polytopes from the perspective of both n-dimensional geometry and abstract symmetry groups. It starts with a brief introduction to the terminology and a short motivation. In the first part, it…

Group Theory · Mathematics 2023-01-06 Plamen Dimitrov

For an arrangement with complement X and fundamental group G, we relate the truncated cohomology ring, H^{<=2}(X), to the second nilpotent quotient, G/G_3. We define invariants of G/G_3 by counting normal subgroups of a fixed prime index p,…

Geometric Topology · Mathematics 2007-05-23 Daniel Matei , Alexander I. Suciu

Hyperplane arrangements form the geometric counterpart of combinatorial objects such as matroids. The shape of the sequence of Betti numbers of the complement of a hyperplane arrangement is of particular interest in combinatorics, where…

Algebraic Geometry · Mathematics 2013-09-10 Nero Budur

We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…

Combinatorics · Mathematics 2025-05-21 Taylor Brysiewicz , Holger Eble , Lukas Kühne
‹ Prev 1 4 5 6 7 8 10 Next ›