Related papers: Detecting quasiconvexity: algorithmic aspects
The subsystem compatibility problem, which concerns the question of whether a set of subsystem states are compatible with a state of the entire system, has received much study. Here we attack the problem from a new angle, utilising the…
We answer the question asked by Louder, McReynolds and Patel, and prove the following statement. Let L be a RAAG, H a word quasiconvex subgroup of L, then there is a finite dimensional representation of L that separates the subgroup H in…
This paper studies linear stochastic approximation (SA) algorithms and their application to multi-agent systems in engineering and sociology. As main contribution, we provide necessary and sufficient conditions for convergence of linear SA…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
We introduce and discuss, through a computational algebraic geometry approach, the automatic reasoning handling of propositions that are simultaneously true and false over some relevant collections of instances. A rigorous, algorithmic…
With the recent advances in complex networks theory, graph-based techniques for image segmentation has attracted great attention recently. In order to segment the image into meaningful connected components, this paper proposes an image…
In an ordinary feature selection procedure, a set of important features is obtained by solving an optimization problem such as the Lasso regression problem, and we expect that the obtained features explain the data well. In this study,…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
This paper presents a novel architecture to detect social groups in real-time from a continuous image stream of an ego-vision camera. F-formation defines social orientations in space where two or more person tends to communicate in a social…
Complex real-world networks commonly reveal characteristic groups of nodes like communities and modules. These are of value in various applications, especially in the case of large social and information networks. However, while numerous…
The general form of the operators commuting with the ground representation (appearing in many physical problems within single particle approximation) of the group is found. With help of the modified group projector technique, this result is…
The community deception problem is about how to hide a target community C from community detection algorithms. The need for deception emerges whenever a group of entities (e.g., activists, police enforcements) want to cooperate while…
Group counterfactual explanations find a set of counterfactual instances to explain a group of input instances contrastively. However, existing methods either (i) optimize counterfactuals only for a fixed group and do not generalize to new…
Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…
The idea of partial smoothness in optimization blends certain smooth and nonsmooth properties of feasible regions and objective functions. As a consequence, the standard first-order conditions guarantee that diverse iterative algorithms…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
We present a general framework that reveals substructures of genuine multipartite entanglement. Via simple inequalities it is possible to discriminate different sets of multipartite qubit states. These inequalities are beneficial regarding…