相关论文: A New Approach to the Conjugacy Problem in Garside…

This paper presents a new generalization error analysis for Decentralized Stochastic Gradient Descent (D-SGD) based on algorithmic stability. The obtained results overhaul a series of recent works that suggested an increased instability due…

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

Let $\mathrm{Mod}(S_g)$ be the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$. In this paper, we derive necessary and sufficient conditions under which two torsion elements in $\mathrm{Mod}(S_g)$ will have…

In this note, we describe a probabilistic attack on public key cryptosystems based on the word/conjugacy problems for finitely presented groups of the type proposed recently by Anshel, Anshel and Goldfeld. In such a scheme, one makes use of…

A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…

This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

We propose a general way to complete supersymmetric theories with operators below the unitarity bound, adding gauge-singlet fields which enforce the decoupling of such operators. This makes it possible to perform all usual computations, and…

We provide new group presentations for surface braid groups which are positive. We study some properties of such presentations and we solve the conjugacy problem in a particular case.

In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…

Cryptographic systems are derived using units in group rings. Combinations of types of units in group rings give units not of any particular type. This includes cases of taking powers of units and products of such powers and adds the…

We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time…

Let $G=(V,E)$ be a graph without isolated vertices. A matching in $G$ is a set of independent edges in $G$. A perfect matching $M$ in $G$ is a matching such that every vertex of $G$ is incident to an edge of $M$. A set $S\subseteq V$ is a…

In a graph $G = (V,E)$, a vertex subset $S\subseteq V(G)$ is said to be a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A dominating set $S$ of $G$ is called a paired-dominating set of $G$ if the induced…

Given a simple undirected graph $G$, the maximum $k$-club problem is to find a maximum-cardinality subset of nodes inducing a subgraph of diameter at most $k$ in $G$. This NP-hard generalization of clique, originally introduced to model low…

In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…

This paper introduces the \emph{$d$-distance $b$-matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges, an integer $d\in\mathbb{Z}_+$ and a degree bound function…

In this article, we solve the twisted conjugacy problem with respect to endomorphisms for solvable Baumslag--Solitar groups $BS(1,n)$, i.e., we propose an algorithm which, given two elements $u,v \in BS(1,n)$ and an endomorphism $\psi \in…

Semi-supervised clustering is a basic problem in various applications. Most existing methods require knowledge of the ideal cluster number, which is often difficult to obtain in practice. Besides, satisfying the must-link constraints is…