English
Related papers

Related papers: Signotopes with few plus signs

200 papers

The purpose of this article is to initiate a combinatorial study of the Bruhat-Chevalley ordering on certain sets of permutations obtained by omitting the parentheses from their standard cyclic notation. In particular, we show that these…

Combinatorics · Mathematics 2013-08-29 Mahir Bilen Can , Yonah Cherniavsky

The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this…

Combinatorics · Mathematics 2007-09-21 Suho Oh , Alexander Postnikov , Hwanchul Yoo

The CSP dichotomy conjecture has been recently established, but a number of other dichotomy questions remain open, including the dichotomy classification of list homomorphism problems for signed graphs. Signed graphs arise naturally in many…

Combinatorics · Mathematics 2023-03-06 Jan Bok , Richard Brewster , Pavol Hell , Nikola Jedličková , Arash Rafiey

Arrangements of lines and pseudolines are fundamental objects in discrete and computational geometry. They also appear in other areas of computer science, such as the study of sorting networks. Let $B_n$ be the number of nonisomorphic…

Combinatorics · Mathematics 2018-12-10 Adrian Dumitrescu , Ritankar Mandal

This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn digraph of higher order and connecting these cycles into one…

Combinatorics · Mathematics 2008-12-23 Abbas Alhakim , Mufutau Akinwande

A new efficient approach to the analysis of nonlinear higher-spin equations, that treats democratically auxiliary spinor variables $Z_A$ and integration homotopy parameters in the non-linear vertices of the higher-spin theory, is developed.…

High Energy Physics - Theory · Physics 2023-11-14 M. A. Vasiliev

This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…

Combinatorics · Mathematics 2022-12-13 Benjamin Peet

In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…

Combinatorics · Mathematics 2016-09-07 Jean-Louis Loday , Maria O. Ronco

We study the question of finding big Bruhat intervals that are poset hypercubes in the symmetric group $S_n$. Using permutations suggested by AlphaEvolve (an evolutionary coding agent developed by Google DeepMind), we were led to an unusual…

Combinatorics · Mathematics 2026-01-06 Jordan Ellenberg , Nicolas Libedinsky , David Plaza , José Simental , Geordie Williamson

Manin and Schechtman introduced a family of arrangements of hyperplanes generalizing classical braid arrangements, which they called the $\textit{discriminantal arrangements}$. Athanasiadis proved a conjecture by Bayer and Brandt providing…

Combinatorics · Mathematics 2023-08-01 So Yamagata

For each permutation $w$, we can construct a collection of hyperplanes $\mathcal{A}_w$ according to the inversions of $w$, which is called the inversion hyperplane arrangement associated to $w$. It was conjectured by Postnikov and confirmed…

Combinatorics · Mathematics 2020-06-16 Neil J. Y. Fan

To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…

Combinatorics · Mathematics 2015-06-23 Priyavrat Deshpande

In 1993, Csima and Sawyer proved that in a non-pencil arrangement of n pseudolines, there are at least $\frac{6}{13}n$ simple points of intersection. Since pseudoline arrangements are the topological representations of reorientation classes…

Combinatorics · Mathematics 2021-02-01 Lamar Chidiac , Winfried Hochstättler

In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…

Combinatorics · Mathematics 2010-11-05 Drew Armstrong , Patricia Hersh

A classical theorem of De Bruijn and Erd\H{o}s asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theorem holds for graphs. Restricting our attention to…

Combinatorics · Mathematics 2015-01-29 Pierre Aboulker , Guillaume Lagarde , David Malec , Abhishek Methuku , Casey Tompkins

Let $W$ be a finite reflection group. For a given $w \in W$, the following assertion may or may not be satisfied: (*) The principal Bruhat order ideal of $w$ contains as many elements as there are regions in the inversion hyperplane…

Combinatorics · Mathematics 2010-10-05 Axel Hultman

We prove the conjecture of A. Postnikov that (A) the number of regions in the inversion hyperplane arrangement associated with a permutation $w\in \Sn$ is at most the number of elements below $w$ in the Bruhat order, and (B) that equality…

Combinatorics · Mathematics 2007-10-08 Axel Hultman , Svante Linusson , John Shareshian , Jonas Sjöstrand

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron…

Combinatorics · Mathematics 2010-03-29 Cristian Lenart , Frank Sottile

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

Given a set S of n \geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree…

Computational Geometry · Computer Science 2011-06-03 Luc Devroye , James King