Related papers: A note on algebraic rank, matroids, and metrized c…
Following D. Ramakrishnan, we explain how L. Lafforgue's modularity theorem and an analytic theorem of H. Jacquet and J. Shalika can be applied to prove the following result related to the Tate Conjecture: for a smooth, projective,…
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…
We discuss the relationship between quaternion algebras and quadratic forms with a focus on computational aspects. Our basic motivating problem is to determine if a given algebra of rank 4 over a commutative ring R embeds in the 2x2-matrix…
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…
We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
We call a class $\mathcal{M}$ of matroids hereditary if it is closed under flats. We denote by $\mathcal{M}^{ext}$ the class of matroids $M$ that is in $\mathcal{M}$, or has an element $e$ such that $M \backslash e$ is in $\mathcal{M}$. We…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…
We prove that under suitable graded and local hypothesis, a formally unramified algebra over a field must be reduced. We detail examples, including one due to Gabber, to show that it is not possible to generalize these results further.
We characterize the rank of edge connection matrices of partition functions of real vertex models, as the dimension of the homogeneous components of the algebra of $G$-invariant tensors. Here $G$ is the sub- group of the real orthogonal…
We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but…
We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $ D=(V,A) $ be a countable digraph with $ s\neq t\in V $ and let $\mathcal{M}=\bigoplus_{v\in V}\mathcal{M}_v $ be a matroid on $ A $ where $…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
We consider A-hypergeometric functions associated to normal sets in the plane. We give a classification of all point configurations for which there exists a parameter vector such that the associated hypergeometric function is algebraic. In…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
For a natural number $c$, a $c$-arrangement is an arrangement of dimension $c$ subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a multiple of $c$. Matroids arising as normalized rank…
In this paper, the structural controllability of the systems over F(z) is studied using a new mathematical method-matroids. Firstly, a vector matroid is defined over F(z). Secondly, the full rank conditions of [sI-A|B] are derived in terms…
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…
The nonnegative rank of a nonnegative matrix is the minimum number of nonnegative rank-one factors needed to reconstruct it exactly. The problem of determining this rank and computing the corresponding nonnegative factors is difficult;…