相关论文: Edge vectors on plabic networks in the disk and am…

B. Szegedy [Edge coloring models and reflection positivity, {\sl Journal of the American Mathematical Society} {\bf 20} (2007) 969--988] showed that the number of homomorphisms into a weighted graph is equal to the partition function of a…

In this paper we construct an explicit map from planar bicolored (plabic) trivalent graphs representing a given irreducible positroid cell $S$ in the totally non-negative Grassmannian $Gr^{\mbox{TNN}}(k,n)$ to the spectral data for the…

There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Pl\"ucker variables such that all other nonzero Pl\"ucker variables in the cell can be expressed…

We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…

The symmetric edge polytope (SEP) of a (finite, undirected) graph is a centrally symmetric lattice polytope whose vertices are defined by the edges of the graph. SEPs have been studied extensively in the past twenty years. Recently,…

If a graph $G$ can be represented by means of paths on a grid, such that each vertex of $G$ corresponds to one path on the grid and two vertices of $G$ are adjacent if and only if the corresponding paths share a grid edge, then this graph…

We associate real and regular algebraic--geometric data to each multi--line soliton solution of Kadomtsev-Petviashvili II (KP) equation. These solutions are known to be parametrized by points of the totally non--negative part of real…

This article addresses the Generalized Additive Decomposition (GAD) of symmetric tensors, that is, degree-$d$ forms $f \in \mathcal{S}_d$. From a geometric perspective, a GAD corresponds to representing a point on a secant of osculating…

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…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit…

Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…

Let $G$ be a connected $d$-regular graph of order $n$, where $d\geq3$. Let $\lambda_{2}(G)$ be the second largest eigenvalue of $G$. For even $n$, we show that $G$ contains $\left\lfloor\frac{2}{3}(d-\lambda_{2}(G))\right\rfloor$…

We introduce the totally nonnegative Lagrangian Grassmannian $\rm{LG}_{\geq 0}^R (n,2n)$, a new subset of the totally nonnegative Grassmannian consisting of subspaces isotropic with respect to a certain bilinear form $R$. We describe its…

We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph $G$, the plane-saturation number $\mathrm{sat}_{\mathcal{P}}(G)$ denotes the minimum number of edges in a plane…

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

The totally nonnegative Grassmannian is the set of k-dimensional subspaces V of R^n whose nonzero Pluecker coordinates all have the same sign. Gantmakher and Krein (1950) and Schoenberg and Whitney (1951) independently showed that V is…

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching with independent edge weights to geometric models.…

Simultaneous Geometric Embedding (SGE) asks whether, for a given collection of graphs on the same vertex set V, there is an embedding of V in the plane that admits a crossing-free drawing with straightline edges for each of the given…

Let $\Pi$ be a polar space of type $\textsf{D}_{n}$. Denote by ${\mathcal G}_{\delta}(\Pi)$, $\delta\in \{+,-\}$ the associated half-spin Grassmannians and write $\Gamma_{\delta}(\Pi)$ for the corresponding half-spin Grassmann graphs. In…