Related papers: An algorithm for Berenstein-Kazhdan decoration fun…

For a finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION (resp. ${\cal F}$-TM-DELETION) problem consists in, given a graph $G$ and an integer $k$, decide whether there exists $S \subseteq V(G)$ with $|S| \leq k$ such that $G…

We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a scenario we expect is common when working with real-world…

The Kashiwara crystal $B(\infty)$ parametrizes a basis for the Verma module of a Kac-Moody algebra. It has a deep combinatorial structure which one seeks to understand. For each sequence $J$ of reduced decompositions of elements of the Weyl…

We often encounter probability distributions given as unnormalized products of non-negative functions. The factorization structures are represented by hypergraphs called factor graphs. Such distributions appear in various fields, including…

We show that there exists a suitable sequence $\{w^{(k)}\}_{k \ge 0}$ of Weyl group elements for the perfect crystal $B = B^{1,3l}$ such that the path realizations of the Demazure crystals $B_{w^{(k)}}(l\Lambda_2)$ for the quantum affine…

Let $\pi:G\to U(\mathcal H)$ be a unitary representation of a locally compact group. The braiding operator $F:\mathcal H\otimes\mathcal H\to \mathcal H\otimes\mathcal H$, which flips the components of the Hilbert tensor product $F(v\otimes…

Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is useful not only to find one solution but also to enumerate all the solutions with good values of objectives. However,…

We present both simulated and partial empirical evidence for the computational utility of many connected vesicle analogs of an encapsulated non-linear chemical processing medium. By connecting small vesicles containing a solution of…

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Many important problems in extremal combinatorics can be stated as certifying polynomial inequalities in graph homomorphism numbers, and in particular, many ask to certify pure binomial inequalities. For a fixed collection of graphs…

In [Frieden, arXiv:1706.02844], we constructed a geometric crystal on the variety $\mathbb{X}_{k} := {\rm Gr}(k,n) \times \mathbb{C}^\times$ which tropicalizes to the affine crystal structure on rectangular tableaux with $n-k$ rows. In this…

We initiate a programme to compute curvature corrections to the nonabelian BI action. This is based on the calculation of derivative corrections to the abelian BI action, describing a maximal brane, to all orders in F. An exact calculation…

Given a digraph $G = (V_G, A_G)$, a \emph{branching} in $G$ is a set of arcs $B \subseteq A_G$ such that the underlying undirected graph spanned by $B$ is acyclic and each node in $G$ is entered (\emph{covered}) by at most one arc from $B$.…

We provide an explicit combinatorial description of the embedding of the crystal of Kashiwara-Nakashima tableaux in types $B$ and $C$ into that of $\bi$-Lusztig data associated to a family of reduced expressions $\bi$ of the longest element…

We conjecture an explicit formula for the image of a tensor product of Kirillov-Reshetikhin crystals $\bigotimes_{i=1}^m B^{1, s_i}$ under the Kirillov-Schilling-Shimozono bijection. Our conjectured formula is piecewise-linear, where the…

The problems of computing graph colorings and clique covers are central challenges in combinatorial optimization. Both of these are known to be NP-hard, and thus computationally intractable in the worst-case instance. A prominent approach…

Employing the QCD factorization formalism we compute $B_{u}^{-} \to \gamma^{\ast} \, \ell \, \bar \nu_{\ell}$ form factors with an off-shell photon state possessing the virtuality of order $m_b \, \Lambda_{\rm QCD}$ and $m_b^2$,…

In this paper, we establish a new zeta function based on the Bartholdi zeta function for an undirected graph G called the reduced Bartholdi zeta function. We study the relation between its coefficients and the structure of the graph, and…

For a graph $G=(V,E)$, $k\in \mathbb{N}$, and a complex number $w$ the partition function of the univariate Potts model is defined as \[ {\bf Z}(G;k,w):=\sum_{\phi:V\to [k]}\prod_{\substack{uv\in E \\ \phi(u)=\phi(v)}}w, \] where…

To any element of a connected, simply connected, semisimple complex algebraic group G and a choice of an element of the corresponding Weyl group there is an associated Lusztig variety. When the element of G is regular semisimple, the…