Related papers: Equimorphy -- The Case of Chains
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
It is shown that every scalar linear quadrilateral lattice equation lies within a family of similar equations, members of which are compatible between one another on a higher dimensional lattice. There turn out to be two such families, a…
We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection graph have order dimension at most four. Starting from this…
In this paper, we characterize the monoid of endomorphisms of the semigroup of all oriented full transformations of a finite chain, as well as the monoid of endomorphisms of the semigroup of all oriented partial transformations and the…
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion. A threshold graph can be obtained from a chain graph by making adjacent all pairs of…
Let G be a group. Two elements x,y are said to be in the same z-class if their centralizers are conjugate in G. Let V be a vector space of dimension n over a field F of characteristic different from 2. Let B be a non-degenerate symmetric,…
When a category is equipped with a 2-cell structure it becomes a sesquicategory but not necessarily a 2-category. It is widely accepted that the latter property is equivalent to the middle interchange law. However, little attention has been…
We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but…
Let $X$ be a finite or infinite chain and let $O(X)$ be the monoid of all endomorphisms of $X$. In this paper, we describe the largest regular subsemigroup of $O(X)$ and Green's relations on $O(X)$. In fact, more generally, if $Y$ is a…
Let $\mathcal{A}=(A_{1},...,A_{n},...)$ be a finite or infinite sequence of $2\times2$ matrices with entries in an integral domain. We show that, except for a very special case, $\mathcal{A}$ is (simultaneously) triangularizable if and only…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is nonzero, and the entry in the top-right corner is nonzero.…
In this paper, we characterize the monoid of endomorphisms of the semigroup of all monotone full transformations of a finite chain, as well as the monoids of endomorphisms of the semigroup of all monotone partial transformations and of the…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
The quantum lens spaces form a natural and well-studied class of noncommutative spaces which can be subjected to classification using algebraic invariants by drawing on the fully developed classification theory of unital graph…