Related papers: Interlacing networks: birational RSK, the octahedr…
In this paper we generalize single-relation pseudo-Riemannian graph embedding models to multi-relational networks, and show that the typical approach of encoding relations as manifold transformations translates from the Riemannian to the…
Bitangential interpolation problems in the class of matrix valued functions in the generalized Schur class are considered in both the open unit disc and the open right half plane, including problems in which the solutions is not assumed to…
Recurrent neural networks are powerful models for sequential data, able to represent complex dependencies in the sequence that simpler models such as hidden Markov models cannot handle. Yet they are notoriously hard to train. Here we…
We study the fields of endomorphisms intertwining pairs of symplectic structures. Using these endomorphisms we prove an analogue of Moser's theorem for simultaneous isotopies of two families of symplectic forms. We also consider the…
In complex networks, interactions between multiple agents give rise to an array of intricate global dynamics, ranging from synchronization to cluster formations. Decoding the connectivity structure as well as the types of interactions from…
A reciprocal linear space is the image of a linear space under coordinate-wise inversion. These fundamental varieties describe the analytic centers of hyperplane arrangements and appear as part of the defining equations of the central path…
The main classical result of Schubert calculus is that multiplication rules for the basis of Schubert cycles inside the cohomology ring of the Grassmannian $G(n,m)$ are the same as multiplication rules for the basis of Schur polynomials in…
We introduce and develop the theory of spectral networks in real contact and symplectic topology. First, we establish the existence and pseudoholomorphic characterization of spectral networks for Lagrangian fillings in the cotangent bundle…
Entrainment of randomly coupled oscillator networks by periodic external forcing applied to a subset of elements is numerically and analytically investigated. For a large class of interaction functions, we find that the entrainment window…
It has been widely assumed that a neural network cannot be recovered from its outputs, as the network depends on its parameters in a highly nonlinear way. Here, we prove that in fact it is often possible to identify the architecture,…
We prove a determinantal identity concerning Schur functions for 2-staircase diagrams lambda=(ln+l',ln,l(n-1)+l',l(n-1),...,l+l',l,l',0). When l=1 and l'=0 these functions are related to the partition function of the 6-vertex model at the…
Introduced by Okounkov and Reshetikhin, the Schur process is known to be a determinantal point process, meaning that its correlation functions are minors of a single correlation kernel matrix. Previously, this was derived using…
This paper is an introduction to polarizations in the symplectic and orthogonal settings. They arise in association to a triple of compatible structures on a real vector space, consisting of an inner product, a symplectic form, and a…
Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schr\"oder paths (resp. little Schr\"oder paths) of length $2n$ with $k$ hills, and set $r(0,0)=s(0,0)=1$. We bijectively establish the following recurrence relations: \begin{align*}…
Residual connections have been proposed as an architecture-based inductive bias to mitigate the problem of exploding and vanishing gradients and increased task performance in both feed-forward and recurrent networks (RNNs) when trained with…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
Every Grassmannian, in its Pl\"ucker embedding, is defined by quadratic polynomials. We prove a vast, qualitative, generalisation of this fact to what we call Pl\"ucker varieties. A Pl\"ucker variety is in fact a family of varieties in…
A rooted phylogenetic network is a directed acyclic graph with a single root, whose sinks correspond to a set of species. As such networks are useful for representing the evolution of species that have undergone reticulate evolution, there…
The Internet is a complex network of interconnected routers and the existence of collective behavior such as congestion suggests that the correlations between different connections play a crucial role. It is thus critical to measure and…
The affine Grassmannian of $SL_n$ admits an embedding into the Sato Grassmannian, which further admits a Pl\"ucker embedding into the projectivization of Fermion Fock space. Kreiman, Lakshmibai, Magyar, and Weyman describe the linear part…