Related papers: Network Parameterizations for the Grassmannian
Postnikov gave a parametrization for the totally non-negative Grassmannian using the matroid decomposition and associating a network with \reflectbox{L}-diagrams. Talaska and Williams extend this result to the entire Grassmannian by using…
Given a point A in the real Grassmannian, it is well-known that one can construct a soliton solution u_A(x,y,t) to the KP equation. The contour plot of such a solution provides a tropical approximation to the solution when the variables x,…
A parametrization of a positroid variety $\Pi$ of dimension $d$ is a regular map $(\mathbb{C}^{\times})^{d} \rightarrow \Pi$ which is birational onto a dense subset of $\Pi$. There are several remarkable combinatorial constructions which…
The Deodhar decomposition of the Grassmannian is a refinement of the Schubert, Richardson, and positroid stratifications of the Grassmannian. Go-diagrams are certain fillings of Ferrers diagrams with black stones, white stones, and pluses…
Let $X\subseteq G\slash B$ be a Schubert variety in a flag manifold and let $\pi: \tilde X \rightarrow X$ be a Bott-Samelson resolution of $X$. In this paper we prove an effective version of the decomposition theorem for the derived…
For a planar directed graph G, Postnikov's boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit formula for Postnikov's map by…
For the flag variety G/B of a reductive algebraic group G we define a certain (set-theoretical) cross-section phi from G/B to G, which depends on a choice of reduced expression for the longest element in the Weyl group. This cross-section…
Network decomposition is a central concept in the study of distributed graph algorithms. We present the first polylogarithmic-round deterministic distributed algorithm with small messages that constructs a strong-diameter network…
We study a category of Whittaker modules over a complex semisimple Lie algebra by realizing it as a category of twisted D-modules on the associated flag variety using Beilinson-Bernstein localization. The main result of this paper is the…
We compute the Hochschild-Kostant-Rosenberg decomposition of the Hochschild cohomology of generalised Grassmannians, i.e. partial flag varieties associated to maximal parabolic subgroups in a simple algebraic group. We explain how the…
Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…
Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and Plotkin [FOCS'89], are one of the key algorithmic tools in distributed graph algorithms. We present an improved deterministic distributed algorithm for constructing…
By interpreting the product of the Principal Component Analysis, that is the covariance matrix, as a sequence of nested subspaces naturally coming with weights according to the level of approximation they provide, we are able to embed all…
This paper presents significantly improved deterministic algorithms for some of the key problems in the area of distributed graph algorithms, including network decomposition, hitting sets, and spanners. As the main ingredient in these…
The stratification of the Grassmannian by positroid varieties has been the subject of extensive research. Positroid varieties are in bijection with a number of combinatorial objects, including $k$-Bruhat intervals and bounded affine…
The characters of Kazhdan--Lusztig elements of the Hecke algebra over $S_n$ (and in particular, the chromatic symmetric function of indifference graphs) are completely encoded in the (intersection) cohomology of certain subvarieties of the…
Many problems are known to be solvable in subexponential parameterized time when the input graph is planar. The bidimensionality framework of Demaine, Fomin, Hajiaghay, and Thilikos [JACM'05] and the treewidth-pattern-covering approach by…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
Let $G$ be a split semisimple linear algebraic group over a field and let $X$ be a generic twisted flag variety of $G$. Extending the Hilbert basis techniques to Laurent polynomials over integers we give an explicit presentation of the…
The syndrome decoding problem has been proposed as a computational hardness assumption for code based cryptosystem that are safe against quantum computing. The problem has been reduced to finding the codeword with the smallest non-zero…