Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1102.1525

Existence and Distribution of Solutions of a^x = b modulo p^n

Rupali Khedkar
View original source ↗Read source document ↗Export metadata ↓

Abstract

Initial objective of this dissertation is to study the existence of the solutions of the congruence a^x = b^y (mod p^n) and distribution of solutions (x, y) as n varies in natural numbers, where a and b are integers coprime to prime p. We observe that as n tends to infinity, solutions take the form of p-adic integers. This motivates us, to study the existence of the solutions of equation a^x = b in p-adic integers. The relevant case is when a and b are units in p-adic integers. If the solution exists we try to find it out. We resolve the case of a, b in U_1 completely. A necessary and sufficient condition for the existence of the solution of a^x = b where a, b are elements of U_1, is `valuation of a-1 is smaller than the valuation of b-1'. In this case, if the solution exists then it is given by log b / log a. In the other case, where a and b are p-adic units but not elements of U_1, we give the criteria for the existence of the solution of a^x = b. Write a and b as product of Teichmuller unit and an element of U_1. Suppose a= a_1 a_2 and b = b_1 b_2 where a_1, b_1 are Teichmuller units and a_2, b_2 are in U_1. Then the solution of a^x = b exists if b_1 belongs to the group generated by a_1 and valuation of a_2 - 1 is smaller than the valuation of b_2 -1.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rupali Khedkar. 2011-02-08. Existence and Distribution of Solutions of a^x = b modulo p^n. https://arxiv.org/abs/1102.1525

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Measures on Wreath Products II

Every word $w$ in $F_r$, the free group of rank $r$, induces a probability measure (the $w$-measure) on every finite group $G$, by substitution of random $G$-elements in the letters. This measure is determined by its Fourier coefficients: the $w$-expectations $E_w[χ]$ of the irreducible characters of $G$. For every finite group $G$, every stable character $χ$ of $G\wr S_n$ (trace of a finitely generated $FI_G$-module), and every word $w\in F_r$, we approximate $E_w[χ]$ up to an error term of $O(n^{-π(w)})$, where $π(w)$ is the primitivity rank of $w$. This generalizes previous works by Puder, Hanany, Magee and the author. As an application we show that random Schreier graphs of representation-stable actions of $G\wr S_n$ are close-to-optimal expanders. The paper reveals a surprising relation between stable representation theory of wreath products and not-necessarily connected Stallings core graphs.

math.GR↗
arXiv2026

Robust quasi-isometric embeddings inapproximable by Anosov representations

Let $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. For all but finitely many $m\in \mathbb{N}$, we exhibit the first examples of non-locally rigid, Zariski dense, robust quasi-isometric embeddings of hyperbolic groups in $\mathsf{SL}_m(\mathbb{K})$ which are not limits of Anosov representations. As a consequence, we show that higher rank analogues of Sullivan's structural stabilty theorem and of the density theorem for Kleinian groups fail for Anosov representations in $\mathsf{SL}_m(\mathbb{C}), m\geq 30$.

math.GR↗
arXiv2026

$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products

We provide a necessary and sufficient condition for the restricted wreath product $A\wr B$ to be $\mathcal{C}$-hereditarily conjugacy separable where $\mathcal{C}$ is an extension-closed pseudovariety of finite groups. Moreover, we prove that the Grigorchuk group is 2-hereditarily conjugacy separable. As an application, we demonstrate that the lamplighter groups and $\mathbb{Z} \wr \mathbb{Z}$ are hereditarily conjugacy separable (but not $p$-conjugacy separable for any prime $p$). This provides infinitely many new examples of solvable, non-polycyclic hereditarily conjugacy separable groups. Furthermore, we study wreath products of cyclic subgroup separable groups and the derived length of iterated wreath products of solvable groups with an abelian base group and, as an application, we give an explicit construction of non-polycyclic hereditarily conjugacy separable groups of arbitrary derived length as iterated wreath products of abelian groups.

math.GR↗