Related papers: Posets from Admissible Coxeter Sequences
For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
Continuous wavelet transforms arising from the quasiregular representation of a semidirect product of a vector group with a matrix group -- the so-called dilation group -- have been studied by various authors. Recently the attention has…
The \textit{boxicity} (\textit{cubicity}) of an undirected graph $\Gamma$ is the smallest non-negative integer $k$ such that $\Gamma$ can be represented as the intersection graph of axis-parallel rectangular boxes (unit cubes) in…
Topological concepts may be applied to any poset via the simplicial complex of finite chains. The coset poset C(G) of a finite group G (consisting of all cosets of all proper subgroups of G, ordered by inclusion) was introduced by Kenneth…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
The problem of interpreting a set of ${\cal W}$-algebra constraints constructed in terms of an arbitrarily twisted scalar field as the recursion relations of a topological theory is addressed. In this picture, the conventional models of…
Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…
We study in detail the Jordan forms of the Coxeter transformations and prove shearing formulas due to Subbotin and Sumin for the characteristic polynomials of the Coxeter transformations. Using shearing formulas we calculate characteristic…
In 2016, Hasebe and Tsujie gave a recursive characterization of the set of induced $N$-free and bowtie-free posets; Misanantenaina and Wagner studied these orders further, naming them "$\mathcal{V}$-posets". Here we offer a new…
In this paper we study some of the basic properties of a graph which is constructed from the equivalence classes of non-zero zero-divisors determined by annihilator ideals of a poset. In particular, we demonstrate how this graph helps in…
We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…
We generalize B. Kostant's construction of generating functions to the case of multiply-laced diagrams and we prove for this case W. Ebeling's theorem which connects the Poincare series [P_G(t)]_0 and the Coxeter transformations. According…
This talk was presented at Workshop "Spectral Methods in Representation Theory of Algebras and Applications to the Study of Rings of Singularities", 2008 (Banff, Canada). W. Ebeling established a connection between certain Poincare series,…
In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
We consider a generalized poset sorting problem (GPS), in which we are given a query graph $G = (V, E)$ and an unknown poset $\mathcal{P}(V, \prec)$ that is defined on the same vertex set $V$, and the goal is to make as few queries as…
The article investigates high-level general invertible-sequential processing in the digital and quantum domains. In particular it is shown that (i) invertible digital-sequential processes, constructed using a standard general-inversion…
We study degree sequences for simplicial posets and polyhedral complexes, generalizing the well-studied graphical degree sequences. Here we extend the more common generalization of vertex-to-facet degree sequences by considering arbitrary…
Each Coxeter element c of a Coxeter group W defines a subset of W called the c-sortable elements. The choice of a Coxeter element of W is equivalent to the choice of an acyclic orientation of the Coxeter diagram of W. In this paper, we…