English
Related papers

Related papers: Counting weighted maximal chains in the circular B…

200 papers

A {\em $(d,h)$-decomposition} of a graph $G$ is an order pair $(D,H)$ such that $H$ is a subgraph of $G$ where $H$ has the maximum degree at most $h$ and $D$ is an acyclic orientation of $G-E(H)$ of maximum out-degree at most $d$. A graph…

Combinatorics · Mathematics 2022-04-19 Lin Niu , Xiangwen Li

The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…

Classical Analysis and ODEs · Mathematics 2021-10-15 Nicolau C. Saldanha , Boris Shapiro , Michael Shapiro

Let $R_{n}$ denote the graph with vertex set consisting of the squares of an $n \times n$ grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as…

Combinatorics · Mathematics 2015-07-24 Joshua E. Ducey , Jonathan Gerhard , Noah Watson

The ABCT variety $V(3,n)$ is the image closure of the rational Veronese map from the Grassmannian $\operatorname{Gr}(2,n)$ to the Grassmannian $\operatorname{Gr}(3,n)$. It was studied by Arkani-Hamed--Bourjaily--Cachazo--Trnka in the…

Combinatorics · Mathematics 2026-03-11 Dawei Shen , Emanuele Ventura

The Grassmannian cluster algebra $\mathbb{C}[\text{Gr}(k, n)]$ admits a distinguished basis known as the dual canonical basis, whose elements correspond to rectangular semi-standard Young tableaux with $k$ rows and with entries in $[n]$. We…

Combinatorics · Mathematics 2025-08-21 Jian-Rong Li , Ayush Kumar Tewari

We give a proof of a result of D. Peterson's identifying the quantum cohomology ring of a Grassmannian with the reduced coordinate ring of a certain subvariety of $GL_n$. The totally positive part of this subvariety is then constructed and…

Quantum Algebra · Mathematics 2007-05-23 Konstanze Rietsch

We find the (unique) largest subset of $\{0, 1, 2\}^n$ such that it contains no two elements, one of which is coordinatewise greater than the other, but strictly greater on at most $k$ coordinates. To do so, we decompose the cube into…

Combinatorics · Mathematics 2025-10-01 Yaël Dillies , Matthew Johnson , Aleksandra Kowalska

In this paper we want to introduce two commutative diagrams for weight $n$=2 and $n$=3 with six faces on each. These diagrams describe the relations between Grassmannian complex in geometric configurations, Bloch-Suslin's complex for weight…

Number Theory · Mathematics 2012-05-08 Raziuddin Siddiqui

Quantum Bruhat graph is a weighted directed graph on a finite Weyl group first defined by Brenti-Fomin-Postnikov. It encodes quantum Monk's rule and can be utilized to study the $3$-point Gromov-Witten invariants of the flag variety. In…

Combinatorics · Mathematics 2023-09-12 Jiyang Gao , Shiliang Gao , Yibo Gao

Structure constants for the multiplication of Schubert polynomials by Schur symmetric polynomials are known to be related to the enumeration of chains in a new partial order on S_\infty, which we call the universal k-Bruhat order. Here we…

Combinatorics · Mathematics 2016-11-08 Nantel Bergeron , Frank Sottile

We present a version of the Matsuki correspondence for the affine Grassmannian $Gr=G(C((t)))/G(C[[t]])$ of a connected reductive complex algebraic group $G$. The main statement is an anti-isomorphism between the orbit posets of two…

Algebraic Geometry · Mathematics 2009-09-29 David Nadler

The Grassmannian space $\Gr$ is the set of all $k-$dimensional subspaces of the vector space~\smash{$\F_q^n$}. Recently, codes in the Grassmannian have found an application in network coding. The main goal of this paper is to present…

Information Theory · Computer Science 2010-08-31 Natalia Silberstein , Tuvi Etzion

We find a set of necessary and sufficient conditions under which the weight $w:E\to\mathbb R^+$ on the graph $G=(V,E)$ can be extended to a pseudometric $d:V\times V\to\mathbb R^+$. If these conditions hold and $G$ is a connected graph,…

Combinatorics · Mathematics 2011-06-01 Oleksiy Dovgoshey , Olli Martio , Matti Vuorinen

We discuss a surprising relationship between the partially ordered set of Newton points associated to an affine Schubert cell and the quantum cohomology of the complex flag variety. The main theorem provides a combinatorial formula for the…

Algebraic Geometry · Mathematics 2020-08-11 Elizabeth Milićević

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…

Combinatorics · Mathematics 2007-05-23 Glenn G. Chappell

Let G(d,n) denote the Grassmannian of d-planes in C^n and let T be the torus (C^*)^n/diag(C^*) which acts on G(d,n). Let x be a point of G(d,n) and let \bar{Tx} be the closure of the T-orbit through x. Then the class of the structure sheaf…

Algebraic Geometry · Mathematics 2007-05-23 David E Speyer

The set of possible spectra (\lambda,\mu,\nu) of zero-sum triples of Hermitian matrices forms a polyhedral cone. We give a complete determination of its facets, finishing a long story with recent highlights by [Helmke-Rosenthal, Klyachko,…

Combinatorics · Mathematics 2010-04-26 Allen Knutson , Terence Tao , Christopher Woodward

The degree of the Grassmannian with respect to the Pl\"ucker embedding is well-known. However, the Pl\"ucker embedding, while ubiquitous in pure mathematics, is almost never used in applied mathematics. In applied mathematics, the…

Algebraic Geometry · Mathematics 2025-07-29 Lek-Heng Lim , Ke Ye

The homogeneous coordinate ring of the Grassmannian Gr(k,n) has a cluster structure defined in terms of planar diagrams known as Postnikov diagrams. The cluster corresponding to such a diagram consists entirely of Pluecker coordinates. We…

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Jeanne Scott

Given a simple graph $G$, a weight function $w:E(G)\rightarrow \mathbb{N} \setminus \{0\}$, and an orientation $D$ of $G$, we define $\mu^-(D) = \max_{v \in V(G)} w_D^-(v)$, where $w^-_D(v) = \sum_{u\in N_D^{-}(v)}w(uv)$. We say that $D$ is…

Data Structures and Algorithms · Computer Science 2018-04-12 Júlio Araújo , Cláudia Linhares Sales , Ignasi Sau , Ana Silva