Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1409.6157

Construction and Composition of Rooted Trees via Descent Functions

Marco Abrate·Stefano Barbero·Umberto Cerruti·Nadir Murru
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions. Moreover, in this way, we are able to compose rooted trees with each other. Such a new composition of rooted trees is a very powerful tool applied in this paper in order to obtain important results as the creation of new rational and Pythagorean trees.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Abrate, Stefano Barbero, Umberto Cerruti, Nadir Murru. 2014-09-22. Construction and Composition of Rooted Trees via Descent Functions. https://arxiv.org/abs/1409.6157

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On single-variable Witten zeta functions of rank two and three

By introducing a novel integration kernel for the Mellin transform, we uncover many previously unknown and intriguing properties of the Witten zeta functions of rank two and three. Detailed results concerning their pole locations, residues, and special values are obtained. We propose a non-trivial conjecture regarding their derivatives at the origin, which seems to encode deep information about the root system. We also discuss their behavior at negative integers, highlighting a connection with Eisenstein series and a $p$-adic observation.

math.NT↗
arXiv2026

On graded Lie algebras associated to once-punctured elliptic curves with complex multiplication

We study a graded Lie algebra arising from the Galois action on the pro-$p$ fundamental group of a once-punctured elliptic curve with complex multiplication. Among other things, we provide a minimal generating set of the rationalized Lie algebra under suitable assumptions. The proof is based on a slight variant of the theory of weighted completion of profinite groups developed by Hain and Matsumoto.

math.NT↗
arXiv2026

Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$

We establish a Burgess-type bound for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$. Let \[ B=\left\{\sum_{i=1}^{n}x_iω_i: N_i+1\le x_i\le N_i+H_i,1\le i\le n\right\}\subseteq\mathbb{F}_{p^n}, \] where $1\le H_i\le p$ for all $1\le i\le n$, and the side lengths satisfy $H_1\le H_2\le\cdots\le H_n.$ We prove that if the side lengths satisfy certain lower bounds in terms of the two largest side lengths, then a nontrivial cancellation occurs in the character sum over the boxes. This generalizes the work of Gabdullin \cite{GB} in dimensions $n=2,3$ to arbitrary dimension. This also generalizes the character sum estimate of Konyagin \cite{Kon} where each of the side lengths of the boxes are greater than $p^{1/4}$. The proof combines techniques from the geometry of numbers, multiplicative energy estimates, and Katz's bounds for multiplicative character sums.

math.NT↗