TOPOLOGICAL PROPERTIES OF CYCLICALLY PRESENTED GROUPS

2003 ◽  
Vol 12 (02) ◽  
pp. 243-268 ◽  
Author(s):  
ALBERTO CAVICCHIOLI ◽  
DUŠAN REPOVŠ ◽  
FULVIA SPAGGIARI
Keyword(s):  
Finite Volume ◽  
High Dimensional ◽  
Fundamental Groups ◽  
Topological Properties ◽  
3 Dimensional ◽  
Hnn Extensions ◽  
Finite Set ◽  
Split Extensions

We introduce a family of cyclic presentations of groups depending on a finite set of integers. This family contains many classes of cyclic presentations of groups, previously considered by several authors. We prove that, under certain conditions on the parameters, the groups defined by our presentations cannot be fundamental groups of closed connected hyperbolic 3–dimensional orbifolds (in particular, manifolds) of finite volume. We also study the split extensions and the natural HNN extensions of these groups, and determine conditions on the parameters for which they are groups of 3–orbifolds and high–dimensional knots, respectively.

HNN EXTENSION OF CYCLICALLY PRESENTED GROUPS

2001 ◽  
Vol 10 (08) ◽  
pp. 1269-1279 ◽  
Author(s):  
ANDRZEJ SZCZEPAŃSKI ◽  
ANDREI VESNIN
Keyword(s):  
High Dimensional ◽  
Fundamental Groups ◽  
Codimension Two ◽  
Hnn Extensions ◽  
Hnn Extension

It is shown that if the defining word of a cyclically presented group is admissable then its natural HNN extension is the group of a high dimensional knot. As an example we define a family of cyclically presented groups which contains Sieradski groups, Fibonacci groups, and Gilbert-Howie groups. It is proven that HNN extensions of these groups are LOG groups and so, are fundamental groups of complements of codimension two closed orientable connected tamely embeded ℓ-dimensional manifolds (ℓ≥2).

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.

HIGH DIMENSIONAL KNOT GROUPS AND HNN EXTENSIONS OF THE FIBONACCI GROUPS

1998 ◽  
Vol 07 (04) ◽  
pp. 503-508 ◽  
Author(s):  
ANDRZEJ SZCZEPAŃSKI
Keyword(s):  
High Dimensional ◽  
New Class ◽  
Hnn Extensions

We shall present a new class of examples of high dimensional knot groups. All of them are HNN extensions of the Fibonacci groups. We give also some characterization of these groups.

scholarly journals A database framework for rapid screening of structure-function relationships in PFAS chemistry

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
An Su ◽  
Krishna Rajan
Keyword(s):  
Molecular Structure ◽  
Structure Function ◽  
Classification Criteria ◽  
Rapid Screening ◽  
High Dimensional ◽  
Visualization Tool ◽  
Classification Schemes ◽  
3 Dimensional ◽  
Data Framework ◽  
Fundamental Physical

AbstractThis paper describes a database framework that enables one to rapidly explore systematics in structure-function relationships associated with new and emerging PFAS chemistries. The data framework maps high dimensional information associated with the SMILES approach of encoding molecular structure with functionality data including bioactivity and physicochemical property. This ‘PFAS-Map’ is a 3-dimensional unsupervised visualization tool that can automatically classify new PFAS chemistries based on current PFAS classification criteria. We provide examples on how the PFAS-Map can be utilized, including the prediction and estimation of yet unmeasured fundamental physical properties of PFAS chemistries, uncovering hierarchical characteristics in existing classification schemes, and the fusion of data from diverse sources.

scholarly journals Projection Analysis Optimization for Human Transition Motion Estimation

2019 ◽  
Vol 2019 ◽  
pp. 1-9
Author(s):  
Wanyi Li ◽  
Feifei Zhang ◽  
Qiang Chen ◽  
Qian Zhang
Keyword(s):  
Video Game ◽  
Human Motion ◽  
High Dimensional ◽  
Dynamical Models ◽  
Excellent Performance ◽  
3 Dimensional ◽  
Latent Space ◽  
Projection Analysis ◽  
Low Dimensional ◽  
Working Efficiency

It is a difficult task to estimate the human transition motion without the specialized software. The 3-dimensional (3D) human motion animation is widely used in video game, movie, and so on. When making the animation, human transition motion is necessary. If there is a method that can generate the transition motion, the making time will cost less and the working efficiency will be improved. Thus a new method called latent space optimization based on projection analysis (LSOPA) is proposed to estimate the human transition motion. LSOPA is carried out under the assistance of Gaussian process dynamical models (GPDM); it builds the object function to optimize the data in the low dimensional (LD) space, and the optimized data in LD space will be obtained to generate the human transition motion. The LSOPA can make the GPDM learn the high dimensional (HD) data to estimate the needed transition motion. The excellent performance of LSOPA will be tested by the experiments.

A Note on Finite Dehn Fillings

1999 ◽  
Vol 42 (2) ◽  
pp. 149-154
Author(s):  
S. Boyer ◽  
X. Zhang
Keyword(s):  
Finite Volume ◽  
Hyperbolic Metric ◽  
Fundamental Groups ◽  
Dehn Fillings ◽  
Zero Class

AbstractLet M be a compact, connected, orientable 3-manifold whose boundary is a torus and whose interior admits a complete hyperbolic metric of finite volume. In this paper we show that if theminimal Culler-Shalen norm of a non-zero class in H1(∂M) is larger than 8, then the finite surgery conjecture holds for M. This means that there are at most 5 Dehn fillings of M which can yieldmanifolds having cyclic or finite fundamental groups and the distance between any slopes yielding such manifolds is at most 3.

scholarly journals Digital Topological Properties of an Alignment of Fixed Point Sets

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 921 ◽  
Author(s):  
Sang-Eon Han
Keyword(s):  
Fixed Point ◽  
Unsolved Problem ◽  
Fixed Point Theory ◽  
Point Theory ◽  
Digital Topology ◽  
Fundamental Groups ◽  
Topological Properties ◽  
Point Sets ◽  
Fixed Point Sets ◽  
Connected Spaces

The present paper investigates digital topological properties of an alignment of fixed point sets which can play an important role in fixed point theory from the viewpoints of computational or digital topology. In digital topology-based fixed point theory, for a digital image ( X , k ) , let F ( X ) be the set of cardinalities of the fixed point sets of all k-continuous self-maps of ( X , k ) (see Definition 4). In this paper we call it an alignment of fixed point sets of ( X , k ) . Then we have the following unsolved problem. How many components are there in F ( X ) up to 2-connectedness? In particular, let C k n , l be a simple closed k-curve with l elements in Z n and X : = C k n , l 1 ∨ C k n , l 2 be a digital wedge of C k n , l 1 and C k n , l 2 in Z n . Then we need to explore both the number of components of F ( X ) up to digital 2-connectivity (see Definition 4) and perfectness of F ( X ) (see Definition 5). The present paper addresses these issues and, furthermore, solves several problems related to the main issues. Indeed, it turns out that the three models C 2 n n , 4 , C 3 n − 1 n , 4 , and C k n , 6 play important roles in studying these topics because the digital fundamental groups of them have strong relationships with alignments of fixed point sets of them. Moreover, we correct some errors stated by Boxer et al. in their recent work and improve them (see Remark 3). This approach can facilitate the studies of pure and applied topologies, digital geometry, mathematical morphology, and image processing and image classification in computer science. The present paper only deals with k-connected spaces in DTC. Moreover, we will mainly deal with a set X such that X ♯ ≥ 2 .

scholarly journals C*-SIMPLE GROUPS: AMALGAMATED FREE PRODUCTS, HNN EXTENSIONS, AND FUNDAMENTAL GROUPS OF 3-MANIFOLDS

2011 ◽  
Vol 03 (04) ◽  
pp. 451-489 ◽  
Author(s):  
PIERRE DE LA HARPE ◽  
JEAN-PHILIPPE PRÉAUX
Keyword(s):  
Sufficient Conditions ◽  
Simple Groups ◽  
Fundamental Groups ◽  
Normal Subgroups ◽  
Free Products ◽  
Amalgamated Free Products ◽  
Hnn Extensions ◽  
Groups Acting On Trees ◽  
Jsj Decompositions ◽  
Fixed Point Sets

We establish sufficient conditions for the C*-simplicity of two classes of groups. The first class is that of groups acting on trees, such as amalgamated free products, HNN-extensions, and their nontrivial subnormal subgroups; for example normal subgroups of Baumslag–Solitar groups. The second class is that of fundamental groups of compact 3-manifolds, related to the first class by their Kneser–Milnor and JSJ decompositions. Much of our analysis deals with conditions on an action of a group Γ on a tree T which imply the following three properties: abundance of hyperbolic elements, better called strong hyperbolicity, minimality, both on the tree T and on its boundary ∂T, and faithfulness in a strong sense. An important step in this analysis is to identify automorphisms of T which are slender, namely such that their fixed-point sets in ∂T are nowhere dense for the shadow topology.

scholarly journals Large random simplicial complexes, I

2016 ◽  
Vol 08 (03) ◽  
pp. 399-429 ◽  
Author(s):  
A. Costa ◽  
M. Farber
Keyword(s):  
Probability Measure ◽  
Simplicial Complex ◽  
Parameter Space ◽  
Simplicial Complexes ◽  
High Dimensional ◽  
Topological Properties ◽  
Convex Domains ◽  
Dimensional Parameter ◽  
Random Simplicial Complexes ◽  
Simply Connected

In this paper we introduce and develop the multi-parameter model of random simplicial complexes with randomness present in all dimensions. Various geometric and topological properties of such random simplicial complexes are characterised by convex domains in the high-dimensional parameter space (rather than by intervals, as in the usual one-parameter models). We find conditions under which a multi-parameter random simplicial complex is connected and simply connected. Besides, we give an intrinsic characterisation of the multi-parameter probability measure. We analyse links of simplexes and intersections of multi-parameter random simplicial complexes and show that they are also multi-parameter random simplicial complexes.

Sign in / Sign up

Export Citation Format

Share Document