Group word terms in the terminology of the theory of mechanics in Albanian and English
, 2020 As it is known, the terminology of any knowledge eld as an independent system, as well as the terminology of mechanics consisting of nominating one-word and group word units (among which, particularly the latter phrase terms) make up nearly 70-80% of ...
Gani Pllana, Sadete Pllana
openalex +3 more sources
An Algorithmic Solution for a Word Problem in Group Theory [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 1964 N. S. Mendelsohn
openalex +2 more sources
Correction To: An Algorithmic Solution for a Word Problem in Group Theory [PDF]
Canadian Journal of Mathematics - Journal Canadien de Mathematiques, 1965 N. S. Mendelsohn
openalex +2 more sources
Word measures on GLn(q) and free group algebras [PDF]
Algebra & Number Theory, 2021 Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating $w\left(g_1,\ldots ...
Danielle Ernst-West +2 more
semanticscholar +1 more source
Glassy Word Problems: Ultraslow Relaxation, Hilbert Space Jamming, and Computational Complexity [PDF]
Physical Review X, 2023 We introduce a family of local models of dynamics based on “word problems” from computer science and group theory, for which we can place rigorous lower bounds on relaxation timescales.
Shankar Balasubramanian +3 more
semanticscholar +1 more source
High-precision RNS-CKKS on fixed but smaller word-size architectures: theory and application
IACR Cryptology ePrint Archive, 2023 A prevalent issue in the residue number system (RNS) variant of the Cheon-Kim-Kim-Song (CKKS) homomorphic encryption (HE) scheme is the challenge of efficiently achieving high precision on hardware architectures with a fixed, yet smaller, word-size of ...
Rashmi Agrawal +13 more
semanticscholar +1 more source
Applications of L systems to group theory [PDF]
International journal of algebra and computation, 2017 L systems generalise context-free grammars by incorporating parallel rewriting, and generate languages such as EDT0L and ET0L that are strictly contained in the class of indexed languages.
L. Ciobanu, M. Elder, Michal Ferov
semanticscholar +1 more source
An Automaton Group with PSPACE-Complete Word Problem [PDF]
Theory of Computing Systems, 2019 We construct an automaton group with a PSPACE -complete word problem, proving a conjecture due to Steinberg. Additionally, the constructed group has a provably more difficult, namely EXPSPACE -complete, compressed word problem and acts over a binary ...
Jan Philipp Wächter, A. Weiss
semanticscholar +1 more source
Random Operator Approach for Word Enumeration in Braid Groups [PDF]
, 1997 We investigate analytically the problem of enumeration of nonequivalent primitive words in the braid group B_n for n >> 1 by analysing the random word statistics and the target space on the basis of the locally free group approximation.
Alain Comtet +35 more
core +3 more sources
Real Computational Universality: The Word Problem for a class of groups with infinite presentation [PDF]
, 2006 The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem.
Meer, Klaus, Ziegler, Martin
core +4 more sources