Related papers: On the finite factorial numbers

For families of all theories of arbitrary given languages we describe ranks and degrees. In particular, we characterize (non-)totally transcendental families. We apply these characterizations for the families of all theories of given…

We prove that fractional Helly and $(p,q)$-theorems imply $(\aleph_0,q)$-theorems in an entirely abstract setting. We give a plethora of applications, including reproving almost all earlier $(\aleph_0,q)$-theorems about geometric…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

L\"uroth series, like regular continued fractions, provide an interesting identification of real numbers with infinite sequences of integers. These sequences give deep arithmetic and measure-theoretic properties of subsets of numbers…

Let $j(z)$ be the modular $j$-invariant function. Let $\tau$ be an algebraic number in the complex upper half plane $\mathbb{H}$. It was proved by Schneider and Siegel that if $\tau$ is not a CM point, i.e.,…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We give a brief history of transcendental number theory, including Schanuel's conjecture (S). Assuming (S), we prove that if z and w are complex numbers, not 0 or 1, with z^w and w^z algebraic, then z and w are either both rational or both…

We show that if the growth of a transcendental entire function f is sufficiently regular, then the Julia set and the escaping set of f have Hausdorff dimension 2.

The concept of fractal index is introduced in connection with the idea of universal class $h$ of particles or quasiparticles, termed fractons, which obey fractal statistics. We show the relation between fractons and conformal field…

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

We first give a summary of the history of transcendental numbers then use a nice technique by G. Dresden to prove a new transcendental number. In particular, while previous work looked at the last non-zero digit of $n^n$, we consider the…

For fixed natural numbers $r$ and $s$, where $2\leq s \leq r$, we consider a representation of numbers from the interval $[0;\frac{r}{s-1}]$ obtained by encoding numbers by means of the alphabet $A=\{0,1,...,r\}$ via the expansion…

About fifty years ago Mahler proved that if $\alpha>1$ is rational but not an integer and if $0<l<1$ then the fractional part of $\alpha^n$ is $>l^n$ apart from a finite set of integers $n$ depending on $\alpha$ and $l$. Answering…

The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were called the Terwilliger $\mathbb{F}$-algebras of association schemes in [8]. In this paper, we study the Terwilliger $\mathbb{F}$-algebras of factorial…

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…