相关论文: Weak Separation and Plabic Graphs

We initiate the study of a class of polytopes, which we coin polypositroids, defined to be those polytopes that are simultaneously generalized permutohedra (or polymatroids) and alcoved polytopes. Whereas positroids are the matroids arising…

Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red…

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. The forcing conjecture further strengthens this, claiming that any…

We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…

Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we…

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.…

Motivated by the study of greedy algorithms for graph coloring, we introduce a new graph parameter, which we call weak degeneracy. By definition, every $d$-degenerate graph is also weakly $d$-degenerate. On the other hand, if $G$ is weakly…

The Graph Minor Theorem of Robertson and Seymour asserts that any graph property, whatsoever, is determined by an associated finite list of graphs. We view this as an impressive generalization of Kuratowski's theorem, which characterizes…

Zamolodchikov periodicity is a property of certain discrete dynamical systems and was one of the primary motivations for the creation of cluster algebras. It was first observed by Zamolodchikov in his study of thermodynamic Bethe ansatz,…

Le-diagrams are combinatorial objects that parametrize cells of the totally nonnegative Grassmannian, called positroid cells, and each Le-diagram gives rise to a cluster algebra which is believed to be isomorphic to the coordinate ring of…

While the intersection of the Grassmannian Bruhat decompositions for all coordinate flags is an intractable mess, the intersection of only the {\em cyclic shifts} of one Bruhat decomposition turns out to have many of the good properties of…

By work of a number of authors, beginning with Scott and culminating with Galashin and Lam, the coordinate rings of positroid varieties in the Grassmannian carry cluster algebra structures. In fact, they typically carry many such…

We prove that an infinite family of semiprimitive groups are graph-restrictive. This adds to the evidence for the validity of the PSV Conjecture and increases the minimal imprimitive degree for which this conjecture is open to 12. Our…

We describe explicitly the admissible families of minors for the totally nonnegative cells of real matrices, that is, the families of minors that produce nonempty cells in the cell decompositions of spaces of totally nonnegative matrices…

A positroid is a matroid defined by Postnikov to study the cells in the non-negative part of the Grassmannian. They are in bijection with decorated permutations. We show a way to explain contraction and restriction of positroids in terms of…

The problem of characterizing maximal non-Hamiltonian graphs may be naturally extended to characterizing graphs that are maximal with respect to non-traceability and beyond that to $t$-path traceability. We show how traceability behaves…

We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the…

Weak unit disk contact graphs are graphs that admit representing nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corresponding nodes. In this work we focus on graphs without…

A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…