Related papers: Takagi Function Identities on Dyadic Rationals

We study the finite dimensional partition properties of the countable homogeneous dense local order. Some of our results use ideas borrowed from the partition calculus of the rationals and are obtained thanks to a strengthening of…

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. For every…

A. Lacasse conjectured a combinatorial identity in his study of learning theory. Various people found independent proofs. Here is another one that is based on the study of the tree function, with links to Lamberts $W$-function and…

We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…

To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…

In this paper, we consider a weighted version of one-dimensional discrete Hardy inequalities with power weights of the form $n^\alpha$. We prove the inequality when $\alpha$ is an even natural number with the sharp constant and remainder…

We introduce notions of absolutely non-free and perfectly non-free group actions and use them to study the associated unitary representations. We show that every weakly branch group acts absolutely non-freely on the boundary of the…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

Dirac delta function (delta-distribution) approach can be used as efficient method to derive identities for number series and their reciprocals. Applying this method, a simple proof for identity relating prime counting function…

Let ${\cal T}=(T,w)$ be a weighted finite tree with leaves $1,..., n$. For any $I :=\{i_1,..., i_k \} \subset \{1,...,n\}$, let $D_I ({\cal T})$ be the weight of the minimal subtree of $T$ connecting $i_1,..., i_k$; the $D_{I} ({\cal T})$…

Let $n>1$ be an integer, and let $T$ be a tree with $n+1$ vertices $v_1,\ldots,v_{n+1}$, where $v_1$ and $v_{n+1}$ are two leaves of $T$. For each edge $e$ of $T$, assign a complex number $w(e)$ as its weight. We obtain that…

We study tree-to-tree transformations that can be defined in first-order logic or monadic second-order logic. We prove a decomposition theorem, which shows that every transformation can be obtained from prime transformations, such as…

This work harnesses interpretable machine learning methods to address the challenging inverse design problem of origami-inspired systems. We show that a decision tree-random forest method is particularly suitable for fitting origami…

Identities and inequalities for the cosine and sine functions are obtained.

A general method is presented for deriving on-shell Ward-identities in (2D) string theory. It is shown that all tree-level Ward identities can be summarized in a quadratic differential equation for the generating function of…

Based on bulk reconstruction from the finite boundary of the Bruhat-Tits tree, the boundary effective theory is obtained after integrating out fields outside this boundary. According to the $~p$-adic version of Anti-de Sitter/Conformal…

We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings…

Iterated integrals of paths arise frequently in the study of the Taylor's expansion for controlled differential equations. We will prove a factorial decay estimate, conjectured by M. Gubinelli, for the iterated integrals of non-geometric…

The plucking polynomial is an invariant of rooted trees with connections to knot theory. The polynomial was constructed in 2014 as a tool to analyze lattice crossings after taking the quotient by the Kauffman bracket skein relations. In…

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…