English
Related papers

Related papers: From Bruhat intervals to intersection lattices and…

200 papers

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

Originating in the work of A.M. Semikhatov and D. Adamovi\'c, inverse reductions are embeddings involving W-algebras corresponding to the same Lie algebra but different nilpotent orbits. Here, we show that an inverse reduction embedding…

Quantum Algebra · Mathematics 2023-06-27 Zachary Fehily

The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…

Combinatorics · Mathematics 2022-02-17 Francesco Brenti , Angela Carnevale , Bridget Eileen Tenner

In a recent paper, Backelin, West and Xin describe a map $\phi ^*$ that recursively replaces all occurrences of the pattern $k... 21$ in a permutation $\sigma$ by occurrences of the pattern $(k-1)... 21 k$. The resulting permutation…

Combinatorics · Mathematics 2008-05-05 Mireille Bousquet-Melou , Einar Steingrimsson

This paper has two objectives. First, we study lattices with skew-Hermitian forms over division algebras with positive involutions. For division algebras of Albert types I and II, we show that such a lattice contains an "orthogonal" basis…

Number Theory · Mathematics 2023-07-20 Christopher Daw , Martin Orr

A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…

Combinatorics · Mathematics 2016-09-07 Christos A. Athanasiadis

We give a lower bound for the value at q=1 of a Kazhdan-Lustig polynomial in a Weyl group W in terms of "patterns''. This is expressed by a "pattern map" from W to W' for any parabloic subgroup W'. This notion generalizes the concept of…

Representation Theory · Mathematics 2007-05-23 Sara Billey , Tom Braden

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

Dynamical Systems · Mathematics 2018-06-20 Jarkko Kari , Etienne Moutot

For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…

Combinatorics · Mathematics 2024-07-09 Jens Niklas Eberhardt , Carl Mautner

Given a finite word $w$, Guibas and Odlyzko (J. Combin. Theory Ser. A, 30, 1981, 183-208) showed that the autocorrelation polynomial $\phi_w(t)$ of $w$, which records the set of self-overlaps of $w$, explicitly determines for each $n$, the…

Dynamical Systems · Mathematics 2025-11-04 Nishant Chandgotia , Brian Marcus , Jacob Richey , Chengyu Wu

White's conjecture asserts that any two tuples of matroid bases that have the same multi-set union can be transformed from one to another by symmetric exchanges; it also implies that the toric ideals of matroids are generated by the…

Combinatorics · Mathematics 2025-10-07 Yu-Chuan Yu , Chi Ho Yuen

The weak Bruhat order on $ { \mathcal S }_n $ is the partial order $\prec$ so that $\sigma \prec \tau$ whenever the set of inversions of $\sigma$ is a subset of the set of inversions of $\tau$. We investigate the time complexity of…

Combinatorics · Mathematics 2015-07-03 Joshua Cooper , Anna Kirkpatrick

The classical Bertini theorem on generic intersection of an algebraic set with hyperplanes states the following: \emph{Let X be a nonsingular closed subvariety of $\mathbb{P}^n_k$, where $k$ is an algebraically closed field. Then there…

Algebraic Geometry · Mathematics 2021-06-22 Tomasz Rodak , Adam Różycki , Stanisław Spodzieja

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

Combinatorics · Mathematics 2026-03-13 Haiyang Liu , Bo Ning

In this paper, we give a formula for the number of permutations that avoid the split patterns $3|12$ and $23|1$ with respect to a position $r$. Such permutations count the number of Schubert varieties for which the projection map from the…

Combinatorics · Mathematics 2024-02-28 Travis Grigsby , Edward Richmond

In this paper we give an affirmative answer to a conjecture proposed by Danny Neftin, that is, if the commutator of two permutations has at least n-4 fixed points where two permutations are in degree n symmetric group, then there exists a…

Group Theory · Mathematics 2021-06-17 Junyao Pan

We study inequalities between graded Betti numbers of ideals in a standard graded algebra over a field and their images under embedding maps, defined earlier by us in [Math. Z. 274, (2013), no. 3-4, pp. 809-819; arXiv:1009.4488]. We show…

Commutative Algebra · Mathematics 2014-04-18 Giulio Caviglia , Manoj Kummini

Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…

Combinatorics · Mathematics 2008-08-05 Suhkjin Hur

The frame set conjecture for B-splines $B_n$, $n \ge 2$, states that the frame set is the maximal set that avoids the known obstructions. We show that any hyperbola of the form $ab=r$, where $r$ is a rational number smaller than one and $a$…

Functional Analysis · Mathematics 2015-08-20 Jakob Lemvig , Kamilla Haahr Nielsen

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…

Combinatorics · Mathematics 2007-05-23 Claus Mokler