Related papers: A Division Algorithm Approach to $p$-Adic Sylveste…
In this note, basing on a certain functional equation of the dilogarithm function, we establish nontrivial lower bounds for the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers involving harmonic…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
Following Schweiger's generalization of multidimensional continued fraction algorithms, we consider a very large family of $p$-adic multidimensional continued fraction algorithms, which include Schneider's algorithm, Ruban's algorithms, and…
The greedy algorithm A iterates over a set of uniformly sized independent sets of a given graph G and checks for each set S which non-neighbor of S, if any, is best suited to be added to S, until no more suitable non-neighbors are found for…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
Consider the puzzle: given a number, remove $k$ digits such that the resulting number is as large as possible. Various techniques were employed to derive a linear-time solution to the puzzle: predicate logic was used to justify the…
The classical theory of continued fractions has been widely studied for centuries for its important properties of good approximation, and more recently it has been generalized to $p$-adic numbers where it presents many differences with…
A rational number is dyadic if it has a finite binary representation $p/2^k$, where $p$ is an integer and $k$ is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in…
In this paper, we improve some transcendence results for $p$--adic continued fractions. In particular, we prove that palindromic and quasi--periodic $p$--adic continued fractions converge either to transcendental numbers or quadratic…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…
This note studies, and partially solves, 3 elementary questions about continuous rational functions on real (and p-adic) algebraic varieties: Can one restrict such a function to a subvariety? Can one extend such a function from a…
This paper proposes a greedy algorithm named as Big step greedy set cover algorithm to compute approximate minimum set cover. The Big step greedy algorithm, in each step selects p sets such that the union of selected p sets contains…
In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…
The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…
We construct a countable family of multi-dimensional continued fraction algorithms, built out of five specific multidimensional continued fractions, and find a wide class of cubic irrational real numbers a so that either (a, a^2) or (a,…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
We study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms {\it super greedy algorithms}. The…
A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…
We revisit the finite Abelian hidden subgroup problem (AHSP) from a mathematical perspective and make the following contributions. First, by employing amplitude amplification, we present an exact quantum algorithm for the finite AHSP, our…