Related papers: Network Parameterizations for the Grassmannian
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest integer k for which G has a distinguishing k-labeling. In…
We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\mathbb{R}^d$. This task is known to have complexity $d^{\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components,…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
Many well-known NP-hard algorithmic problems on directed graphs resist efficient parametrisations with most known width measures for directed graphs, such as directed treewidth, DAG-width, Kelly-width and many others. While these focus on…
Effective and efficient tokenization plays an important role in image representation and generation. Conventional methods, constrained by uniform 2D/1D grid tokenization, are inflexible to represent regions with varying shapes and textures…
We construct a locally compact Hausdorff topology on the path space of a finitely aligned $k$-graph $\Lambda$. We identify the boundary-path space $\partial\Lambda$ as the spectrum of a commutative $C^*$-subalgebra $D_\Lambda$ of…
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…
We consider the task of image decomposition and we introduce a new model coined directional global three-part decomposition (DG3PD) for solving it. As key ingredients of the DG3PD model, we introduce a discrete multi-directional total…
We complete the program of Ref. [3,5] of connecting totally non-negative Grassmannians to the reality problem in KP finite-gap theory via the assignment of real regular divisors on rational degenerations of M-curves for the class of real…
PDDSparse is a new hybrid parallelisation scheme for solving large-scale elliptic boundary value problems on supercomputers, which can be described as a Feynman-Kac formula for domain decomposition. At its core lies a stochastic linear,…
In the Grothendieck cohomology of a flag variety G/H there are two canonical additive bases, namely, the Demazure basis and the Grothendieck basis We present explicit formulae that reduce the multiplication of these basis elements to the…
We consider discrete nets in Grassmannians $\mathbb{G}^d_r$ which generalize Q-nets (maps $\mathbb{Z}^N\to\mathbb{P}^d$ with planar elementary quadrilaterals) and Darboux nets ($\mathbb{P}^d$-valued maps defined on the edges of…
The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…
The Peterson comparison formula proved by Woodward relates the three-pointed Gromov-Witten invariants for the quantum cohomology of partial flag varieties to those for the complete flag. Another such comparison can be obtained by composing…
We give two contructions of sets of masks on cograssmannian permutations that can be used in Deodhar's formula for Kazhdan-Lusztig basis elements of the Iwahori-Hecke algebra. The constructions are respectively based on a formula of…
Let $G$ be an undirected bipartite graph with positive integer weights on the edges. We refine the existing decomposition theorem originally proposed by Kao et al., for computing maximum weight bipartite matching. We apply it to design an…
This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…
When network and graph theory are used in the study of complex systems, a typically finite set of nodes of the network under consideration is frequently either explicitly or implicitly considered representative of a much larger finite or…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We construct Schubert line defects in the 3d $\mathcal{N}=2$ supersymmetric gauged linear sigma model (GLSM) with target space a partial flag manifold $X={\rm Fl}({\boldsymbol{k}};n)$, generalizing our construction for complete flag…