Related papers: The Post Correspondence Problem and equalisers for…
For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…
Let $F\_n$ be the free group on $n$ generators. Consider the group $IA\_n$ of automorpisms of $F\_n$ acting trivially on its abelianization. There are two canonical filtrations on $IA\_n$: the first one is its lower central series…
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…
A word in a group is called a test element if any endomorphism fixing it is necessarily an automorphism. In this note, we give a sufficient condition in geometry to construct test elements for monomorphisms of a free group, by using the…
The paper makes the observation that all orders of information entropy are equal in signals composed of repeating units of distinct symbols where the units can be classified as a member of a symmetry group. This leads to an improved metric…
We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…
In this article, we show that the stabilized automorphism group of free exact odometers arising from actions of finitely generated residually finite groups coincides with the topological full group of the odometer acting on itself by right…
We propose a scalable framework for deciding, proving, and explaining (in-)equivalence of context-free grammars. We present an implementation of the framework and evaluate it on large data sets collected within educational support systems.…
Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…
We consider entanglement through permeable junctions of $N$ $(1+1)$-dimensional free boson and free fermion conformal field theories. In the folded picture we constrain the form of the general boundary state. We calculate replicated…
We present an algorithm that takes an unannotated corpus as its input, and returns a ranked list of probable morphologically related pairs as its output. The algorithm tries to discover morphologically related pairs by looking for pairs…
The symmetrization postulate asserts that the state of particular species of particles can only be of one permutation symmetry type: symmetric for bosons and antisymmetric for fermions. We report some experimental results showing that pairs…
We construct a correspondence between epimorphisms $\varphi \colon \pi_1(M) \to F_r$ from the fundamental group of a compact manifold $M$ onto the free group of rank $r$, and systems of $r$ framed non-separating hypersurfaces in $M$, which…
In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…
Let PC be the group of bijections from [0, 1[ to itself which are continuous outside a finite set. Let PC be its quotient by the subgroup of finitely supported permutations. We show that the Kapoudjian class of PC vanishes. That is, the…
The main result of this article establishes the free analog of Grothendieck's Theorem on bijective polynomial mappings of $\mathbb{C}^g$. Namely, we show if $p$ is a polynomial mapping in $g$ freely non-commuting variables sending…
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not "under control" from a polyhedral point of view. The equivalence between \emph{optimization} and…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
A similarity transformation is constructed through which a system of particles interacting with inverse-square two-body and harmonic potentials in one dimension, can be mapped identically, to a set of free harmonic oscillators. This…
The exact matching problem is a constrained variant of the maximum matching problem: given a graph with each edge having a weight $0$ or $1$ and an integer $k$, the goal is to find a perfect matching of weight exactly $k$. Mulmuley,…