Related papers: Parametrizing the Grassmannian using pipe dreams
Over the past decade, we witness an increasing amount of interest in the design of exact exponential-time and parameterized algorithms for problems in Graph Drawing. Unfortunately, we still lack knowledge of general methods to develop such…
Estimating the parameters of a probabilistic directed graphical model from incomplete data is a long-standing challenge. This is because, in the presence of latent variables, both the likelihood function and posterior distribution are…
A procedure to determine the initial ansatz for the co-frame and spin connection characterizing a Riemann-Cartan geometry respecting a given group of continuous symmetries is illustrated. Given a particular group of symmetries and assuming…
Variational regularization of ill-posed inverse problems is based on minimizing the sum of a data fidelity term and a regularization term. The balance between them is tuned using a positive regularization parameter, whose automatic choice…
We construct a bijection between marked bumpless pipedreams with reverse compatible pairs, which are in bijection with not-necessarily-reduced pipedreams. This directly unifies various formulas for Grothendieck polynomials in the…
Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of $\F_q^n$ with a given dimension. In this paper, we consider the problem of list decoding of a certain…
While deep learning has revolutionized the prediction of rigid protein structures, modelling the conformational ensembles of Intrinsically Disordered Proteins (IDPs) remains a key frontier. Current AI paradigms present a trade-off: Protein…
In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the…
In this paper we explore the geometric space parametrized by (tree level) Wilson loops in SYM $N=4$. We show that, this space can be seen as a vector bundle over a totally non-negative subspace of the Grassmannian, $\mathcal{W}_{k,cn}$.…
For a given discrete decomposable graphical model, we identify several alternative parametrizations, and construct the corresponding reference priors for suitable groupings of the parameters. Specifically, assuming that the cliques of the…
The success of graph neural networks (GNNs) provokes the question about explainability: ``Which fraction of the input graph is the most determinant of the prediction?'' Particularly, parametric explainers prevail in existing approaches…
We introduce a unified framework based on bi-level optimization schemes to deal with parameter learning in the context of image processing. The goal is to identify the optimal regularizer within a family depending on a parameter in a…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
Let $H$ be a complex Hilbert space. Consider the ortho-Grassmann graph $\Gamma^{\perp}_{k}(H)$ whose vertices are $k$-dimensional subspaces of $H$ (projections of rank $k$) and two subspaces are connected by an edge in this graph if they…
The geometric Langlands program is distinguished in assigning spectral decompositions to all representations, not only the irreducible ones. However, it is not even clear what is meant by a spectral decomposition when one works with…
The ring of symmetric functions can be implemented in the homology of \union_{a,b} Gr(a,a+b), the multiplicative structure being defined from the "direct sum" map. There is a natural circle action (simultaneously on all Grassmannians) under…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
Graphs with a simple spectrum admit cubic-time isomorphism testing, yet we prove that for every natural number $k$, the $k$-Weisfeiler-Leman ($k$-WL) test cannot distinguish all non-isomorphic graphs with a simple spectrum. As the WL…
The grey incomplete gamma distributions was established by one of the authors in a previous publication. In this article we use the Kondratiev characterization theorem to identify those via a suitable Laplace transform with holomorphic…
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…