scholarly journals Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem

2015 ◽  
Author(s):  
Volker Diekert ◽  
Alexei Myasnikov ◽  
Armin Weiß
Keyword(s):  
Conjugacy Problem ◽  
Schreier Graphs ◽  
Generic Algorithms

scholarly journals Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem

2017 ◽  
Vol 83 ◽  
pp. 147-165 ◽  
Author(s):  
Volker Diekert ◽  
Alexei G. Myasnikov ◽  
Armin Weiß
Keyword(s):  
Conjugacy Problem ◽  
Schreier Graphs ◽  
Generic Algorithms

scholarly journals Conjugacy Problem in the Fundamental Groups of High-Dimensional Graph Manifolds

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1330
Author(s):  
Raeyong Kim
Keyword(s):  
Group Structure ◽  
Conjugacy Problem ◽  
High Dimensional ◽  
Fundamental Groups ◽  
Graph Manifold ◽  
Solvable Word Problem ◽  
Algorithmic Problems ◽  
Graph Manifolds ◽  
Dimensional Graph ◽  
Solvable Word

The conjugacy problem for a group G is one of the important algorithmic problems deciding whether or not two elements in G are conjugate to each other. In this paper, we analyze the graph of group structure for the fundamental group of a high-dimensional graph manifold and study the conjugacy problem. We also provide a new proof for the solvable word problem.

scholarly journals Sharpness of KKL on Schreier graphs

2013 ◽  
Vol 18 (0) ◽  
Author(s):  
Ryan O'Donnell ◽  
Karl Wimmer
Keyword(s):  
Schreier Graphs

scholarly journals Generic Algorithms for Scheduling Applications on Hybrid Multi-core Machines

2017 ◽  
pp. 220-231 ◽  
Author(s):  
Marcos Amaris ◽  
Giorgio Lucarelli ◽  
Clément Mommessin ◽  
Denis Trystram
Keyword(s):  
Generic Algorithms

scholarly journals Schreir graphs: Transitivity and coverings

2016 ◽  
Vol 26 (01) ◽  
pp. 69-93 ◽  
Author(s):  
Paul-Henry Leemann
Keyword(s):  
Hyperbolic Manifolds ◽  
Rigidity Theorem ◽  
Partial Answer ◽  
Schreier Graphs

We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow’s rigidity theorem for hyperbolic manifolds. This allows us to give a transitivity criterion for Schreier graphs. Finally, we show that Tarski monsters satisfy a strong simplicity criterion. This gives a partial answer to a question of Benjamini and Duminil-Copin.

The Novel Approach

2017 ◽  
pp. 1-12
Keyword(s):  
Risk Management ◽  
Project Management ◽  
Quality Management ◽  
Portfolio Management ◽  
Six Sigma ◽  
The Novel ◽  
Mathematical Concepts ◽  
Process Flow ◽  
Novel Approach ◽  
Generic Algorithms

This chapter presents the novel Six Sigma DMAIC generic approach to Risk Management. The method is introduced first. In The Generic Approach and Algorithms section, generic mathematical concepts are elaborated. Also, four generic classes of applications of the proposed method are identified including: 1) Portfolio Management; 2) Quality Management; 3) Project Management; and 4) Income Management. Furthermore, four generic algorithms are elaborated for the respective four classes of application of the method. The generic algorithms include description and process flow of the applications. Finally, the modelling tools used in the book's elaborations are detailed, as well as references for how to use these tools and run Simulation and Stochastic Optimisation step-by-step.

A Generic Guide for Using Membrane Computing in Robot Control

2017 ◽  
pp. 86-96
Keyword(s):  
Operating Systems ◽  
Membrane Computing ◽  
Task Complexity ◽  
Future Research ◽  
Research Directions ◽  
Robot Controller ◽  
Swarm Algorithms ◽  
Future Research Directions ◽  
High Level ◽  
Generic Algorithms

As various theoretical and practical details of using membrane computing models have been presented throughout the book, certain details might be hard to find at a later time. For this reason, this chapter provides the reader with a set of checkmark topics that a developer should address in order to implement a robot controller using a membrane computing model. The topics discussed address areas such as: (1) robot complexity, (2) number of robots, (3) task complexity, (4) simulation versus real world execution, (5) sequential versus parallel implementations. This chapter concludes with an overview of future research directions. These directions offer possible solutions for several important concerns: the development of complex generic algorithms that use a high level of abstraction, the design of swarm algorithms using a top-down (swarm-level) approach and ensuring the predictability of a controller by using concepts such as those used in real-time operating systems.

Sign in / Sign up

Export Citation Format

Share Document