English
Related papers

Related papers: On semigroups with PSPACE-complete subpower member…

200 papers

Locally inverse semigroups are regular semigroups whose idempotents form pseudo-semilattices. We characterise the categories that correspond to locally inverse semigroups in the realm of Nambooripad's cross-connection theory. Further, we…

Group Theory · Mathematics 2021-10-19 P. A. Azeef Muhammed , M. V. Volkov , K. Auinger

The enhanced power graph $\mathcal P_e(S)$ of a semigroup $S$ is a simple graph whose vertex set is $S$ and two vertices $x,y \in S$ are adjacent if and only if $x, y \in \langle z \rangle$ for some $z \in S$, where $\langle z \rangle$ is…

Group Theory · Mathematics 2021-10-03 Sandeep Dalal , Jitender Kumar , Siddharth Singh

We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…

Rings and Algebras · Mathematics 2024-05-24 Cian O'Brien , Rachel Quinlan

This thesis is about trying to understand various aspects of partial symmetry using ideas from semigroup and category theory. In Chapter 2 it is shown that the left Rees monoids underlying self-similar group actions are precisely monoid…

Category Theory · Mathematics 2017-07-10 Alistair R. Wallis

Many natural optimization problems derived from $\sf NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objectives, as in interdiction, adversarial selection, and…

Computational Complexity · Computer Science 2026-02-16 Christoph Grüne , Berit Johannes , James B. Orlin , Lasse Wulf

In this paper we study complex representations of the factorpower $\fp(G,M)$ of a finite group $G$ acting on a finite set $M$. This includes the finite monoid $\FP$, which can be seen as a kind of a ``balanced'' generalization of the…

Representation Theory · Mathematics 2010-04-02 Volodymyr Mazorchuk

James' submodule theorem is a fundamental result in the representation theory of the symmetric groups and the finite general linear groups. In this note we consider a version of that theorem for a general finite group with a split…

Representation Theory · Mathematics 2017-12-06 Meinolf Geck

We consider membership problems for rational subsets of the semigroup of $2\times 2$ matrices over $\mathbb{Q}$. For a semigroup $M$, the rational subsets $\mathrm{Rat}(M)$ are defined as the sets accepted by NFAs whose transitions are…

Formal Languages and Automata Theory · Computer Science 2024-12-02 Volker Diekert , Igor Potapov , Pavel Semukhin

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

Group Theory · Mathematics 2007-07-19 Markus Lohrey , Benjamin Steinberg

Assume that $S$ is a semigroup generated by $\{x_1,...,x_n\}$, and let $\Uscr$ be the multiplicative free commutative semigroup generated by $\{u_1,...,u_n\}$. We say that $S$ is of \emph{$I$-typ}e if there is a bijection $v:\Uscr\r S$ such…

Quantum Algebra · Mathematics 2007-05-23 Tatiana Gateva-Ivanova , Michel Van den Bergh

We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…

Group Theory · Mathematics 2022-10-28 Ruiwen Dong

In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…

Number Theory · Mathematics 2025-05-29 Alexander Kalmynin

The spectra of recently constructed auxiliary matrices for the six-vertex model respectively the spin s=1/2 Heisenberg chain at roots of unity q^N=1 are investigated. Two conjectures are formulated both of which are proven for N=3 and are…

Mathematical Physics · Physics 2009-11-10 Christian Korff

A small part of real line which is very close to zero has rich combinatorial properties. The aim of this paper is to express and then prove some locally combinatorial concepts near a virtual idempotent by considering the…

Functional Analysis · Mathematics 2022-03-28 A. Pashapournia , M. A. Tootkaboni , D. Ebrahimi Bagha

The Deligne-Simpson problem in the multiplicative version is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\in SL(n,{\bf C})$ so that there exist irreducible $(p+1)$-tuples…

Algebraic Geometry · Mathematics 2007-05-23 Vladimir Petrov Kostov

This paper solves a long standing open problem of whether NP-complete problems could be solved in polynomial time on a deterministic Turing machine by showing that the indistinguishable binomial decision tree can be formed in a 3-SAT…

Computational Complexity · Computer Science 2018-01-31 Keum-Bae Cho

Given polynomials $f_0,\dots, f_k$ the Ideal Membership Problem, IMP for short, asks if $f_0$ belongs to the ideal generated by $f_1,\dots, f_k$. In the search version of this problem the task is to find a proof of this fact. The IMP is a…

Computational Complexity · Computer Science 2026-02-10 Andrei A. Bulatov , Akbar Rafiey

Let $G$ be a connected reductive group over a totally real field $F$ which is compact modulo center at archimedean places. We find congruences modulo an arbitrary power of p between the space of arbitrary automorphic forms on $G(\mathbb…

Number Theory · Mathematics 2021-07-01 Jessica Fintzen , Sug Woo Shin

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. The present work introduces and studies a real…

Logic in Computer Science · Computer Science 2007-05-23 Martin Ziegler , Klaus Meer

Recent results of Bourgain and Shparlinski imply that for almost all primes $p$ there is a multiple $mp$ that can be written in binary as $mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$ with $k=66$ or $k=16$, respectively.…

Number Theory · Mathematics 2019-02-20 Christian Elsholtz