Related papers: Identifying Half-Twists Using Randomized Algorithm…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
The main result of this article is that any braided (resp. annular, planar) diagram group $D$ splits as a short exact sequence $1 \to R \to D \to S \to 1$ where $R$ is a subgroup of some right-angled Artin group and $S$ a subgroup of…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
We define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…
Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…
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…
The problem of learning or reconstructing an unknown graph from a known family via partial-information queries arises as a mathematical model in various contexts. The most basic type of access to the graph is via \emph{edge queries}, where…
Given a structure made up of n sites connected by b bars, the problem of recognizing which subsets of sites form rigid units is not a trivial one, because of the non-local character of rigidity in central-force systems. Even though this is…
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial…
Biclustering, also known as co-clustering or two-way clustering, simultaneously partitions the rows and columns of a data matrix to reveal submatrices with coherent patterns. Incorporating background knowledge into clustering to enhance…
L. Kauffman (2024) introduced multi-virtual and symmetric multi-virtual braid groups, which are generalizations of the virtual braid group. We introduce multi-virtual pure and multi-virtual semi-pure braid groups, which are normal subgroups…
We give generators for a certain complex hyperbolic braid group. That is, we remove a hyperplane arrangement from complex hyperbolic $13$-space, take the quotient of the remaining space by a discrete group, and find generators for the…
In the present paper, we introduce $\mathbb{Z}_2$-braids and, more generally, $G$-braids for an arbitrary group $G$. They form a natural group-theoretic counterpart of $G$-knots, see \cite{reidmoves}. The underlying idea, used in the…
We prove for $m\geq1$ and $n\geq5$ that the level $m$ congruence subgroup $B_n[m]$ of the braid group $B_n$ associated to the integral Burau representation $B_n\to\mathrm{GL}_n(\mathbb{Z})$ is generated by $m$th powers of half-twists and…
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous questions and structures in physics, mathematics, computer…
We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure.…
In the context of finite Abelian groups two problems are presented and solved using quantum computing techniques. The first is the well--known Hidden Subgroup Problem, originally solved by Simon in a landmark work. The second is the Fully…
We define half grid diagrams and prove every link is half grid presentable by constructing a canonical half grid pair (which gives rise to a grid diagram of some special type) associated with an element in the oriented Thompson group. We…
We introduce a novel algorithm that leverages stochastic sampling techniques to compute the perturbative triples correction in the coupled-cluster (CC) framework. By combining elements of randomness and determinism, our algorithm achieves a…