Related papers: On the penetration distance in Garside monoids
We show that for any periodic mapping class, there is some power which maps a nonseparating, simple closed curve to a distinct, disjoint nonseparating curve. As an application of this result, we introduce the notion of stable specific…
Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…
We prove that the natural homomorphism from an Artin monoid to its associated Artin group is always injective
We give an explicit geometric argument that Artin's braid group $B_n$ is right-orderable. The construction is elementary, natural, and leads to a new, effectively computable, canonical form for braids which we call left-consistent canonical…
Let $G$ be a connected graph with vertex set $V(G)$, and denote by $d_G(u,v)$ the distance from $u$ to $v$ in $G$, for any $u,v \in V(G)$. The average distance of an $n$-vertex connected graph $G$, denoted by $\mu(G)$, is defined to be the…
Overlap-free words are words over the binary alphabet $A=\{a, b\}$ that do not contain factors of the form $xvxvx$, where $x \in A$ and $v \in A^*$. We analyze the asymptotic growth of the number $u_n$ of overlap-free words of length $n$ as…
We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…
The usual Euclidean distance may be generalized to extended objects such as polymers or membranes. Here, this distance is used for the first time as a cost function to align structures. We examined the alignment of extended strands to…
A generalization of the topological fundamental group is developed in order to exhibit a topologically complete braid group containing Artin's braid group on infinitely many strands with respect to the following notion of convergence: A…
The size of rings (also called cyclic polymers) in bidisperse blends of chemically identical rings is analyzed by computer simulations. Data of entangled ring blends and blends of interpenetrating rings are compared and it is shown that the…
Although regular expressions do not correspond univocally to regular languages, it is still worthwhile to study their properties and algorithms. For the average case analysis one often relies on the uniform random generation using a…
We investigate numerically the role of spatial arrangement of the patches on the irreversible adsorption of patchy colloids on a substrate. We consider spherical three-patch colloids and study the dependence of the kinetics on the opening…
This paper shows how to construct coherent presentations (presentations by generators, relations and relations among relations) of monoids admitting a right-noetherian Garside family. Thereby, it resolves the question of finding a unifying…
In this paper we consider the time and the crossing sequence complexities of one-tape off-line Turing machines. We show that the running time of each nondeterministic machine accepting a nonregular language must grow at least as n\log n, in…
We introduce methods to study the combinatorics of the normal form of large random elements in Artin-Tits monoids. These methods also apply in an axiomatic framework that encompasses other monoids such as dual braid monoids.
A. Iosevich and K. Taylor showed that compact subsets of $\mathbb R^d$ with Hausdorff dimension greater than $(d+1)/2$ contain trees with gaps in an open interval. Under the same dimensional threshold, we prove the analogous result where…
Each free homotopy class of directed closed curves on a surface with boundary can be described by a cyclic reduced word in the generators of the fundamental group and their inverses. The word length is the number of letters of the cyclic…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
The asymptotic survival probability of a spherical target in the presence of a single subdiffusive trap or surrounded by a sea of subdiffusive traps in a continuous Euclidean medium is calculated. In one and two dimensions the survival…
We establish selection of critical pulled fronts in invasion processes. Our result shows convergence to a pulled front with a logarithmic shift for open sets of steep initial data, including one-sided compactly supported initial conditions.…