English
Related papers

Related papers: Bumpless Pipedreams, Reduced Word Tableaux and Sta…

200 papers

The Busemann function has recently found much interest in a variety of geometric machine learning problems, as it naturally defines projections onto geodesic rays of Riemannian manifolds and generalizes the notion of hyperplanes. As several…

Machine Learning · Computer Science 2026-03-13 Clément Bonet , Elsa Cazelles , Lucas Drumetz , Nicolas Courty

Recently Eisenstein and collaborators introduced a method to `reconstruct' the linear power spectrum from a non-linearly evolved galaxy distribution in order to improve precision in measurements of baryon acoustic oscillations. We…

Astrophysics · Physics 2009-11-06 Nikhil Padmanabhan , Martin White , J. D. Cohn

We present computational results on principal specializations $\mathfrak{S}_w(1^n)$ of Schubert polynomials, which count reduced pipe dreams and reduced bumpless pipe dreams (RBPD). We find the first counterexample, at $n=17$, to the…

Combinatorics · Mathematics 2026-03-23 David Anderson , Greta Panova , Leonid Petrov

We present an extension of the quasiparticle self-consistent $GW$ approximation (QS$GW$) [Phys. Rev. B, 76 165106 (2007)] to include vertex corrections in the screened Coulomb interaction $W$. This is achieved by solving the Bethe-Salpeter…

Materials Science · Physics 2023-10-11 Brian Cunningham , Myrta Grüning , Dimitar Pashov , Mark van Schilfgaarde

We first rephrase and unify known bijections between bipartite plane maps and labelled trees with the formalism of looptrees, which we argue to be both more relevant and technically simpler since the geometry of a looptree is explicitly…

Probability · Mathematics 2022-02-18 Cyril Marzouk

A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…

Combinatorics · Mathematics 2021-09-15 Shishuo Fu , Zhicong Lin , Yaling Wang

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

Cohen-Addad, Le, Pilipczuk, and Pilipczuk [CLPP23] recently constructed a stochastic embedding with expected $1+\varepsilon$ distortion of $n$-vertex planar graphs (with polynomial aspect ratio) into graphs of treewidth…

Data Structures and Algorithms · Computer Science 2024-11-04 Hsien-Chih Chang , Vincent Cohen-Addad , Jonathan Conroy , Hung Le , Marcin Pilipczuk , Michał Pilipczuk

Many geometric and analytic properties of sets hinge on the properties of harmonic measure, notoriously missing for sets of higher co-dimension. The aim of this manuscript is to develop a version of elliptic theory, associated to a linear…

Analysis of PDEs · Mathematics 2023-09-26 Guy R. David , Joseph Feneuil , Svitlana Mayboroda

We consider an isotropic spin-degenerate interacting uniform $D$-dimensional electron gas (DDEG) with $D > 1$ within the Luttinger-Ward (LW) formalism. We derive the asymptotically exact semiclassical/infrared limit of the LW functional at…

Strongly Correlated Electrons · Physics 2024-02-27 D. Miserev , J. Klinovaja , D. Loss

Whether there exists a massive electroweak (EW) theory, without a Higgs spontaneous symmetry breaking mechanism, that is gauge invariant and renormalizable is investigated. A Stueckelberg formalism for massive $W$ and $Z$ bosons is used to…

High Energy Physics - Phenomenology · Physics 2011-10-19 J. W. Moffat

We give bijective proofs of Monk's rule for Schubert and double Schubert polynomials computed with bumpless pipe dreams. In particular, they specialize to bijective proofs of transition and cotransition formulas of Schubert and double…

Combinatorics · Mathematics 2020-10-29 Daoji Huang

We show an algorithm that, given an $n$-vertex graph $G$ and a parameter $k$, in time $2^{O(k \log k)} n^{O(1)}$ finds a tree decomposition of $G$ with the following properties: * every adhesion of the tree decomposition is of size at most…

Data Structures and Algorithms · Computer Science 2020-09-29 Marek Cygan , Paweł Komosa , Daniel Lokshtanov , Michał Pilipczuk , Marcin Pilipczuk , Saket Saurabh , Magnus Wahlström

This article studies some new insertion algorithms that associate pairs of shifted tableaux to finite integer sequences in which certain terms may be primed. When primes are ignored in the input word these algorithms reduce to known…

Combinatorics · Mathematics 2024-02-01 Eric Marberg

This paper establishes connections between EW-tableaux and parallelogram polyominoes by using recent research regarding the sandpile model on the complete bipartite graph. This paper presents and proves a direct bijection between…

Combinatorics · Mathematics 2020-08-03 Amal Alofi , Mark Dukes

The classical permutohedron Perm is the convex hull of the points (w(1),...,w(n)) in R^n where w ranges over all permutations in the symmetric group. This polytope has many beautiful properties -- for example it provides a way to visualize…

Combinatorics · Mathematics 2015-01-06 Lauren K. Williams

The main goal of this paper is to extend two fundamental combinatorial results in Schubert calculus on flag manifolds from equivariant cohomology and $K$-theory to equivariant elliptic cohomology. The foundations of elliptic Schubert…

Combinatorics · Mathematics 2025-10-07 Cristian Lenart , Rui Xiong , Changlong Zhong

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

Combinatorics · Mathematics 2017-04-12 Nikolaos Apostolakis , Kerry Ojakian

Energy minimizing maps (E.M.M.s) play a central role in the calculus of variations, partial differential equations (PDEs), and geometric analysis. These maps are often embedded into $C^\infty$ Riemannian manifolds to minimize the Dirichlet…

Analysis of PDEs · Mathematics 2024-05-17 Owen Drummond

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

Combinatorics · Mathematics 2023-03-17 Philippe Nadeau , Vasu Tewari