Related papers: Reduced decompositions and commutation classes
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…
Weakly separated collections arise in the cluster algebra derived from the Pl\"ucker coordinates on the nonnegative Grassmannian. Oh, Postnikov, and Speyer studied weakly separated collections over a general Grassmann necklace $\mathcal{I}$…
We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number $\kappa$, approximately 2.20557, for which there are only countably many permutation…
We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
This paper studies reduced-order modeling of dynamic networks with strongly connected topology. Given a graph clustering of an original complex network, we construct a quotient graph with less number of vertices, where the edge weights are…
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder…
This paper introduces the tensor representation of a network, here tensors are the primitive structures of the network. In view of tensor chains, two binary operations on tensor sets are defined: chain addition and reducing. Based on the…
Inspired by the work of Wang and Zhou [4] for Rota-Baxter algebras, we develop a cohomology theory of Rota-Baxter systems and justify it by interpreting the lower degree cohomology groups as formal deformations and as abelian extensions of…
The structure of three pattern classes Av(2143, 4321), Av(2143, 4312) and Av(1324, 4312) is determined using the machinery of monotone grid classes. This allows the permutations in these classes to be described in terms of simple diagrams…
In this paper we study classical deformations of diagrams of commutative algebras over a field of characteristic 0. In particular we determine several homotopy classes of DG-Lie algebras, each one of them controlling this above deformation…
We apply the theory of Bruhat-Tits trees to the study of optimal embeddings of two and three dimensional commutative orders into quaternion algebras. Specifically, we determine how many conjugacy classes of global Eichler orders in a…
We consider the extended superconformal algebras of the Knizhnik-Bershadsky type with $W$-algebra like composite operators occurring in the commutation relations, but with generators of conformal dimension 1,$\frac{3}{2}$ and 2, only. These…
The main purpose of this paper is to study restricted formal deformations of restricted Lie-Rinehart algebras in positive characteristic $p$. For $p>2$, we discuss the deformation theory and show that deformations are controlled by the…
Jacobi permutations, introduced by Viennot in the context of Jacobi elliptic functions, are counted by the Euler numbers $E_{n}$ appearing in the series expansion $\sec x+\tan x=\sum_{n=0}^{\infty}E_{n}x^{n}/n!$. We conduct a systematic…
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…
The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…
We develop a new, powerful method for counting elements in a multiset. As a first application, we use this algorithm to study the number of occurrences of patterns in a permutation. For patterns of length 3 there are two Wilf classes, and…
In this paper we study an emerging class of neural networks based on the morphological operators of dilation and erosion. We explore these networks mathematically from a tropical geometry perspective as well as mathematical morphology. Our…