Related papers: The Highly Connected Matroids in Minor-closed Clas…
Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…
This study aims to shed light on new (sub)classes of matroids originating from cluster algebras and investigate their properties. We focus on what we call cluster matroids and build some results on them. Then, we point out a relationship…
We introduce the notion of graphic cocircuits and show that a large class of regular matroids with graphic cocircuits belongs to the class of signed-graphic matroids. Moreover, we provide an algorithm which determines whether a cographic…
Let R be an associative ring with possible extra structure. R is said to be weakly small if there are countably many 1-types over any finite subset of R. It is locally P if the algebraic closure of any finite subset of R has property P. It…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…
Proper classes of extensions of real field was defined and topological properties of these extensions were studied. These extensions can be connected, in this case such set is not closed under binary operations (addition and…
First we survey generating function methods for obtaining useful probability estimates about random matrices in the finite classical groups. Then we describe a probabilistic picture of conjugacy classes which is coherent and beautiful.…
Let $M$ to be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. In this paper, we prove that the nontrivial facets…
Two main topics are considered: The characterisation of finite homomorphism dualities for relational structures, and the splitting property of maximal antichains in the homomorphism order.
A matrix (and any associated linear system) will be referred to as structured if it has a small displacement rank. It is known that the inverse of a structured matrix is structured, which allows fast inversion (or solution), and reduced…
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…
The characteristic forms in the bundle of connections of a principal bundle P over M determine the characteristic classes of P for degree less or equal to the dimension of M, and differential forms on the space of connections for higher…
A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
A result of Mason, as refined by Ingleton, characterizes transversal matroids as the matroids that satisfy a set of inequalities that relate the ranks of intersections and unions of nonempty sets of cyclic flats. We prove counterparts, for…
Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…
Motivated by Gr\"obner basis theory for finite point configurations, we define and study the class of "standard complexes" associated to a matroid. Standard complexes are certain subcomplexes of the independence complex that are invariant…
The closure $\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this…
The problem of covering the ground set of two matroids by a minimum number of common independent sets is notoriously hard even in very restricted settings, i.e.\ when the goal is to decide if two common independent sets suffice or not.…