Related papers: A note on Isomorphism theorems for semigroups of o…
Given the cutting and spacer parameters for a rank-1 transformation, there is a simple condition which is easily seen to be sufficient to guarantee that the transformation under consideration is isomorphic to its inverse. Here we show that…
In this article we study a coarse version of the $K$-theoretic Farrell--Jones conjecture we call coarse or bounded isomorphism conjecture. Using controlled category theory we are able to translate this conjecture for asymptotically faithful…
We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
We determine the group of linear transformations on a vector space $V$ that preserve a polynomial function $f$ on $V$ for several interesting pairs $(V,f)$, using the theory of semisimple algebraic groups.
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
Inspired by the classical category theorems of Halmos and Rohlin for the discrete measure preserving transformations, we prove analogous results in the abstract setting of unitary and isometric C_0-semigroups on a separable Hilbert space.…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
Let $\Omega_n$ be a finite chain with $n$ elements $(n\in\mathbb{N})$, and let $\mathcal{POPI}_{n}$ be the semigroup of all injective orientation-preserving partial transformations of $\Omega_n$. In this paper, for any nonempty subset $Y$…
We show that if an open cover of a finite dimensional space is equivariant with respect to some finite group action on the space then there is an equivariant refinement of bounded dimension. This will generalize some constructions of…
Firstly, we give a partial solution to the isomorphism problem for uniserial modules of finite length with the help of the morphisms between these modules over an arbitrary ring. Later, under suitable assumptions on the lattice of the…
In this paper, we study the isotropy subgroups of some almost rigid domains and give necessary and sufficient conditions for an automorphism to be in the isotropy subgroup.
We prove that a proper holomorphic map between two bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the…
The problem of linearization for third order evolution equations is considered. Criteria for testing equations for linearity are presented. A class of linearizable equations depending on arbitrary functions is obtained by requiring presence…
For each subchain $X'$ of a chain $X$, let $T_{RE}(X, X')$ denote the semigroup under composition of all full regressive transformations, $\alpha:X\rightarrow X'$ satisfying $x\alpha\leq x$ for all $x\in X$. Necessary and sufficient…
We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…
We prove that if two finite metacyclic groups have isomorphic rational group algebras, then they are isomorphic. This contributes to understand where is the line separating positive and negative solutions to the Isomorphism Problem for…
From any poset isomorphic to the poset of gaps of a numerical semigroup $S$ with the order induced by $S$, one can recover $S$. As an application, we prove that two different numerical semigroups cannot have isomorphic posets (with respect…