Related papers: Variations on the Post Correspondence Problem for …
The Gan-Gross-Prasad problem is to describe the restriction of representations of a classical group $G$ to smaller groups $H$ of the same kind. In this paper, we solved the Gan-Gross-Prasad problem over finite fields completely. In previous…
This paper presents a thorough evaluation of several widely-used 3D correspondence grouping algorithms, motived by their significance in vision tasks relying on correct feature correspondences. A good correspondence grouping algorithm is…
The class of free multiarrangements is known to be closed under taking localizations. We extend this result to the stronger notions of inductive and recursive freeness. As an application, we prove that recursively free multiarrangements are…
We describe, up to degree equal to the rank, the Lie algebra associated with the automorphism group of a free group. We compute in particular the ranks of its homogeneous components, and their structure as modules over the linear group.…
In the category of monoids we characterize monomorphisms that are normal, in an appropriate sense, to internal reflexive relations, preorders or equivalence relations. The zero-classes of such internal relations are first described in terms…
We generalize a framework of list colouring results to correspondence colouring. Correspondence colouring is a generalization of list colouring wherein we localize the meaning of the colours available to each vertex. As pointed out by…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
A message-passing procedure for solving the graph isomorphism problem is proposed. The procedure resembles the belief-propagation algorithm in the context of graphical models inference and LDPC decoding. To enable the algorithm, the input…
A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…
We study congruences on the partial automorphism monoid of a finite rank free group action. We give a decomposition of a congruence on this monoid into a Rees congruence, a congruence on a Brandt semigroup and an idempotent separating…
We give a counterexample to a conjecture by Miasnikov, Ventura and Weil, stating that an extension of free groups is algebraic if and only if the corresponding morphism of their core graphs is onto, for every basis of the ambient group. In…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…
A characterization is given of the subsets of a group that extend to the positive cone of a right order on the group and used to relate validity of equations in lattice-ordered groups (l-groups) to subsets of free groups that extend to…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
Let $M$ be a topological monoid with homotopy group completion $\Omega BM$. Under a strong homotopy commutativity hypothesis on $M$, we show that $\pi_k (\Omega BM)$ is the quotient of the monoid of free homotopy classes $[S^k, M]$ by its…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
We give a solution to Dehn's isomorphism problem for the class of all hyperbolic groups, possibly with torsion. We also prove a relative version for groups with peripheral structures. As a corollary, we give a uniform solution to…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…
We give a reduction of the conjugacy problem among outer automorphisms of free (and torsion-free hyperbolic) groups to specific algorithmic problems pertaining to mapping tori of polynomially growing automorphisms. We explain how to use…