相关论文: A counting method for finding rational approximate…
To every integer monic polynomial of degree m can be associated a `replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite `alphabet' of size 2m. This rule applied iteratively on almost any…
We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…
In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting sort and address calculation sort family of algorithms.…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using…
In this paper we revisit the classical regular expression matching problem, namely, given a regular expression $R$ and a string $Q$, decide if $Q$ matches one of the strings specified by $R$. Let $m$ and $n$ be the length of $R$ and $Q$,…
We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the…
We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
A pattern p (i.e., a string of variables and terminals) matches a word w, if w can be obtained by uniformly replacing the variables of p by terminal words. The respective matching problem, i.e., deciding whether or not a given pattern…
For $x\geq 3$, we define $w(x)$ as the highest integer $w$ for which there exist integers $m, y\geq 1$ and $1\leq n_1<\dots<n_m\leq x$ such that $n_1\cdots n_m=y^w$. We show that \[w(x)=x\exp\big(-(\sqrt{2}+o(1))\sqrt{\log x\log\log…
Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…
We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…
We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient way. This problem has applications in e.g. information retrieval and…
For any infinite word $w$ on a finite alphabet $A$, the complexity function $p_w$ of $w$ is the sequence counting, for each non-negative $n$, the number $p_w(n)$ of words of length $n$ on the alphabet $A$ that are factors of the infinite…
This paper describes a systematic method of numerically computing and indexing fixed points of $z^{z^w}$ for fixed $z$ or equivalently, the roots of $T_2(w;z)=w-z^{z^w}$. The roots are computed using a modified version of fixed-point…
Math Word Problems (MWPs) in online assessments help test the ability of the learner to make critical inferences by interpreting the linguistic information in them. To test the mathematical reasoning capabilities of the learners, sometimes…
We consider the map X defined on the rational numbers given by x --> x * ceil(x), where ceil(x) denotes the smallest integer greater than or equal to x, and study the problem of finding, for each rational, the smallest number of iterations…
The roots of any polynomial of degree m with complex integer coefficients can be computed by manipulation of sequences made from distinct symbols and counting the different symbols in the sequences. This method requires only primitive…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. For any given…