Related papers: Network Parameterizations for the Grassmannian
Geometric methods have useful application for solving problems in a range of quantum information disciplines, including the synthesis of time-optimal unitaries in quantum control. In particular, the use of Cartan decompositions to solve…
For any Lie algebra of classical type or type $G_2$ we define a $K$-theoretic analog of Dunkl's elements, the so-called truncated {\it Ruijsenaars-Schneider-Macdonald elements}, $RSM$-elements for short, in the corresponding {\it…
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming…
A stratified variety has a Kazhdan-Lusztig atlas if it can be locally modelled with Kazhdan-Lusztig varieties stratified by Schubert varieties in some Kac-Moody flag manifold via stratified isomorphisms. In this paper, we show that the…
Extended dynamic mode decomposition (EDMD) is a powerful tool to construct linear predictors of nonlinear dynamical systems by approximating the action of the Koopman operator on a subspace spanned by finitely many observable functions.…
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as…
We shown that, if you have two planes in the Segal-Wilson Grassmannian that have an intersection of finite codimension, then the corresponding solutions of the KP hierarchy are linked by B\"acklund-Darboux transformations (BDT). The…
We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann--Pl\"ucker functions. The equivalence is motivated by Cayley's identities expressing principal and almost-principal minors of a…
We study the coherent cohomology of generalized flag supervarieties. Our main observation is that these groups are closely related to the free resolutions of (certain generalizations of) determinantal ideals. In the case of super…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
We consider the model of complex hyperbranched polymer structures formed on the basis of scale-free graphs, where functionalities (degrees) $k$ of nodes obey a power law decaying probability $p(k)\sim{k^{-\alpha}}$. Such polymer topologies…
We present a combinatorial procedure (based on the W-graph of the Coxeter group) which shows that the characters of many intersection cohomology complexes on low rank complex flag varieties with coefficients in an arbitrary field are given…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
Graph Neural Networks (GNNs) have demonstrated remarkable effectiveness in recommendation systems. However, conventional graph-based recommenders, such as LightGCN, require maintaining embeddings of size $d$ for each node, resulting in a…
Functional brain dynamics is supported by parallel and overlapping functional network modes that are associated with specific neural circuits. Decomposing these network modes from fMRI data and finding their temporal characteristics is…
Recent results on the Grassmannian perspective of soliton equations with an elliptic spectral parameter are presented along with a detailed review of the classical case with a rational spectral parameter. The nonlinear Schr\"odinger…
In image set classification, a considerable progress has been made by representing original image sets on Grassmann manifolds. In order to extend the advantages of the Euclidean based dimensionality reduction methods to the Grassmann…
For the well-known Survivable Network Design Problem (SNDP) we are given an undirected graph $G$ with edge costs, a set $R$ of terminal vertices, and an integer demand $d_{s,t}$ for every terminal pair $s,t\in R$. The task is to compute a…
We construct a compactification of the space of circular planar electrical networks studied by Curtis-Ingerman-Morrow and De Verdiere-Gitler-Vertigan, using cactus networks. We embed this compactification as a linear slice of the totally…
We formulate a higher-rank version of the boundary measurement map for weighted planar bipartite networks in the disk. It sends a network to a linear combination of SL$_r$-webs, and is built upon the r-fold dimer model on the network. When…