Related papers: Representations of weakly multiplicative arithmeti…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
We consider the variety of $(p+1)$-tuples of matrices $A_j$ (resp. $M_j$) from given conjugacy classes $c_j\subset gl(n,{\bf C})$ (resp. $C_j\subset GL(n,{\bf C})$) such that $A_1+... +A_{p+1}=0$ (resp. $M_1... M_{p+1}=I$). This variety is…
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…
The multivariate arithmetic Tutte polynomial of arithmetic matroids is a generalization of the multivariate Tutte polynomial of matroids. In this note, we give the convolution formulas for the multivariate arithmetic Tutte polynomial of the…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
q-Matroids form the q-analogue of classical matroids. In this paper we introduce various types of maps between q-matroids. These maps are not necessarily linear, but they map subspaces to subspaces and respect the q-matroid structure in…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We consider a class of weak modules for vertex operator algebras that we call logarithmic modules. We also construct nontrivial examples of intertwining operators between certain logarithmic modules for the Virasoro vertex operator algebra.…
An algebra $A$ is left weakly Gorenstein if any semi-Gorenstein-projective left $A$-modules is Gorenstein-projective. The weakly Gorensteinness of two kinds of algebras are answered. Using the method of the monomorphism category, it is…
The foundation of a matroid is a canonical algebraic invariant which classifies representations of the matroid up to rescaling equivalence. Foundations of matroids are pastures, a simultaneous generalization of partial fields and…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
There is a decomposition of a Lie algebra for open matrix chains akin to the triangular decomposition. We use this decomposition to construct unitary irreducible representations. All multiple meson states can be retrieved this way.…
We give a characterisation of representation-finite symmetric algebras of period four, and describe their basic algebras. In particular, if such an algebra is indecomposable, it has at most two simple modules.
We study permutability properties of matrix semigroups over commutative bipotent semirings (of which the best-known example is the tropical semiring). We prove that every such semigroup is weakly permutable (a result previous stated in the…
We investigate the Galois coverings of weakly shod algebras. For a weakly shod algebra not quasi-tilted of canonical type, we establish a correspondence between its Galois coverings and the Galois coverings of its connecting component. As a…
Let $\mathcal{N}$ be a set of matroids. A matroid $M$ is strictly $\mathcal{N}$-fragile if $M$ has a member of $\mathcal{N}$ as minor and, for all $e \in E(M)$, at least one of $M\backslash e$ and $M/e$ has no minor in $\mathcal{N}$. In…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
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…