Related papers: Matchings in matroids over abelian groups, II
This is the second paper in a series on representations over diagrams of abelian categories. We show that, under certain conditions, a compatible family of abelian model categories indexed by a skeletal small category can be amalgamated…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…
In 1994 S. Bullett and C. Penrose introduced the one complex parameter family of $(2:2)$ holomorphic correspondences $\mathcal{F}_a$: $$\left(\frac{aw-1}{w-1}\right)^2+\left(\frac{aw-1}{w-1}\right)\left(\frac{az+1}{z+1}\right)…
Rough sets were proposed to deal with the vagueness and incompleteness of knowledge in information systems. There are may optimization issues in this field such as attribute reduction. Matroids generalized from matrices are widely used in…
Interval Pairwise Comparison Matrices have been widely used to account for uncertain statements concerning the preferences of decision makers. Several approaches have been proposed in the literature, such as multiplicative and fuzzy…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F, or more generally, of a bounded PAC field F. This paper answers some of the questions of [1], and in particular that any finite group…
According to Markov, a subset of an abelian group G of the form {x in G: nx=a}, for some integer n and some element a of G, is an elementary algebraic set; finite unions of elementary algebraic sets are called algebraic sets. We prove that…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
Finite determinacy for mappings has been classically thoroughly studied in numerous scenarios in the real- and complex-analytic category and in the differentiable case. It means that the map-germ is determined, up to a given equivalence…
There exists a multiplicative homomorphism from the braid group B to the Temperley-Lieb algebra TL. Moreover, the homomorphic images in TL of the simple elements form a basis for the vector space underlying TL. In analogy with the case of…
We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an…
Matroid varieties are the closures in the Grassmannian of sets of points defined by specifying which Pl\"ucker coordinates vanish and which don't --- the set of nonvanishing Pl\"ucker coordinates forms a well-studied object called a…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
We introduce the notion of a Mahonian pair. Consider the set, P^*, of all words having the positive integers as alphabet. Given finite subsets S,T of P^*, we say that (S,T) is a Mahonian pair if the distribution of the major index, maj,…
Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…
This paper is mainly motivated by the analysis of the so-called Bounded Generation property (BG) of linear groups (in characteristic $0$), which is known to admit far-reaching group-theoretic implications. We achieve complete answers to…
A number which is either the square of an integer or two times the square of an integer is called squarish. There are two main results in the literature on graphs whose number of perfect matchings is squarish: one due to Jockusch (for…
A fundamental theorem of matroid theory establishes that a transversal matroid is representable over fields of any characteristic. It was proved in 1970 by Piff and Welsh: their proof is elegant and concise and, moveover, constructive.…