Related papers: Takagi Function Identities on Dyadic Rationals
This paper sketches the history of the Takagi function T and surveys known properties of T, including its nowhere-differentiability, modulus of continuity, graphical properties and level sets. Several generalizations of the Takagi function,…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
We discuss a variation of Takagi curves based, however, more on algebraic than geometric principles. Namely, we construct functions of loops in a special binary representation. The graph of these functions usually has chaotic and fractal…
Motivated by rigorous development in the theory of digamma functions, we have first derived some new identities for the digamma function, and then computed the values of digamma function for the fractional orders using these identities…
The Takagi function is a continuous non-differentiable function on [0,1] introduced by Teiji Takagi in 1903. It has since appeared in a surprising number of different mathematical contexts, including mathematical analysis, probability…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…
The Takagi function $T:[0,1]\to \mathbb{R}$ is a classical example of a continuous nowhere differentiable function. In this paper, we study the discrete dynamical system generated by the Takagi function. First, we prove that for almost…
We propose a tree-based algorithm for classification and regression problems in the context of functional data analysis, which allows to leverage representation learning and multiple splitting rules at the node level, reducing…
We consider a generalized version of the Takagi function, which is one of the most famous example of nowhere differentiable continuous functions. We investigate a set of conditions to describe the rate of convergence of Takagi class…
In this work we consider the Takagi factorization of a matrix valued function depending on parameters. We give smoothness and genericity results and pay particular attention to the concerns caused by having either a singular value equal to…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We study a partially ordered set of planar labeled rooted trees by use of combinatorial objects called Dyck tilings. A generating function of the poset is factorized when the minimum element of the poset is $312$-avoiding and satisfies some…
In this paper, we study certain inequalities and a related result for weighted Sobolev spaces on H\"older-$\alpha$ domains, where the weights are powers of the distance to the boundary. We obtain results regarding the divergence equation's…
Consider matrices of order $k+N$ over $p$-adic field determined up to conjugations by elements of $GL$ over $p$-adic integers. We define a product of such conjugacy classes and construct the analog of characteristic functions (transfer…
The Tokunaga condition is an algebraic rule that provides a detailed description of the branching structure in a self-similar tree. Despite a solid empirical validation and practical convenience, the Tokunaga condition lacks a theoretical…
The study of prime divisibility plays a crucial role in number theory. The $p$-adic valuation of a number is the highest power of a prime, $p$, that divides that number. Using this valuation, we construct $p$-adic valuation trees to…
In this article we use the Bellman function technique to characterize the measures for which the weighted Hardy's inequality holds on dyadic trees. We enunciate the (dual) Hardy's inequality over the dyadic tree and we use the associated…
We study functional graphs generated by several quadratic polynomials, acting simultaneously on a finite field of odd characteristic. We obtain several results about the number of leaves in such graphs. In particular, in the case of graphs…
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…