◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Bardakov

75 papers hereh-index 18908 citations105 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author1
  • first author74

Across the 75 of 75 papers where every author was matched, so the position is known.

fields
  • math.GR44
  • math.GT16
  • math.RA9
  • math.QA3
  • math.AT2
  • math.DS1
same name
  • V. Bardakov — 16 papers, h 11
  • V. Bardakov — 8 papers, h 7
  • V. Bardakov — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102026
most citedRota-Baxter groups, skew left braces, and the Yang-Baxter equation

51 citations · 254 across the 64 of their papers we have counts for

collaborators
Showing 2014Show all

4 papers · 1 filter

math.GR2014★ 10 cited

Palindromic Automorphisms of Free Groups

Valeriy G. Bardakov, Krishnendu Gongopadhyay, Mahender Singh

Let Fn​ be the free group of rank n with free basis X={x1​,…,xn​}. A palindrome is a word in X±1 that reads the same backwards as forwards. The palindromic aut…

math.GR2014

Upper central series for the group of unitriangular automorphisms of a free associative algebra

Valeriy G. Bardakov, Mikhail V. Neshchadim

We study some subgroups of the group of unitriangular automorphisms Un​ of a free associative algebra over a field of characteristic zero. We find the center of Un​ and describ…

math.GR2014★ 2 cited

On palindromic width of certain extensions and quotients of free nilpotent groups

Valeriy G. Bardakov, Krishnendu Gongopadhyay

In arXiv:1303.1129, the authors provided a bound for the palindromic width of free abelian-by-nilpotent group ANn​ of rank n and free nilpotent group Nn,r​ of rank $n…

math.GR2014

Palindromic Width of Finitely Generated Solvable Groups

Valeriy G. Bardakov, Krishnendu Gongopadhyay

We investigate the palindromic width of finitely generated solvable groups. We prove that every finitely generated 3-step solvable group has finite palindromic width. More genera…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.