English
Related papers

Related papers: From weakly separated collections to matroid subdi…

200 papers

In this paper we establish a variation of the Splitter Theorem. Let $M$ and $N$ be simple 3-connected matroids. We say that $x\in E(M)$ is vertically $N$-contractible if $si(M/x)$ is a 3-connected matroid with an $N$-minor. Whittle (for…

Combinatorics · Mathematics 2015-09-02 João Paulo Costalonga

The higher Bruhat orders $\mathcal{B}(n,k)$ were introduced by Manin-Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected $\mathcal{B}(n,k)$ to oriented matroids. In this paper, we…

Combinatorics · Mathematics 2024-12-17 Herman Chau

A thin shell finite element approach based on Loop's subdivision surfaces is proposed, capable of dealing with large deformations and anisotropic growth. To this end, the Kirchhoff-Love theory of thin shells is derived and extended to allow…

Numerical Analysis · Computer Science 2015-03-20 Roman Vetter , Norbert Stoop , Thomas Jenni , Falk K. Wittel , Hans J. Herrmann

Panhandle matroids are a specific family of lattice-path matroids corresponding to panhandle-shaped Ferrers diagrams. Their matroid polytopes are the subpolytopes carved from a hypersimplex to form matroid polytopes of paving matroids. It…

Combinatorics · Mathematics 2025-05-30 Danai Deligeorgaki , Daniel McGinnis , Andrés R. Vindas-Meléndez

We consider the semisimple orbits of a Vinberg $\theta$-representation. First we take the complex numbers as base field. By a case by case analysis we show a technical result stating the equality of two sets of hyperplanes, one…

Representation Theory · Mathematics 2024-10-08 Willem de Graaf , Hông Vân Lê

The principle of inclusion-exclusion is applied to subsets of maximal covectors contained in halfspaces of a simple oriented matroid and to convex subsets of its ground set for enumerating tope committees.

Combinatorics · Mathematics 2010-10-13 Andrey O. Matveev

We show that for all $\ell, k, n$ with $\ell \leq k/2$ and $(k-\ell)$ dividing $n$ the following hypergraph-variant of Lehel's conjecture is true. Every $2$-edge-colouring of the $k$-uniform complete hypergraph $\mathcal{K}_n^{(k)}$ on $n$…

Combinatorics · Mathematics 2018-05-30 Sebastian Bustamante , Maya Stein

Motivated by the Gray code interpretation of Hamiltonian cycles in Cayley graphs, we investigate the existence of Hamiltonian cycles in tope graphs of hyperplane arrangements, with a focus on simplicial, reflection, and supersolvable…

Combinatorics · Mathematics 2026-04-10 Veronika Körber , Tobias Schnieders , Jan Stricker , Jasmin Walizadeh

We study the communication complexity of multiplying $k\times t$ elements from the group $H=\text{SL}(2,q)$ in the number-on-forehead model with $k$ parties. We prove a lower bound of $(t\log H)/c^{k}$. This is an exponential improvement…

Computational Complexity · Computer Science 2024-09-12 Harm Derksen , Chin Ho Lee , Emanuele Viola

We study the Cox ring and monoid of effective divisor classes of $\overline{M}_{0,n} = Bl\mathbb{P}^{n-3}$, over a ring R. We provide a bijection between elements of the Cox ring, not divisible by any exceptional divisor section, and…

Algebraic Geometry · Mathematics 2016-03-09 Brent Doran , Noah Giansiracusa , David Jensen

For an arrangement $\mathcal{H}$ of hyperplanes in $\mathbb{R}^n$ through the origin, a region is a connected subset of $\mathbb{R}^n\setminus\mathcal{H}$. The graph of regions $G(\mathcal{H})$ has a vertex for every region, and an edge…

Combinatorics · Mathematics 2025-10-22 Sofia Brenner , Jean Cardinal , Thomas McConville , Arturo Merino , Torsten Mütze

The lattice cell in the ${i+1}^{st}$ row and ${j+1}^{st}$ column of the positive quadrant of the plane is denoted $(i,j)$. If $\mu$ is a partition of $n+1$, we denote by $\mu/ij$ the diagram obtained by removing the cell $(i,j)$ from the…

Combinatorics · Mathematics 2016-11-08 F. Bergeron , N. Bergeron , A. M. Garsia , M. Haiman , G. Tesler

We study the hyperplane arrangements associated, via the minimal model programme, to symplectic quotient singularities. We show that this hyperplane arrangement equals the arrangement of CM-hyperplanes coming from the representation theory…

Representation Theory · Mathematics 2017-07-05 Gwyn Bellamy , Travis Schedler , Ulrich Thiel

The distributed subgraph detection asks, for a fixed graph $H$, whether the $n$-node input graph contains $H$ as a subgraph or not. In the standard CONGEST model of distributed computing, the complexity of clique/cycle detection and listing…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-05 François Le Gall , Masayuki Miyamoto

In this paper, we consider the problem of finding weak independent sets in a distributed network represented by a hypergraph. In this setting, each edge contains a set of r vertices rather than simply a pair, as in a standard graph. A…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-11-21 Duncan Adamson , Will Rosenbaum , Paul G. Spirakis

Speyer recognized that matroids encode the same data as a special class of tropical linear spaces and Shaw interpreted tropically certain basic matroid constructions; additionally, Frenk developed the perspective of tropical linear spaces…

Algebraic Geometry · Mathematics 2023-03-03 Colin Crowley , Noah Giansiracusa , Joshua Mundinger

We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…

Optimization and Control · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

In this paper we describe several characterizations of basic finite-dimensional $k$-algebras $A$ stratified for all linear orders, and classify their graded algebras as tensor algebras satisfying some extra property. We also discuss whether…

Representation Theory · Mathematics 2013-11-07 Liping Li

A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…

Combinatorics · Mathematics 2010-01-24 David Forge , Thomas Zaslavsky

Planar arrays of tree diagrams were introduced as a generalization of Feynman diagrams that enables the computation biadjoint amplitudes $m^{(k)}_n$ for $k>2$ . In this follow-up work we investigate the poles of $m^{(k)}_n$ from the…

High Energy Physics - Theory · Physics 2024-03-27 Alfredo Guevara , Yong Zhang