Results 11 to 20 of about 2,987,816 (307)
On the algebraic K- and L-theory of word hyperbolic groups [PDF]
Mathematische Annalen, 2005 In this paper, the assembly maps in algebraic K- and L-theory for the family of finite subgroups are proven to be split injections for word hyperbolic groups. This is done by analyzing the compactification of the Rips complex by the boundary of a word hyperbolic group.
David Rosenthal, Dirk Schütz
openalex +4 more sources
ANTECEDENTS AND TARGET GROUPS OF WORD-OF-MOUTH COMMUNICATION OF PRICES: THEORY AND NEW EMPIRICAL RESULTS [PDF]
Journal of International Business and Economics, 2013 Kevin Lexis +2 more
openalex +3 more sources
The weight of cognitions in panic: the link between misinterpretations and panic attacks. [PDF]
PLoS ONE, 2013 In cognitive theory it is hypothesized that panic attacks are provoked by catastrophic misinterpretations of bodily sensations. The aim of the present study was to investigate the ability of associated word pairs referring to catastrophic thinking (e.g ...
Klara De Cort +5 more
doaj +1 more source
Comparative Analysis of Using Word Embedding in Deep Learning for Text Classification
Jurnal Riset Informatika, 2023 A group of theory-driven computing techniques known as natural language processing (NLP) are used to interpret and represent human discourse automatically.
Mukhamad Rizal Ilham, Arif Dwi Laksito
doaj +1 more source
Sub-Finsler Horofunction Boundaries of the Heisenberg Group
Analysis and Geometry in Metric Spaces, 2021 We give a complete analytic and geometric description of the horofunction boundary for polygonal sub-Finsler metrics, that is, those that arise as asymptotic cones of word metrics, on the Heisenberg group.
Fisher Nate, Golo Sebastiano Nicolussi
doaj +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
Combien d’acceptions le mot keuz ‘regret’ a-t-il ?
La Bretagne Linguistique, 2014 In this article, we present the criteria for distinguishing the different meanings of a polysemous word. This preliminary differentiation process – or lexemisation – is essential for compiling a description of a word in a dictionary. We use as an example
François Louis, Jasmina Milićević
doaj +1 more source
Communications in Algebra, 2024, 2023 A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are achiral or not. We will prove that it is enough to apply Whitehead's algorithm to check the same.
arxiv +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