Related papers: Three Counterexamples on Semigraphoids
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
We study partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. These permutations are the linear…
Comparability graphs are a popular class of graphs. We introduce as the digraph analogue of comparability graphs the class of comparability digraphs. We show that many concepts such as implication classes and the knotting graph for a…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
In a previous paper we introduced the notion of a {\it real semigroup} (RS) as an axiomatic framework to study diagonal quadratic forms with arbitrary entries over (commutative, unitary) semi-real rings. Two important classes of RSs were…
Graph inverse semigroups generalize the polycyclic inverse monoids and play an important role in the theory of C*-algebras. This paper has two main goals: first, to provide an abstract characterization of graph inverse semigroups; and…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads…
{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…
We propose new definitions of integral, reduced, and normal superrings and superschemes to properly establish the notion of a supervariety. We generalize several results about classical reduced rings and varieties to the supergeometric…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We study properties of semi-elementary imsets and elementary imsets introduced by Studeny (2005). The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated…
The paper is an overview of recent results on algebraic structures (semigroups, groupoids, algebras, inverse semigroups, and groups) associated with objects with a rich set of partial symmetries. We discuss etale groupoids and inverse…
A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…
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…
The aim of this elaborate is presenting the classical symmetric tensors completion problem to an audience of graduate students. As main studying tool, we will introduce the theory of hypergraph rigidity which naturally mirrors the problem…
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…
Groups with a topology that is in consistent one way or another with the algebraic structure are considered. Classical groups with a topology are topological, paratopological, semitopological, and quasitopological groups. We also study…
For every imprimitive complex reflection group of rank 2, we construct a semi-orthogonal decomposition of the derived category of the associated global quotient stack which categorifies the usual decomposition of the orbifold cohomology…