相关论文: Detecting quasiconvexity: algorithmic aspects

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Fusion is defined for arbitrary lowest weight representations of $W$-algebras, without assuming rationality. Explicit algorithms are given. A category of quasirational representations is defined and shown to be stable under fusion.…

For relatively hyperbolic groups, we investigate conditions guaranteeing that the subgroup generated by two quasiconvex subgroups $Q$ and $R$ is quasiconvex and isomorphic to $Q \ast_{Q\cap R} R$. Our results generalized known combination…

Quantum algorithms for factoring and discrete logarithm have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the possibility of extending this general viewpoint to finding hidden…

The given study uses the methods to identify compactifications of semigroups $S\subset L(X),$ which reside in the space $L(X).$ This method generalizes in some sense the deLeeuw-Glicksberg-Theory to a greater class of functions. The…

The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…

We consider the problem of constructing matched groups such that the resulting groups are statistically similar with respect to their average values for multiple covariates. This group-matching problem arises in many cases, including…

Let G be an arithmetic lattice in a semisimple algebraic group over a number field. We show that if G has the congruence subgroup property, then the number of n-dimensional irreducible representations of G grows like n^a, where a is a…

We provide a new and elegant approach to relative quasiconvexity for relatively hyperbolic groups in the context of Bowditch's approach to relative hyperbolicity using cocompact actions on fine hyperbolic graphs. Our approach to…

We review the broad variety of methods that have been proposed for anomaly detection in images. Most methods found in the literature have in mind a particular application. Yet we show that the methods can be classified mainly by the…

In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The…

In this work we obtain the general form of polynomial mappings that commute with a linear action of a relative symmetry group. The aim is to give results for relative equivariant polynomials that correspond to the results for relative…

Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…

Let G be a group and H be a subgroup of G. We say that H is left relatively convex in G if the left G-set G/H has at least one G-invariant order; when G is left orderable, this holds if and only if H is convex in G under some left ordering…

We prove the existence of a regular semigroup F(X) weakly generated by X such that all other regular semigroups weakly generated by X are homomorphic images of F(X). The semigroup F(X) is introduced by a presentation and the word problem…

Ideal series of semigroups play an important role in the examination of semigroups which have proper two-sided ideals. But the corresponding theorems cannot be used when left simple (or right simple or simple) semigroups are considered. So…

An usual problem in statistics consists in estimating the minimizer of a convex function. When we have to deal with large samples taking values in high dimensional spaces, stochastic gradient algorithms and their averaged versions are…

We show that every unitary representation of a solvable discrete virtually nilpotent group G is quasidiagonal. Roughly speaking, this says that every unitary representation of G approximately decomposes as a direct sum of finite dimensional…

In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours,…

This paper focuses on the identification of different algorithm-based biases in robotic behaviour and their consequences in human-robot mixed groups. We propose to develop computational models to detect episodes of microaggression,…