Related papers: Takagi Function Identities on Dyadic Rationals
We return to Takagi's variational principle, generalized after forty years to two complex variables by Pfister. Both isolating some extremal rational functions associated to a bounded holomorphic function in the unit disk, respectively the…
The Hardy operator $T_a$ on a tree $\G$ is defined by \[(T_af)(x):=v(x) \int^x_a u(t)f(t) dt \qquad {for} a, x\in \G. \] Properties of $T_a$ as a map from $L^p(\G)$ into itself are established for $1\le p \le \infty$. The main result is…
We give a new theta-function identity, a special case of which is utilised to prove Kawanaka's Macdonald polynomial conjecture. The theta-function identity further yields a transformation formula for multivariable elliptic hypergeometric…
We discuss reflections identities of harmonic sums up to weight three. The need for this kind of identities emerges in analysis of the general structure of eigenvalue of the BFKL equation. The reflection identities decompose a product of…
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…
We note how several central results in multiplicative number theory may be rephrased naturally in terms of multiplicative functions $f$ that pretend to be another multiplicative function $g$. We formalize a `distance' which gives a measure…
We consider the hierarchic tree Random Energy Model with continuous branching and calculate the moments of the corresponding partition function. We establish the multifractal properties of those moments. We derive formulas for the normal…
Column expansion identities of determinants give a source of quadratic spanning forest polynomial identities and allow us determine the dimension of the space of certain quadratic spanning forest identities, settling a conjecture of one of…
It is shown how many of the partial theta function identities in Ramanujan's lost notebook can be generalized to infinite families of such identities. Key in our construction is the Bailey lemma and a new generalization of the Jacobi triple…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
Alladi studied partition theoretic implications of a two variable generalization of the Lebesgue identity. In this short note, we focus on a slight variation of the basic hypergeometric sum that Alladi studied. We present two new partition…
We define a graph Laplacian with vertex weights in addition to the more classical edge weights, which unifies the combinatorial Laplacian and the normalised Laplacian. Moreover, we give a combinatorial interpretation for the coefficients of…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
The classical Dodgson identity can be interpreted as a quadratic identity of spanning forest polynomials, where the spanning forests used in each polynomial are defined by how three marked vertices are divided among the component trees. We…
A tree is scattered if no subdivision of the complete binary tree is a subtree. Building on results of Halin, Polat and Sabidussi, we identify four types of subtrees of a scattered tree and a function of the tree into the integers at least…
In this paper we find fractional Riemann-Liouville derivatives for the Takagi-Landsberg functions. Moreover, we introduce their generalizations called weighted Takagi-Landsberg functions which have arbitrary bounded coefficients in the…
In this paper we develop a classification of real functions based on growth rates of repeated iteration. We show how functions are naturally distinguishable when considering inverses of repeated iterations. For example, $n+2\to 2n\to 2^n\to…
The sequence A268289 from the On-Line Encyclopedia of Integer Sequences, namely the cumulated differences between the number of digits 1 and the number of digits 0 in the binary expansion of consecutive integers, is studied here. This…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…