Related papers: A formula for Pl\"ucker coordinates associated wit…
We present a PTAS for computing the maximum a posteriori assignment on Pairwise Markov Random Fields with non-negative weights in planar graphs. This algorithm is practical and not far behind state-of-the-art techniques in image processing.…
The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.
We study a simple geometric model for local transformations of bipartite graphs. The state consists of a choice of a vector at each white vertex made in such a way that the vectors neighboring each black vertex satisfy a linear relation.…
Every Grassmannian, in its Pl\"ucker embedding, is defined by quadratic polynomials. We prove a vast, qualitative, generalisation of this fact to what we call Pl\"ucker varieties. A Pl\"ucker variety is in fact a family of varieties in…
Symmetry and antisymmetry are fundamental concepts in many strict sciences. Pairwise comparisons (PC) matrices are fundamental tools for representing pairwise relations in decision making. In this theoretical study, we present a novel…
A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $\mu$ defined on $V.$ Hence it can be regarded…
For an arbitrary field of any characteristic we give an explicit description, in terms of Pl\"ucker coordinates, of the projective linear space that cuts out the Lagrangian-Grassmannian variety $L(n,2n)$ of maximal isotropic subspaces in a…
We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface is allowed to assume a general mixture of boundary…
The first problem we investigate is the following: given $k\in \mathbb{R}_{\ge 0}$ and a vector $v$ of Pl\"ucker coordinates of a point in the real Grassmannian, is the vector obtained by taking the $k$th power of each entry of $v$ again a…
In this paper we introduce a diagrammatic equation for the planar sector of square non hermitian random matrix models strongly reminiscent of Polchinski's equation in quantum field theory. Our fundamental equation is first obtained by a…
In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…
We obtain defining equations of the smooth equivariant compactification of the Grassmannian of the complex associative $3$-planes in $\C^7$, which is the parametrizing variety of all quaternionic subalgebras of the algebra of complex…
Given an undirected graph with edge costs and node weights, the minimum bisection problem asks for a partition of the nodes into two parts of equal weight such that the sum of edge costs between the parts is minimized. We give a polynomial…
We study determining the posture of an in-parallel planar manipulator, which has three connectors composed of revolute, prismatic and revolute joints, from specified active joint variables. We construct an ideal in the field of complex…
Projective embedding of an isotropic Grassmannian (or pure spinors) OGr^+(5,10) into projective space of spinor representation S can be characterized with a help of Gamma-matrices by equations Gamma_{alpha…
We consider a disjoint cover (partition) of an undirected weighted finite graph $G$ by $|J|$ connected subgraphs (clusters) $\{S_{j}\}_{j\in J}$ and select a function $\zeta_{j}\geq 0$ on each of the clusters. For a given signal $f$ on $G$…
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 distance characteristic polynomial of a threshold graph from its binary sequence. As application, we…
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…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
This work is motivated by the relation between the KP and BKP integrable hierarchies, whose $\tau$-functions may be viewed as sections of dual determinantal and Pfaffian line bundles over infinite dimensional Grassmannians. In finite…