Related papers: Matroids arisen from seeds
We show that an adjoint of a loopless matroid is connected if and only if it itself is connected. Our first goal is to study the adjoint of modular matroids. We prove that a modular matroid has only one adjoint (up to isomorphism) which can…
We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…
Braid varieties parametrize linear configurations of flags with transversality conditions dictated by positive braids. They include and generalize reduced double Bruhat cells, positroid varieties, open Bott-Samelson varieties, and…
Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…
In this paper, we obtain relations in the Weyl groups of Kac-Moody algebras that come from mutation classes of skew-symmetrizable matrices. These relations generalize those obtained by Barot and Marsh for finite type. As an application, we…
We introduce delta-graphic matroids, which are matroids whose bases form graphic delta-matroids. The class of delta-graphic matroids contains graphic matroids as well as cographic matroids and is a proper subclass of the class of regular…
From the viewpoint of mutation, we will give a brief survey of tilting theory and cluster-tilting theory together with a motivation from cluster algebras. Then we will give an introdution to \tau-tilting theory which was recently developed…
The classes of even-cycle matroids, even-cycle matroids with a blocking pair, and even-cut matroids each have hundreds of excluded minors. We show that the number of excluded minors for these classes can be drastically reduced if we…
In 1961, Dirac showed that chordal graphs are exactly the graphs that can be constructed from complete graphs by a sequence of clique-sums. In an earlier paper, by analogy with Dirac's result, we introduced the class of $GF(q)$-chordal…
We introduce a procedure that solves the decision problem whether a given matroid M is a gammoid. The procedure consists of three pieces: First, we introduce a notion of a valid matroid tableau which captures the current state of knowledge…
We introduce generalised orbit algebras. The purpose here is to measure how some combinatorial properties can characterize the action of a group of permutations on the subsets. The similarity with orbit algebras is such that it took the…
This is an introduction to cluster algebras and their common triangular bases. These bases are Kazhdan-Lusztig-type and serve as the canonical bases of cluster algebras from the representation-theoretic point of view. We review seeds…
We extend the notion of matroid representations by matrices over fields and consider new representations of matroids by matrices over finite semirings, more precisely over the boolean and the superboolean semirings. This idea of…
In connection with generalized cluster algebras we introduce a certain generalization of the celebrated Rogers dilogarithm, which we call the Rogers dilogarithms of higher degree. We show that there is an identity of these generalized…
A theory of single-element extensions of integer polymatroids analogous to that of matroids is developed. We present an algorithm to generate a catalog of $2$-polymatroids, up to isomorphism. When we implemented this algorithm on a…
The class of cographs or complement-reducible graphs is the class of graphs that can be generated from $K_1$ using the operations of disjoint union and complementation. By analogy, this paper introduces the class of binary comatroids as the…
Clustering multimorbidity has been a global research priority in recent years. Existing studies usually identify these clusters using one of several popular clustering methods and then explore various characteristics of these clusters,…
We investigate special points on the Grassmannian which correspond to friezes with coefficients in the case of rank two. Using representations of arithmetic matroids we obtain a theorem on subpolygons of specializations of the coordinate…
The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…
Recently, Ramos and Whiting showed that any generalized cluster algebra of geometric type is isomorphic to a quotient of a subalgebra of a certain cluster algebra. Based on their idea and method, we show that the same property holds for any…