Related papers: Unlabeled equivalence for matroids representable o…
In this article we perform an extensive study of the spaces of automorphic forms for GL(2) of weight two and level N, for N an ideal in the ring of integers of the quartic CM field generated by the twelfth roots of unity. This study is…
We introduce a new approach to representation theory of finite groups that uses some basic algebraic geometry and allows to do all the theory without using characters. With this approach, to any finite group $G$ we associate a finite number…
The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The…
We study the evolution of random matroids represented by the sequence of random matrices over ${\mathbb F}_q$ where columns are added one after the other, and each column vector is a uniformly random vector in ${\mathbb F}_q^n$, independent…
A result of Seymour implies that any 3-connected matroid with a modular 3-point line is binary. We prove a similar characterization for 3-connected matroids with modular 4-point lines. We show that such a matroid is either representable…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
A binary frame template is a device for creating binary matroids from graphic or cographic matroids. Such matroids are said to conform or coconform to the template. We introduce a preorder on these templates and determine the nontrivial…
Let $f$ be a newform of weight $2$ on $\Gamma_0(N)$ with Fourier $q$-expansion $f(q)=q+\sum_{n\geq 2} a_n q^n$, where $\Gamma_0(N)$ denotes the group of invertible matrices with integer coefficients, upper triangular mod $N$. Let $p$ be a…
Let E/F be a quadratic extension of non-archimedean local fields of characteristic 0. In this paper, we investigate two approaches which attempt to describe the smooth irreducible representations of GL(n,E) that are distinguished by its…
A matroid is Ingleton if all quadruples of subsets of its ground set satisfy Ingleton's inequality. In particular, representable matroids are Ingleton. We show that the number of Ingleton matroids on ground set $[n]$ is doubly exponential…
This paper defines the q-analogue of a matroid and establishes several properties like duality, restriction and contraction. We discuss possible ways to define a q-matroid, and why they are (not) cryptomorphic. Also, we explain the…
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…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
Luis Ferroni and Alex Fink recently introduced a polytope of all unlabeled matroids of rank $r$ on $n$ elements, and they showed that the vertices of this polytope come from matroids that can be characterized by maximizing a sequence of…
Suppose that $f$ is a homomorphism from the mapping class group $\mathcal{M}(N_{g,n})$ of a nonorientable surface of genus $g$ with $n$ boundary components, to $\mathrm{GL}(m,\mathbb{C})$. We prove that if $g\ge 5$, $n\le 1$ and $m\le g-2$,…
Let $q=p^n$ be an odd prime power and let $\mathbb{F}_q$ be the finite field with $q$ elements. Let $\widehat{\mathbb{F}_q^{\times}}$ be the group of all multiplicative characters of $\mathbb{F}_q$ and let $\chi$ be a generator of…
Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…
Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such…
Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…