English
Related papers

Related papers: The kappa-word problem over DRH

200 papers

We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…

Logic · Mathematics 2013-06-28 Luca Motto Ros

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

Discrete Mathematics · Computer Science 2025-09-19 Paul C. Bell , Reino Niskanen , Igor Potapov , Pavel Semukhin

We prove that for lambda = beta_omega or just lambda strong limit singular of cofinality aleph_0, if there is a universal member in the class K^lf_lambda of locally finite groups of cardinality lambda, then there is a canonical one…

Logic · Mathematics 2023-03-08 Saharon Shelah

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

We show that if $\mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $\mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the…

Group Theory · Mathematics 2019-03-07 Alfredo Costa , Ana Escada

We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be…

Logic · Mathematics 2007-05-23 Andreas Blass , Saharon Shelah

We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous…

Formal Languages and Automata Theory · Computer Science 2020-07-30 Paul C. Bell

If $G$ is a connected semisimple Lie group with finite center and $K$ is a maximal compact subgroup of G, then the Lie algebra of $G$ admits a Cartan decomposition $\mathfrak{g}=\mathfrak{k}\oplus\mathfrak{p}$. This allows us to define the…

Group Theory · Mathematics 2026-03-25 Guillaume Dumas

Various practical problems within the class $\Sigma_{2}^P$ possess an unambiguity property, meaning that yes-instances correspond with a unique witness. The semantic class containing all unambiguous $\Sigma_{2}^P$ problems is denoted…

Computational Complexity · Computer Science 2026-04-02 Matan Gilboa , Paul W. Goldberg , Elias Koutsoupias , Noam Nisan

Given a group \( G \), a field \( \kappa \), and a factor set \( \sigma \) arising from a partial projective \( \kappa \)-representation of \( G \). This leads to the construction of a topological partial dynamical system \( (\Omega_\sigma,…

Rings and Algebras · Mathematics 2024-11-18 Mikhailo Dokuchaev , Emmanuel Jerez

It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary…

Logic · Mathematics 2024-05-15 Vladimir E. Karpov

The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group has context-free co-word problem. We use this method to…

Group Theory · Mathematics 2007-05-23 Joerg Lehnert , Pascal Schweitzer

We investigate the automorphisms of some $\kappa$- existentially closed groups. In particular, we prove that $Aut(G)$ is the union of subgroups of level preserving automorphisms and $|Aut(G)|=2^{\kappa}$ whenever $\kappa$ is inaccessible…

Group Theory · Mathematics 2021-01-01 Burak Kaya , Mahmut Kuzucuoğlu

All ultrafilters under consideration here are non-principal ultrafilters on the set omega of natural numbers. We are concerned with the possible cofinalities of ultrapowers of omega with respect to such ultrafilters. We show that no…

Logic · Mathematics 2016-09-06 Andreas Blass , Heike Mildenberger

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

We give a survey of some recent results on the fusion semirings of compact quantum groups (computations of and applications to discrete quantum groups) by using the following simplifying terminology: we say that a compact quantum group G is…

Quantum Algebra · Mathematics 2007-05-23 Teodor Banica

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

Formal Languages and Automata Theory · Computer Science 2011-02-22 A. N. Plyushchenko , A. M. Shur

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer

These notes contain an introduction to the theory of complex semisimple quantum groups. Our main aim is to discuss the classification of irreducible Harish-Chandra modules for these quantum groups, following Joseph and Letzter. Along the…

Quantum Algebra · Mathematics 2020-09-29 Christian Voigt , Robert Yuncken

We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also…

Quantum Physics · Physics 2007-05-23 Carlos Magno M. Cosme , Renato Portugal