Related papers: Conjugacy problem in T-RAAGs
The joint bidiagonalization process of a matrix pair $\{A,L\}$ can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization…
A finite simplicial graph \Gamma determines a right-angled Artin group G_\Gamma, with generators corresponding to the vertices of \Gamma, and with a relation vw=wv for each pair of adjacent vertices. We compute the lower central series…
By introducing branching conditions on the defining graph, we prove a range of rigidity results for quasiisometric embeddings between right-angled Artin groups. The starting point for these is that, under mild conditions on the codomain,…
Cactus groups and their pure subgroups appear in various fields of mathematics and are currently attracting attention from diverse mathematical communities. They share similarities with both right-angled Coxeter groups and braid groups. In…
In the presence of recombination, the evolutionary relationships between a set of sampled genomes cannot be described by a single genealogical tree. Instead, the genomes are related by a complex, interwoven collection of genealogies…
We present an algorithmic approach to the conjugacy problems in monoids, using rewriting systems. We extend the classical theory of rewriting developed by Knuth and Bendix to a rewriting that takes into account the cyclic conjugates.
The main goal of this paper is a calculation of the integral (co)homology of the group of symmetric automorphisms of a free product. We proceed by giving a geometric interpretation of symmetric automorphisms via a moduli space of certain…
We study the problem of image alignment for panoramic stitching. Unlike most existing approaches that are feature-based, our algorithm works on pixels directly, and accounts for errors across the whole images globally. Technically, we…
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…
We propose a framework for optimal $t$-matchings excluding the prescribed $t$-factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching problem and includes several problems, such as the…
We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…
Tensor renormalization group (TRG) constitutes an important methodology for accurate simulations of strongly correlated lattice models. Facilitated by the automatic differentiation technique widely used in deep learning, we propose a…
Reidemeister numbers of group automorphisms encode the number of twisted conjugacy classes of groups and might yield information about self-maps of spaces related to the given objects. Here we address a question posed by Gon\c{c}alves and…
Complex, multi-objective missions require the coordination of heterogeneous robots at multiple inter-connected levels, such as coalition formation, scheduling, and motion planning. This challenge is exacerbated by dynamic changes, such as…
Solving Quadratic equation is one of the intrinsic interests as it is the simplest nonlinear equations. A novel approach for solving Quadratic Equation based on Genetic Algorithms (GAs) is presented. Genetic Algorithms (GAs) are a technique…
Retrieval-augmented generation (RAG) agents are increasingly deployed to answer questions over local knowledge bases that cannot be centralized due to knowledge-sovereignty constraints. This results in two recurring failures in production:…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…
In this paper, we examine the concept of twisted Rota-Baxter (TRB) operators on associative conformal algebras. Our strategy begins by constructing an $L_\infty$-algebra using Maurer-Cartan elements derived from $H$-twisted Rota-Baxter…
Semigroup C*-algebras for right-angled Artin monoids were introduced and studied by Crisp and Laca. In the paper at hand, we are able to present the complete answer to their question of when such C*-algebras are isomorphic. The answer to…