Related papers: Matrix Theory for Minimal Trellises
Restricted Whitney numbers of the first kind appear in the combinatorial recursion for the matroid Kazhdan-Lusztig polynomials. In the special case of braid matroids (the matroid associated to the partition lattice, the complete graph, the…
The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…
Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
We consider a finite collection of line bundles $\Phi$ introduced by Bondal on a smooth, projective toric variety $X$. For any coherent sheaf $F$ on $X$, we construct minimal resolutions of $F$ by line bundles in $\Phi$, up to twist, with…
Gradient descent for matrix factorization exhibits an implicit bias toward approximately low-rank solutions. While existing theories often assume the boundedness of iterates, empirically the bias persists even with unbounded sequences. This…
Recently there has been considerable interest in the problem of finding a phylogenetic network with a minimum number of reticulation vertices which displays a given set of phylogenetic trees, that is, a network with minimum hybrid number.…
Derived braids have been used to classify categorical structures based on the braid underlying a braided monoidal category V. With four-strand braids underlying the composition morphisms of tensor products of categories enriched over V,…
This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods…
We present a manifestly rotational invariant formulation of the matrix product method valid for spin chains and ladders. We apply it to 2 legged spin ladders with spins 1/2, 1 and 3/2 and different magnetic structures labelled by the…
We construct two matrix models from twistor string theory: one by dimensional reduction onto a rational curve and another one by introducing noncommutative coordinates on the fibres of the supertwistor space P^(3|4)->CP^1. We comment on the…
We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…
The categorified theories known as "doctrines" specify a category equipped with extra structure, analogous to how ordinary theories specify a set with extra structure. We introduce a new framework for doctrines based on double category…
Following [14], we compute the motivic cohomology ring of the Nisnevich classifying space of the unitary group associated to the standard split hermitian form of a quadratic extension. This provides us with subtle characteristic classes…
We propose a new and interpretable class of high-dimensional tail dependence models based on latent linear factor structures. Specifically, extremal dependence of an observable vector is assumed to be driven by a lower-dimensional latent…
We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…
A classical result of Strassen asserts that given probabilities $\mu, \nu$ on the real line which are in convex order, there exists a \emph{martingale coupling} with these marginals, i.e.\ a random vector $(X_1,X_2)$ such that $X_1\sim \mu,…
Matrix pencils, or pairs of matrices, are used in a variety of applications. By the Kronecker decomposition Theorem, they admit a normal form. This normal form consists of four parts, one part based on the Jordan canonical form, one part…
This paper considers the problem of robustly estimating a structured covariance matrix with an elliptical underlying distribution with known mean. In applications where the covariance matrix naturally possesses a certain structure, taking…
The rigidity of a matrix $A$ for target rank $r$ is the minimum number of entries of $A$ that need to be changed in order to obtain a matrix of rank at most $r$. At MFCS'77, Valiant introduced matrix rigidity as a tool to prove circuit…