Related papers: Stanley-Reisner rings for quasi-arithmetic matroid…
In a paper from 2002, Bruns and Gubeladze conjectured that graded algebra retracts of polytopal algebras over a field $k$ are again polytopal algebras. Motivated by this conjecture, we prove that graded algebra retracts of Stanley-Reisner…
We introduce the singular cohomology ring of a matroid which extends the Chow ring of a matroid. This is defined as the singular cohomology ring of a certain quasi-projective toric variety associated to the matroid. Using the matroidal…
We compute the Stanley depth for the quotient ring of a square free Veronese ideal and we give some bounds for the Stanley depth of a square free Veronese ideal. In particular, it follows that both satisfy the Stanley's conjecture.
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
Two families of quasi exactly solvable 2*2 matrix Schroedinger operators are constructed. The first one is based on a polynomial matrix potential and depends on three parameters. The second is a one-parameter generalisation of the scalar…
In this paper, we establish a one-to-one correspondence between the set of biclosed sets in an irreducible root system of type $A_n$ and the set of quasitrivial semigroup structures on a set with $n+1$ elements. Building on this…
In this thesis, we study nearly finitary matroids by introducing new definitions and prove various properties of nearly finitary matroids. In 2010, an axiom system for infinite matroids was proposed by Bruhn et al. We use this axiom system…
We consider families of simple polytopes $P$ and simplicial complexes $K$ well-known in polytope theory and convex geometry, and show that their moment-angle complexes have some remarkable homotopy properties which depend on combinatorics…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
We present a new approach to verify the Elementary Type Conjecture for abstract Witt rings with small number of square classes. To do so, we make use of an abstract analogue of the 2-torsion part of the Brauer group, also verifying a…
Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…
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…
If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…
The families of quasi-simple or Cayley--Klein algebras associated to antihermitian matrices over R, C and H are described in a unified framework. These three families include simple and non-simple real Lie algebras which can be obtained by…
The rings of quantum integrals of the generalized Calogero-Moser systems related to the deformed root systems ${\cal A}_n(m)$ and ${\cal C}_n(m,l)$ with integer multiplicities and corresponding algebras of quasi-invariants are investigated.…
The connectivity of graphs of simplicial and polytopal complexes is a classical subject going back at least to Steinitz, and the topic has since been studied by many authors, including Balinski, Barnette, Athanasiadis and Bjorner. In this…
An affine oriented matroid is a combinatorial abstraction of an affine hyperplane arrangement. From it, Novik, Postnikov and Sturmfels constructed a squarefree monomial ideal in a polynomial ring, called an oriented matroid ideal, and got…
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…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
One of the most important classes of even $\Delta$-matroids arises from orientable ribbon graphs, which play a role analogous to that of graphic matroids in matroid theory. Motivated by a natural correspondence between strong…