◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Mukhamedov

124 papers hereh-index 273.2k citations401 works total

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

author position
  • sole author13
  • first author64
  • middle author15
  • last author31

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

fields
  • math.FA33
  • math-ph33
  • math.DS20
  • math.OA15
  • math.NT4
  • math.RA4
same name
  • F. Mukhamedov — 9 papers, h 1
  • F. Mukhamedov — 6 papers, h 10

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
20052026
most citedOn p-adic Gibbs measures of countable state Potts model on the Cayley tree

57 citations · 887 across the 117 of their papers we have counts for

collaborators
Showing math.NTShow all

4 papers · 1 filter

math.NT2019★ 28 cited

P-adic monomial equations and their perturbation

Farrukh Mukhamedov, Otabek Khakimov

In this paper, we describe the set of all solutions of monomial equation xk=a over Qp​. Moreover, as an application of the result, we study several perturbations of th…

math.NT2012★ 5 cited

On cubic equations over P−adic field

Farrukh Mukhamedov, Bakhrom Omirov, Mansoor Saburov

We provide a solvability criteria for a depressed cubic equation in domains $\bz_p^{*},\bz_p,\bq_p$. We show that, in principal, the Cardano method is not always applicable for suc…

math.NT2011★ 37 cited

On equation xq=a over $\bq_p$

Farrukh Mukhamedov, Mansoor Saburov

In this paper we provide a solvability criterion for the monomial equation xq=a over Qp​ for any natural number q.

math.NT2010★ 1 cited

Single Polygon Counting for m Fixed Nodes in Cayley Tree: Two Extremal Cases

Farrukh Mukhamedov, Chin Hee Pah, Mansoor Saburov

We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two c…

◍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.