Related papers: Algorithmic problems in right-angled Artin groups:…
This book collects the lectures about graph theory and its applications which were given to students of mathematical departments of Moscow State University and Peking University. Graph theory is a very wide field with a lot of applications…
We survey recent progress on efficient algorithms for approximately diagonalizing a square complex matrix in the models of rational (variable precision) and finite (floating point) arithmetic. This question has been studied across several…
We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…
Grouping the nodes of a graph into clusters is a standard technique for studying networks. We study a problem where we are given a directed network and are asked to partition the graph into a sequence of coherent groups. We assume that…
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…
Rickard complexes in the context of categorified quantum groups can be used to construct braid group actions. We define and study certain natural deformations of these complexes which we call curved Rickard complexes. One application is to…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
We survey the role of right-angled Artin groups in the theory of diffeomorphism groups of low dimensional manifolds. We first describe some of the subgroup structure of right-angled Artin groups. We then discuss the interplay between…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…
We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…
We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
SIS problem has numerous applications in cryptography. Known algorithms for solving that problem are exponential in complexity. A new algorithm is suggested in this note, its complexity is sub-exponential for a range of parameters.
Fueled by algorithmic advances, AI algorithms are increasingly being deployed in settings subject to unanticipated challenges with complex social effects. Motivated by real-world deployment of AI driven, social-network based suicide…
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…
Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…
We introduce a homology theory for subspace arrangements, and use it to extract a new system of numerical invariants from the Bieri-Neumann-Strebel invariant of a group. We use these to characterize when the set of basis conjugating outer…
For a graph $\Gamma$, let $K(H_{\Gamma},1)$ denote the Eilenberg-Mac Lane space associated to the right-angled Artin (RAA) group $H_{\Gamma}$ defined by $\Gamma$. We use the relationship between the combinatorics of $\Gamma$ and the…