相关论文: Digital pattern and transcendence via generalized …

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $\nu(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $\nu(p)$…

Special kinds of continued fractions have been proved to converge to transcendental real numbers by means of the celebrated Subspace Theorem. In this paper we study the analogous $p$--adic problem. More specifically, we deal with Browkin…

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

We use the Schmidt Subspace Theorem to establish the transcendence of a class of quasi-periodic continued fractions. This improves earlier works of Maillet and of A. Baker. We also improve an old result of Davenport and Roth on the rate of…

Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…

It is a classical fact that for any $\varepsilon > 0$, a random permutation of length $n = (1 + \varepsilon) k^2 / 4$ typically contains a monotone subsequence of length $k$. As a far-reaching generalization, Alon conjectured that a random…

Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the…

We construct a topos in which the Dedekind reals are countable. The topos arises from a new kind of realizability, which we call parameterized realizability, based on partial combinatory algebras whose application depends on a parameter.…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

Generative models are trained with the simple objective of imitating the conditional probability distribution induced by the data they are trained on. Therefore, when trained on data generated by humans, we may not expect the artificial…

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…

We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…

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…

This paper presents the Quanta Prime Sequence (QPS) and its foundational theorem, showcasing a unique class of polynomials with substantial implications. The study uncovers profound connections between Quanta Prime numbers and essential…

In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…

A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…

We prove that the number of multigraphs with vertex set $\{1, \ldots, n\}$ such that every four vertices span at most nine edges is $a^{n^2 + o(n^2)}$ where $a$ is transcendental (assuming Schanuel's conjecture from number theory). This is…

This article consists of three chapters.In Chapter 1, it is determined by the consecutive odd numbers, and study to the intrinsic properties of a class of matrix sequence. Through the establishment of matrix online number concept,…