Related papers: A formula for Pl\"ucker coordinates associated wit…
We investigate the plabic graphs corresponding to the quadrilateral Postnikov arrangements used by J.Scott to equip the homogeneous coordinate rings of Grassmannians with a cluster structure. More precisely we describe their orbits under…
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
We define a super analog of the classical Pl\"{u}cker embedding of the Grassmannian into a projective space. One of the difficulties of the problem is rooted in the fact that super exterior powers $\Lambda^{r|s}(V)$ are not a simple…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the characteristic polynomial of a threshold graph from its binary sequence. Applications include…
We determine the number of complex solutions to a nonlinear eigenvalue problem on the Grassmannian in its Pl\"ucker embedding. This is motivated by quantum chemistry, where it represents the truncation to single electrons in coupled cluster…
We present an explicit solution of the $A_r$ $T$-system for arbitrary boundary conditions. For each boundary, this is done by constructing a network, i.e. a graph with positively weighted edges, and the solution is expressed as the…
The positive Grassmannian $Gr_{k,n}^{\geq 0}$ is the subset of the real Grassmannian where all Pl\"ucker coordinates are nonnegative. It has a beautiful combinatorial structure as well as connections to statistical physics, integrable…
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid cells of the totally nonnegative Grassmannian $\text{Gr}^{\geq 0}(n,k)$. Any two plabic graphs for the same…
A quasi-exponential is an entire function of the form $e^{cu}p(u)$, where $p(u)$ is a polynomial and $c \in \mathbb{C}$. Let $V = \langle e^{h_1u}p_1(u), \dots, e^{h_Nu}p_N(u) \rangle$ be a vector space with a basis of quasi-exponentials.…
Polynomial solutions to the KP hierarchy are known to be parametrized by a cone over an infinite-dimensional Grassmann variety. Using the notion of Schubert derivation on a Grassmann algebra, we encode the classical Pl\"ucker equations of…
We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…
Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…
We study open-closed discrete mappings that satisfy the weighted estimate of the distortion of modulus of families of paths. It is proved that the mappings mentioned above have a continuous extension into the isolated point of the boundary,…
For a graph $G$, its $k$-th power $G^k$ is constructed by placing an edge between two vertices if they are within distance $k$ of each other. The $k$-independence number $\alpha_k(G)$ is defined as the independence number of $G^k$. By using…
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…
In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…