Related papers: Single-element extensions of matroids over skew tr…
Motivated by Kontsevich's graph complexes, this paper gives a systematic study of matroid complexes. We construct deletion and contraction bicomplexes on the vector space spanned by matroid classes equipped with ground-set orientations,…
In this article we make several contributions of independent interest. First, we introduce the notion of stressed hyperplane of a matroid, essentially a type of cyclic flat that permits to transition from a given matroid into another with…
In this paper we extend the theory of oriented matroids to Lagrangian orthogonal matroids and their representations, and give a completely natural transformation from a representation of a classical oriented matroid to a representation of…
We give an upper and lower estimate for the maximal commutator length of a noncentral element of the elementary subgroup of the general linear group over a skew-field based on the maximal commutator length of an element of the…
Based on the work done in \cite{BV-Tind,DMS} in the o-minimal and geometric settings, we study expansions of models of a supersimple theory with a new predicate distiguishing a set of forking-independent elements that is dense inside a…
A wide class of skew derivations on degree-one generalized Weyl algebras $R(a,\varphi)$ over a ring $R$ is constructed. All these derivations are twisted by a degree-counting extensions of automorphisms of $R$. It is determined which of the…
In [Mon11] are studied, for the axiomatic extensions of the monoidal t-norm based logic ([EG01]), the properties of single chain completeness. On the other side, in [GJKO07, Chapter 5] are studied many logical and algebraic properties (like…
Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…
We examine several aspects of the formulation of M(atrix)-Theory on ALE spaces. We argue for the existence of massless vector multiplets in the resolved $A_{n-1}$ spaces, as required by enhanced gauge symmetry in M-Theory, and that these…
The Day Reflection Theorem gives conditions under which a reflective subcategory of a closed monoidal category can be equipped with a closed monoidal structure in such a way that the reflection adjunction becomes a monoidal adjunction. We…
We study a generalized notion of a homogeneous skew-product extension of a probability-preserving system in which the homogeneous space fibres are allowed to vary over the ergodic decomposition of the base. The construction of such…
A basis of $N^2$ projectors, each an ${N^2}\times{N^2}$ matrix with constant elements, is implemented to construct a class of braid matrices $\hat{R}(\theta)$, $\theta$ being the spectral parameter. Only odd values of $N$ are considered…
We call an oriented matroid Mandel if it has an extension in general position which makes all programs with that extension Euclidean. If $L$ is the minimum number of mutations adjacent to an element of the groundset, we call an oriented…
We present a construction of skew monoidal structures from strong actions. We prove that the existence of a certain adjoint allows one to equip the actegory with a skew monoidal structure and that this adjunction becomes monoidal. This…
We consider three forms of composition of matroids, each of which extends the category of bimatroids to a rigid monoidal category. Many well-known constructions are functorial or defined by morphisms in these categories. Motivating examples…
Zaslavsky (1991) introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We introduce a new, dual graphical structure that we call a…
In this paper we will establish a structure theorem concerning the extension of analytic objects associated to germs of dimension one foliations on surfaces, through one-dimensional barriers. As an application, an extension theorem for…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
Given an $n$-connected binary matroid, we obtain a necessary and sufficient condition for its single-element coextensions to be $n$-connected.