Related papers: Representations of torsion-free arithmetic matroid…
The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…
We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…
We use algebraic geometry to study the anomaly-free representations of an arbitrary gauge Lie algebra for 4-dimensional spacetime fermions. For irreducible representations, the problem reduces to studying the Lie algebras $\mathfrak{su}_n$…
Let M be a matroid representable over a (partial) field P and B a matrix representable over a sub-partial field P' of P. We say that B confines M to P' if, whenever a P-representation matrix A of M has a submatrix B, A is a scaled…
In this paper we provide a comparison result between the solutions to the torsion problem for the Hermite operator with Robin boundary conditions and the one of a suitable symmetrized problem.
The Resolution Theorem for Compact Abelian Groups is applied to show that the profinite subgroups of a finite-dimensional compact connected abelian group (protorus) which induce tori quotients comprise a lattice under intersection (meet)…
We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…
In this article, we investigate the multi-parametric matroid problem. The weights of the elements of the matroid's ground set depend linearly on an arbitrary but fixed number of parameters, each of which is taken from a real interval. The…
A new approach is established to computing the image of a rational map, whereby the use of approximation complexes is complemented with a detailed analysis of the torsion of the symmetric algebra in certain degrees. In the case the map is…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
We present a novel method for approximately equilibrating a matrix $A \in {\bf R}^{m \times n}$ using only multiplication by $A$ and $A^T$. Our method is based on convex optimization and projected stochastic gradient descent, using an…
A classic problem in matroid theory is to find subspace arrangements, specifically hyperplane and pseudosphere arrangements, whose intersection posets are isomorphic to a prescribed geometric lattice. Engstr\"om recently showed how to…
In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich combinatorial description. Her constructions rely heavily on some triangularity property of the product, but do not use explicitly that the 0-Hecke…
Most algorithms for computing persistent homology do so by tracking cycles that represent homology classes. There are many choices of such cycles, and specific choices have found different uses in applications. Although it is known that…
In this paper we prove that there exists an asymptotical diagonalization algorithm for a class of sparse Hermitian (or real symmetric) matrices if and only if the matrices become Hessenberg matrices after some permutation of rows and…
We show that partition functions of various matrix models can be obtained by acting on elementary functions with exponents of W-operators. A number of illustrations is given, including the Gaussian Hermitian matrix model, Hermitian model in…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
Given an orientable surface with boundary and a free homotopy class, we present a purely combinatorial algorithm which produces a representative of that homotopy class with minimal self intersection.
We use multiplication maps to give a characteristic-free approach to vanishing theorems on toric varieties. Our approach is very elementary but is enough powerful to prove vanishing theorems.
This paper is addressed to the well-posedness of some linear and semilinear backward stochastic differential equations with general filtration, without using the Martingale Representation Theorem. The point of our approach is to introduce a…