Related papers: Optimal factorizations of rational numbers using f…
For an algebraic number $\alpha$, the metric Mahler measure $m_1(\alpha)$ was first studied by Dubickas and Smyth in 2001 and was later generalized to the $t$-metric Mahler measure $m_t(\alpha)$ by the author in 2010. The definition of…
If $\alpha$ is a non-zero algebraic number, we let $m(\alpha)$ denote the Mahler measure of the minimal polynomial of $\alpha$ over $\mathbb Z$. A series of articles by Dubickas and Smyth, and later by the author, develop a modified version…
A. Dubickas and C. Smyth introduced the metric Mahler measure $$ M_1(\alpha) = \inf\left\{\sum_{n=1}^N M(\alpha_n): N \in \mathbb N, \alpha_1 \cdots \alpha_N = \alpha\right\}, $$ where $M(\alpha)$ denotes the usual (logarithmic) Mahler…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
Let $M(\alpha)$ denote the (logarithmic) Mahler measure of the algebraic number $\alpha$. Dubickas and Smyth, and later Fili and the author, examined metric versions of $M$. The author generalized these constructions in order to associate,…
We revisit the problem of rational search: given an unknown rational number $\alpha = \frac{a}{b} \in (0,1)$ with $b \leq n$, the goal is to identify $\alpha$ using comparison queries of the form ``$\beta \leq \alpha$?''. The problem has…
A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…
Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…
For a positive real $\alpha$, we can consider the additive submonoid $M$ of the real line that is generated by the nonnegative powers of $\alpha$. When $\alpha$ is transcendental, $M$ is a unique factorization monoid. However, when $\alpha$…
Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…
Let $M(\alpha)$ denote the Mahler measure of the algebraic number $\alpha$. In a recent paper, Dubickas and Smyth constructed a metric version of the Mahler measure on the multiplicative group of algebraic numbers. Later, Fili and the…
Dubickas and Smyth defined the metric Mahler measure on the multiplicative group of non-zero algebraic numbers. The definition involves taking an infimum over representations of an algebraic number $\alpha$ by other algebraic numbers. We…
Let n be any odd natural number other than a perfect square, in this article it is demonstrated that this new factorization algorithm is much more efficient than the implementation technique [2,3 p.1470], described in this article, of the…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into…
Tree rotations (left and right) are basic local deformations allowing to transform between two unlabeled binary trees of the same size. Hence, there is a natural problem of practically finding such transformation path with low number of…
We solve a conjecture by Becker et al. (arXiv:2404.05963) on the topic of zero forcing regarding the number of minimal forts of a tree. They conjectured and we prove $\mathcal{F}_{T_n} \le \binom{n}{2} \mathcal{F}_{P_n}$ where…
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…
Recent work of Fili and the author examines an ultrametric version of the Mahler measure, denoted $M_\infty(\alpha)$ for an algebraic number $\alpha$. We show that the computation of $M_\infty(\alpha)$ can be reduced to a certain search…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…