Results 11 to 20 of about 481 (193)
On Efficient Presentations of the Groups PSL $(2, m)$ [PDF]
We exhibit presentations of the Von Dyck groups $D(2, 3, m), \ m\ge 3$, in terms of two generators of order $m$ satisfying three relations, one of which is Artin's braid relation. By dropping the relation which fixes the order of the generators we obtain
Orlin Stoytchev
doaj +1 more source
Coherent Presentations of Monoidal Categories [PDF]
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms.
Pierre-Louis Curien, Samuel Mimram
doaj +1 more source
PRESENTATIONS OF AFFINE KAC–MOODY GROUPS
How many generators and relations does $\text{SL}\,_{n}(\mathbb{F}_{q}[t,t^{-1}])$ need? In this paper we exhibit its explicit presentation with $9$ generators and $44$ relations. We investigate presentations of affine Kac–Moody groups over finite fields.
INNA CAPDEBOSCQ +2 more
doaj +1 more source
Presentations of topological full groups by generators and relations
Let \((\Omega,T)\) be a minimal subshift over a finite alphabet: \(\Omega\) is a closed subset of \(X^{\mathbb Z}\) for a finite alphabet \(X\), invariant under the shift map \(T\), and minimal under these conditions. The associated \textit{topological full group} is the group of self-homeomorphisms of \(\Omega\) that are piecewise powers of \(T\).
Grigorchuk, Rostislav, Medynets, Kostya
openaire +3 more sources
The (CO)homology of groups given by presentations in which each defining relator involves at most two types of generators [PDF]
AbstractOur set-up will consist of the following: (i) a graph with vertex set V and edge set E; (ii) for each vertex ∈ V a non-trivial group Gv given by a presentation (xν; rν); (iii) for each edge e = {u, ν} ∈ E a group Ge given by a presentation (xu, xv; re) where re consists of the elements of ru ∪ rv, together with some further words on xu ∪ xv. We
openaire +2 more sources
Presentations of Topological Full Groups by Generators and Relations
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.
Grigorchuk, Rostislav +1 more
openaire +2 more sources
Digraph Groups Without Leaf Having An Arc Count One Greater Than Their Vertex
This paper investigates a particular class of digraph groups that are defined by non-empty balanced presentations. Each relation is expressed in the form R(x,y), where x and y are distinct generators, and R(⋅,⋅) is based on a fixed cyclically reduced ...
Mehmet Sefa Cihan
doaj +1 more source
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source
This article presents the NFDI‐MatWerk Ontology (MWO), a Basic Formal Ontology‐based framework for interoperable research data management in materials science and engineering (MSE). Covering consortium structures, research data management resources, services, and instruments, MWO enables semantic integration, Findable, Accessible, Interoperable, and ...
Hossein Beygi Nasrabadi +4 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cihan, Mehmet Sefa, Williams, Gerald
openaire +2 more sources

