English
Related papers

Related papers: On the Complexity of the Cayley Semigroup Membersh…

200 papers

We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer.

Quantum Physics · Physics 2023-11-27 Martin Roetteler , Thomas Beth

Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…

Commutative Algebra · Mathematics 2024-09-11 J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

Group Theory · Mathematics 2017-05-25 Nikolay Nikolov , Jakob Schneider , Andreas Thom

A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…

Group Theory · Mathematics 2024-11-26 Trevor Jack

We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply…

Group Theory · Mathematics 2007-05-23 Thomas Michael Keller

Let $G$ be a simple algebraic group over an algebraically closed field and let $X$ be an irreducible subvariety of $G^r$ with $r \geqslant 2$. In this paper, we consider the general problem of determining if there exists a tuple $(x_1,…

Group Theory · Mathematics 2023-10-16 Timothy C. Burness , Spencer Gerhardt , Robert M. Guralnick

It is a recent observation that entanglement classification for qubits is closely related to local $SL(2,\CC)$-invariants including the invariance under qubit permutations, which has been termed $SL^*$ invariance. In order to single out the…

Quantum Physics · Physics 2009-04-06 Andreas Osterloh , Dragomir Z. Djokovic

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

Group Theory · Mathematics 2025-08-19 Tao Feng , Cai Heng Li , Conghui Li , Lei Wang , Binzhou Xia , Hanlin Zou

The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…

Combinatorics · Mathematics 2021-04-12 Bogdan Alecu , Aistis Atminas , Vadim Lozin , Dmitriy Malyshev

The class P is in fact a proper sub-class of NP. We explore topological properties of the Hamming space 2^[n] where [n]={1, 2,..., n}. With the developed theory, we show: (i) a theorem that is closely related to Erdos and Rado's sunflower…

Computational Complexity · Computer Science 2013-10-23 Junichiro Fukuyama

A semigroup $\langle C\rangle$ in $\mathbb{N}^n$ is a gluing of $\langle A\rangle$ and $\langle B\rangle$ if its finite set of generators $C$ splits into two parts, $C=k_1A\sqcup k_2B$ with $k_1,k_2\geq 1$, and the defining ideals of the…

Commutative Algebra · Mathematics 2022-02-03 Philippe Gimenez , Hema Srinivasan

Let $G$ be a finite group and $P$ a Sylow $2$-subgroup of $G$. We obtain both asymptotic and explicit bounds for the number of odd-degree irreducible complex representations of $G$ in terms of the size of the abelianization of $P$. To do…

Group Theory · Mathematics 2020-08-28 Nguyen Ngoc Hung , Thomas Michael Keller , Yong Yang

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Alexei Myasnikov , Paul Schupp , Vladimir Shpilrain

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

Group Theory · Mathematics 2025-07-22 Philip Easo , Tom Hutchcroft

We examine the phenomenon of capitulation of the $p$-class group $H_K$ of a real number field $K$ in totally ramified cyclic p-extensions $L/K$ of degree $p^N$. Using an elementary property of the algebraic norm $\nu_{L/K}$, we show that…

Number Theory · Mathematics 2025-09-09 Georges Gras

Let $K/\mathbb{Q}$ be a finitely generated field of characteristic zero and $X/K$ a smooth projective variety. Fix $q\in\mathbb{N}$. For every prime number $\ell$ let $\rho_\ell$ be the representation of $\mathrm{Gal}(K)$ on the \'etale…

Algebraic Geometry · Mathematics 2017-01-18 Sebastian Petersen

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

Data Structures and Algorithms · Computer Science 2019-10-29 Giannis Nikolentzos , Michalis Vazirgiannis

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…

Number Theory · Mathematics 2016-08-31 J. I. García-García , D. Marín-Aragón , A. Vigneron-Tenorio

Let $G$ be a compact Lie group. We introduce a semiclassical framework, called Borel-Weil calculus, to investigate $G$-equivariant (pseudo)differential operators acting on $G$-principal bundles over closed manifolds. In this calculus, the…

Analysis of PDEs · Mathematics 2024-09-30 Mihajlo Cekić , Thibault Lefeuvre

We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two…

Formal Languages and Automata Theory · Computer Science 2015-01-06 Thomas Place , Marc Zeitoun