中文
相关论文

相关论文: Word maps and Waring type problems

200 篇论文

In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…

群论 · 数学 2019-08-27 Carmelo Vaccaro

We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…

群论 · 数学 2014-02-26 Claire Wladis

We address the Noncommutative Noether's Problem on the invariants of Weyl fields for linear actions of finite groups. We prove that if the variety An(k)/G is rational then the Noncommutative Noether's Problem is positively solved for G and…

环与代数 · 数学 2018-11-30 Vyacheslav Futorny , João Schwarz

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…

群论 · 数学 2013-01-18 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…

数论 · 数学 2021-08-25 Ben Green

An abelian anti-power of order $k$ (or simply an abelian $k$-anti-power) is a concatenation of $k$ consecutive words of the same length having pairwise distinct Parikh vectors. This definition generalizes to the abelian setting the notion…

组合数学 · 数学 2019-03-26 Gabriele Fici , Mickael Postic , Manuel Silva

According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…

计算复杂性 · 计算机科学 2025-05-29 Pranjal Dutta , Fulvio Gesmundo , Christian Ikenmeyer , Gorav Jindal , Vladimir Lysikov

We prove new complexity results for computational problems in certain wreath products of groups and (as an application) for free solvable group. For a finitely generated group we study the so-called power word problem (does a given…

群论 · 数学 2024-12-03 Michael Figelius , Moses Ganardi , Markus Lohrey , Georg Zetzsche

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple…

群论 · 数学 2020-09-23 Michael Larsen

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

数论 · 数学 2020-03-23 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

To an arbitrary variety over a field of characteristic zero, we associate a complex of Chow motives, which is, up to homotopy, unique and bounded. We deduce that any variety has a natural Euler characteristic in the Grothendieck group of…

alg-geom · 数学 2008-02-03 Henri Gillet , Christophe Soule

The power word problem for a group $G$ asks whether an expression $u_1^{x_1} \cdots u_n^{x_n}$, where the $u_i$ are words over a finite set of generators of $G$ and the $x_i$ binary encoded integers, is equal to the identity of $G$. It is a…

群论 · 数学 2023-01-13 Markus Lohrey , Florian Stober , Armin Weiß

Construct recursively a long string of words w1. .. wn, such that at each step k, w k+1 is a new word with a fixed probability p $\in$ (0, 1), and repeats some preceding word with complementary probability 1 -- p. More precisely, given a…

概率论 · 数学 2019-06-26 Jean Bertoin

Waring problem for homogeneus forms asks for additive decomposition of a form $f$ into powers of linear forms. A classical problem is to determine when such a decomposition is unique. In this note I refine the work in arXiv:math/0406288v1…

代数几何 · 数学 2007-11-01 M. Mella

The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…

群论 · 数学 2007-05-23 S. Kaplan , M. Teicher

Let $r$ be a nonconstant noncommutative rational function in $m$ variables over an algebraically closed field $K$ of characteristic 0. We show that for $n$ large enough, there exists an $X\in M_n(K)^m$ such that $r(X)$ has $n$ distinct and…

环与代数 · 数学 2025-07-25 Matej Brešar , Jurij Volčič

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…

群论 · 数学 2007-05-23 Ilya Kapovich , Alexei Myasnikov , Paul Schupp , Vladimir Shpilrain

In this paper it is stressed that there is no {\em physical} reason for symmetries to be linear and that Lie group theory is therefore too restrictive. We illustrate this with some simple examples. Then we give a readable review on the…

高能物理 - 理论 · 物理学 2008-11-26 Jan de Boer , Frederique Harmsze , Tjark Tjin