Related papers: About the cyclically reduced product of words

The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system:…

For any reduced amalgamated free product $\mathrm{C}^*$-algebra $(A,E)=(A_1, E_1) \ast_D (A_2,E_2)$, we introduce and study a canonical ambient $\mathrm{C}^*$-algebra $\Delta\mathbf{T}(A,E)$ of $A$ which generalizes the crossed product…

We describe an efficient algorithm to write any element of the alternating group A_n as a product of two n-cycles (in particular, we show that any element of A_n can be so written -- a result of E. A. Bertram). An easy corollary is that…

We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…

Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…

This paper proposes an extension to classical regular expressions by the addition of two operators allowing the inclusion of boolean formulae from the zeroth order logic. These expressions are called constrained expressions. The associated…

We present a calculus providing a Curry-Howard correspondence to classical logic represented in the sequent calculus with explicit structural rules, namely weakening and contraction. These structural rules introduce explicit erasure and…

We prove the Hao-Ng isomorphism for reduced crossed products by locally compact Hausdorff groups. More precisely, for a non-degenerate $\mathrm{C}^*$-correspondence $X$ and a generalized gauge action $G \curvearrowright X$ by a locally…

We characterise stable finiteness and pure infiniteness of the essential crossed product of a C*-algebra by an action of an inverse semigroup. Under additional assumptions, we prove a stably finite / purely infinite dichotomy. Our main…

We construct explicit approximating nets for crossed products of C*-algebras by actions of discrete quantum groups. This implies that C*-algebraic approximation properties such as nuclearity, exactness or completely bounded approximation…

Symplectic reduction is reinterpreted as the composition of arrows in the category of integrable Poisson manifolds, whose arrows are isomorphism classes of dual pairs, with symplectic groupoids as units. Morita equivalence of Poisson…

We combine aspects of the notions of finite decomposition complexity and asymptotic property C into a notion that we call finite APC-decomposition complexity. Any space with finite decomposition complexity has finite APC-decomposition…

Let C be a class of groups. We give sufficient conditions ensuring that a free product of residually C groups is again residually C, and analogous conditions are given for locally embeddable into C groups. As a corollary, we obtain that the…

Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…

Given reduced amalgamated free products of C$^*$-algebras, $(A,phi)=*_i(A_i,phi_i)$ and $(D,psi)=*_i(D_i,psi_i)$, an embedding $A\to D$ is shown to exist assuming there are conditional expectation preserving embeddings $A_i\to D_i$. This…

In this paper, we give a combinatorial proof of a positivity result of Chern related to Andrews's $\mathcal{EO}^*$-type partitions. This combinatorial proof comes after reframing Chern's result in terms of copartitions. Using this new…

A necessary and sufficient condition for the simplicity of the C*-algebra reduced free product of finite dimensional abelian algebras is found, and it is proved that the stable rank of every such free product is 1. Related results about…

We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…

This work investigates the combinatorial structures underlying cyclic conditional freeness and introduces cumulants that serve to linearize the cyclic conditional additive convolution. In the process, we establish the notion of "cyclic…

Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…