Related papers: The Aurellion Function: A Recursive Fast-Growing H…

We study the first order theory of structures over graphs i.e. structures of the form ($\mathcal{G},\tau$) where $\mathcal{G}$ is the set of all (isomorphism types of) finite undirected graphs and $\tau$ some vocabulary. We define the…

We introduce ArrowFlow, a machine learning architecture that operates entirely in the space of permutations. Its computational units are ranking filters, learned orderings that compare inputs via Spearman's footrule distance and update…

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

The author makes use of infinite compositions and a limiting function to construct a $\mathcal{C}^\infty$ tetration function $\mathcal{F}(t) = e \tet t$. As a tetration function, $\mathcal{F}$ satisfies $e^{\mathcal{F}(t)} =…

The Additive Transform of an arithmetic function represents a novel approach to examining the interplay between multiplicative arithmetic function and additive functions. This transform concept introduces a method to systematically generate…

We show that a unified approach to the perturbative evolution of structure functions which sums all logarithms of Q^2 and 1/x at leading and next-to-leading order yields results in full agreement with the 1993 HERA data for F_2. This makes…

We prove that Buchholz's system of fundamental sequences for the $\vartheta$ function enjoys various regularity conditions, including the Bachmann property. We partially extend these results to variants of the $\vartheta$ function,…

In arithmetic statistics and analytic number theory, the asymptotic growth rate of counting functions giving the number of objects with order below $X$ is studied as $X\to \infty$. We define general counting functions which count…

It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…

Large language models demonstrate the intriguing ability to perform unseen tasks via in-context learning. However, it remains unclear what mechanisms inside the model drive such task-level generalization. In this work, we approach this…

A finite family $\mathrsfs{F}$ of subsets of a finite set $X$ is union-closed whenever $f,g\in\mathrsfs{F}$ implies $f\cup g\in\mathrsfs{F}$. These families are well known because of Frankl's conjecture. In this paper we developed further…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…

The $k$-dimensional generalized Euler function $\varphi_k(n)$ is defined to be the number of ordered $k$-tuples $(a_1,a_2,\ldots, a_k) \in \mathbb{N}^k$ with $1\leq a_1,a_2,\ldots, a_k \leq n$ such that both the product $a_1a_2\cdots a_k$…

One of the fundamental tools of undergraduate calculus is the chain rule. The notion of higher order directional derivatives was developed by Huang, Marcantognini, and Young, along with a corresponding higher order chain rule. When Johnson…

We discuss the regularity of extremal functions in certain weighted Bergman and Fock type spaces. Given an appropriate analytic function $k$, the corresponding extremal function is the function with unit norm maximizing $\text{Re}…

The evolution, as functions of the "ticking time" $\ell =0,1,2,...$, of the solutions of the system of $N$ quadratic recursions \begin{eqnarray*} x_{n}\left( \ell +1\right) =c_{n}+\sum_{m=1}^{N}\left[ C_{nm}x_{m}\left( \ell \right) \right]…

Predicative analysis of recursion schema is a method to characterize complexity classes like the class FPTIME of polynomial time computable functions. This analysis comes from the works of Bellantoni and Cook, and Leivant by data tiering.…

It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…

Let A be a finite subset of an abelian group (G, +). Let h $\ge$ 2 be an integer. If |A| $\ge$ 2 and the cardinality |hA| of the h-fold iterated sumset hA = A + $\times$ $\times$ $\times$ + A is known, what can one say about |(h -- 1)A| and…