English
Related papers

Related papers: The complexity of intersecting subproducts with su…

200 papers

We prove that the double covers of the alternating and symmetric groups are determined by their complex group algebras. To be more precise, let $n\geq 5$ be an integer, $G$ a finite group, and let $\AAA$ and $\SSS^\pm$ denote the double…

Representation Theory · Mathematics 2016-01-20 Christine Bessenrodt , Hung Ngoc Nguyen , Jørn B. Olsson , Hung P. Tong-Viet

Let $K$ be a field and $G$ be a finite group. Let $G$ act on the rational function field $K(x(g):g\in G)$ by $K$-automorphisms defined by $g\cdot x(h)=x(gh)$ for any $g,h\in G$. Denote by $K(G)$ the fixed field $K(x(g):g\in G)^G$. Noether's…

Algebraic Geometry · Mathematics 2013-09-04 Ivo M. Michailov

Let $K$ be a field and $G$ be a finite group. Let $G$ act on the rational function field $K(x(g):g\in G)$ by $K$ automorphisms defined by $g\cdot x(h)=x(gh)$ for any $g,h\in G$. Denote by $K(G)$ the fixed field $K(x(g):g\in G)^G$. Noether's…

Algebraic Geometry · Mathematics 2016-01-20 Ivo M. Michailov

The problem of determining when a (classical) crossed product $T=S^f*G$ of a finite group $G$ over a discrete valuation ring $S$ is a maximal order, was answered in the 1960's for the case where $S$ is tamely ramified over the subring of…

Rings and Algebras · Mathematics 2008-01-25 Yuval Ginosar

Let $\{G_i :i\in\N\}$ be a family of finite Abelian groups. We say that a subgroup $G\leq \prod\limits_{i\in \N}G_i$ is \emph{order controllable} if for every $i\in \mathbb{N}$ there is $n_i\in \mathbb{N}$ such that for each $c\in G$, there…

General Topology · Mathematics 2021-12-01 María V. Ferrer , Salvador Hernández

We study metabelian groups $G$ given by full rank finite presentations $\langle A \mid R \rangle_{\mathcal{M}}$ in the variety $\mathcal{M}$ of metabelian groups. We prove that $G$ is a product of a free metabelian subgroup of rank…

Group Theory · Mathematics 2020-06-12 Albert Garreta , Leire Legarreta , Alexei Miasnikov , Denis Ovchinnikov

According to Markov, a subset of an abelian group G of the form {x in G: nx=a}, for some integer n and some element a of G, is an elementary algebraic set; finite unions of elementary algebraic sets are called algebraic sets. We prove that…

Group Theory · Mathematics 2010-10-01 Dikran Dikranjan , Dmitri Shakhmatov

The subalgebra membership problem is the problem of deciding if a given element belongs to an algebra given by a set of generators. This is one of the best established computational problems in algebra. We consider a variant of this…

Logic in Computer Science · Computer Science 2023-06-22 Andrei Bulatov , Peter Mayr , Ágnes Szendrei

Let $G$ be a graph. A dominating set $D\subseteq V(G)$ is a super dominating set if for every vertex $x\in V(G) \setminus D$ there exists $y\in D$ such that $N_G(y)\cap (V(G)\setminus D)) = \{x\}$. The cardinality of a smallest super…

Combinatorics · Mathematics 2023-02-20 Csilla Bujtás , Nima Ghanbari , Sandi Klavžar

Let $G$ be an infinite abelian group with $|2G|=|G|$. We show that if $G$ is not the direct sum of a group of exponent 3 and the group of order 2, then $G$ possesses a perfect additive basis; that is, there is a subset $S\subseteq G$ such…

Number Theory · Mathematics 2009-01-13 Sergei V. Konyagin , Vsevolod F. Lev

We introduce and study the notion of the $G$-Tutte polynomial for a list $\mathcal{A}$ of elements in a finitely generated abelian group $\Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from…

Combinatorics · Mathematics 2021-09-03 Ye Liu , Tan Nhat Tran , Masahiko Yoshinaga

A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…

Computational Complexity · Computer Science 2009-12-15 Irénée Briquel , Pascal Koiran

The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…

Group Theory · Mathematics 2017-02-24 John Bamberg , Tomasz Popiel , Cheryl E. Praeger

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

Given a finite group $G$, we denote by $\psi\,'(G)$ the product of element orders of $G$. Our main result proves that the restriction of $\psi\,'$ to abelian $p$-groups of order $p^n$ is strictly increasing with respect to a natural order…

Group Theory · Mathematics 2018-05-24 Marius Tărnăuceanu

For a semisimple algebraic group $G$ of adjoint type with Lie algebra $\mathfrak g$ over the complex numbers, we establish a bijection between the set of closed orbits of the group $G \ltimes \mathfrak g^{\ast}$ acting on the variety of…

Representation Theory · Mathematics 2020-10-12 Sam Evens , Yu Li

Let G be a finite group. A subgroup M of G is said to be an NR-subgroup if, whenever K is normal in M, then K^G\cap M=K, where K^G is the normal closure of K in G. Using the Classification of Finite Simple Groups, we prove that if every…

Group Theory · Mathematics 2009-12-07 Hung P. Tong-Viet

Given a reduced analytic space $Y$ we introduce a class of {\it nice} cycles, including all effective $\mathbb{Q}$-Cartier divisors. Equidimensional nice cycles that intersect properly allow for a natural intersection product. Using…

Complex Variables · Mathematics 2021-12-22 Mats Andersson , Håkan Samuelsson Kalm

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete…

Computational Complexity · Computer Science 2013-09-06 Christian Herrmann , Johanna Sokoli , Martin Ziegler

Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_1,\ldots,a_k$. For bands (idempotent semigroups), we provide a…

Group Theory · Mathematics 2016-04-06 Markus Steindl
‹ Prev 1 4 5 6 7 8 10 Next ›