Related papers: Semigroup automorphisms of total positivity
The paper follows two interconnected directions. 1. Let $G$ be a Roelcke precompact closed subgroup of the group $\Sym(\omega)$ of permutations of the natural numbers. Then $\Inn(G)$ is closed in $\Aut(G)$, where $\Aut(G)$ carries the…
We study faithful representations of the discrete Lorentz symmetry operations of parity $\mathbf P$ and time reversal $\mathbf T$, which involve complex phases when acting on fermions. If the phase of $\mathbf P$ is a rational multiple of…
We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…
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…
We compute an explicit representation of the (topological) automorphism group or a particular Toeplitz subshift. The automorphism group is a (non-finitely generated) subgroup of rational numbers under addition and the shift map corresponds…
We prove that a large class of metrizable group topologies for subgroups of $\mathbb{R}^n$ and the completions of the subgroups are locally isometric to, respectively, metrizable group topologies for $\mathbb{Z}$ and their completions,…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
Let $\mathcal S$ be a semigroup of partial isometries acting on a complex, infinite-dimensional, separable Hilbert space. In this paper we seek criteria which will guarantee that the selfadjoint semigroup $\mathcal T$ generated by $\mathcal…
We study factorization and dilation properties of Markov maps between von Neumann algebras equipped with normal faithful states, i.e., completely positive unital maps which preserve the given states and also intertwine their automorphism…
Let (S, B) be the log pair associated with a projective completion of a smooth quasi-projective surface V . Under the assumption that the boundary B is irreducible, we obtain an algorithm to factorize any automorphism of V into a sequence…
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…
We review the solution of the $A_r$ Q-systems in terms of the partition function of paths on a weighted graph, and show that it is possible to modify the graphs and transfer matrices so as to provide an explicit connection to the theory of…
In this article we prove that quasi-multiplicative (with respect to the usual length function) mappings on the permutation group $\SSn$ (or, more generally, on arbitrary amenable Coxeter groups), determined by self-adjoint contractions…
We give extensions of results on nonnegative matrix semigroups which deduce finiteness or boundedness of such semigroups from the corresponding local properties, e.g., from finiteness or boundedness of values of certain linear functionals…
We consider random subgroups of Thompson's group $F$ with respect to two natural stratifications of the set of all $k$ generator subgroups. We find that the isomorphism classes of subgroups which occur with positive density are not the same…
We study three combinatorial models for the lower-triangular matrix with entries $t_{n,k} = \binom{n}{k} n^{n-k}$: two involving rooted trees on the vertex set $[n+1]$, and one involving partial functional digraphs on the vertex set $[n]$.…
Let $V$ be a M\"{o}bius vertex algebra and $G$ an abelian group of automorphisms of $V$. We construct $P(z)$-tensor product bifunctors for the category of $C_{n}$-cofinite grading-restricted generalized $g$-twisted $V$-modules (without…
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…