Related papers: Doubly exponentially many Ingleton matroids

The new class of integrable mappings and chains is introduced. Corresponding (1+2) integrable systems invariant with respect to such discrete transformations are represented in explicit form. Soliton like solutions of them are represented…

A minimal homogeneous generating system of the algebra of semi-invariants of tuples of two-by-two matrices over an infinite field of characteristic two or over the ring of integers is given. In an alternative interpretation this yields a…

We give a new proof, along with some generalizations, of a folklore theorem (attributed to Laurent Lafforgue) that a rigid matroid (i.e., a matroid with indecomposable basis polytope) has only finitely many projective equivalence classes of…

Using the entropic inequalities for Shannon and Tsallis entropies new inequalities for some classical polynomials are obtained. To this end, an invertible mapping for the irreducible unitary representation of groups $SU(2)$ and $SU(1,1)$…

Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G…

We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…

We call a matroid element "loose" if it is contained in no circuits of size less than the rank of the matroid. A matroid in which all elements are loose is a paving matroid. Acketa determined all binary paving matroids, while Oxley…

The Tic-Tac-Toe matroid is a paving matroid of rank $5$ on 9 elements which is pseudomodular and whose dual is non-algebraic. It has been proposed as a possible example of an algebraic matroid whose dual is not algebraic. We present an…

To each prime ideal in a polynomial ring over a field we associate an algebraic matroid and show that it is preserved under tropicalization. This gives a necessary condition for a tropical variety to be set-theoretically realizable from a…

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

We prove that for every proper minor-closed class $M$ of matroids representable over a prime field, there exists a constant-competitive matroid secretary algorithm for the matroids in $M$. This result relies on the extremely powerful…

We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Let $G$ be a simple algebraic group over an algebraically closed field $k$ of characteristic $p$. The classification of the conjugacy classes of unipotent elements of $G(k)$ and nilpotent orbits of $G$ on $\operatorname{Lie}(G)$ is…

We revise the enumeration of the imprimitive rank two quaternionic reflection groups, adding missing groups and establishing isomorphisms between groups in the published tables. The isomorphisms are obtained as a consequence of the…

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

We prove that, in the random stirring model of parameter T on an infinite rooted tree each of whose vertices has at least two offspring, infinite cycles exist almost surely, provided that T is sufficiently high. In the appendices, the bound…

We prove that the cohomology class of any curve on a very general principally polarized abelian variety of dimension at least 4 is an even multiple of the minimal class. The same holds for the intermediate Jacobian of a very general cubic…