English
Related papers

Related papers: A tree approach to the happy function

200 papers

Given balls and boxes both enumerated by the positive integers, we consider a sequential allocation of the balls into the boxes. We fix $\ell \ge 2$. Proceeding in increasing order of box labels, assign to each box the next $r$ smallest…

Combinatorics · Mathematics 2026-05-21 Sadık Eyidoğan , Haydar Göral , Nihan Tanısalı

Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…

Methodology · Statistics 2024-06-21 Sara Shashaani , Ozge Surer , Matthew Plumlee , Seth Guikema

Motivated by the combinatorics of parking functions and their several generalizations, we study the Ehrhart theory of Pitman--Stanley polytopes. We prove a strong positivity phenomenon called \emph{magic positivity} for the Ehrhart…

Combinatorics · Mathematics 2026-04-09 Nicolas Avila , Luis Ferroni , Alejandro H. Morales

We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…

Combinatorics · Mathematics 2017-11-27 Peter J. Humphries

We give a new construction of algebraic codes which are efficiently list decodable from a fraction $1-R-\eps$ of adversarial errors where $R$ is the rate of the code, for any desired positive constant $\eps$. The worst-case list size output…

Information Theory · Computer Science 2015-03-20 Venkatesan Guruswami , Chaoping Xing

A method for creating a forest of model trees to fit samples of a function defined on images is described in several steps: down-sampling the images, determining a tree's hyperplanes, applying convolutions to the hyperplanes to handle small…

Machine Learning · Computer Science 2026-01-28 William Ward Armstrong , Hongyi Li , Jun Xu

Generating function equation has been derived for the probability distribution of the number of nodes with $k \ge 0$ outgoing lines in randomly evolving special trees. The stochastic properties of end-nodes (k=0) have been analyzed, and it…

Statistical Mechanics · Physics 2007-05-23 L. Pal

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

Probability · Mathematics 2016-06-22 Bénédicte Haas

In our previous publication we have shown a method for calculating series of even powers of $\pi$ based on the product representation of the $sinc$ function. We refer the readers to [1] for more details. In this work we apply the method to…

General Mathematics · Mathematics 2025-03-17 Alois Schiessl

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

Number Theory · Mathematics 2023-11-23 Neha Elizabeth Thomas , K Vishnu Namboothiri

Consider the following heuristic for building a decision tree for a function $f : \{0,1\}^n \to \{\pm 1\}$. Place the most influential variable $x_i$ of $f$ at the root, and recurse on the subfunctions $f_{x_i=0}$ and $f_{x_i=1}$ on the…

Data Structures and Algorithms · Computer Science 2019-11-19 Guy Blanc , Jane Lange , Li-Yang Tan

The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…

Combinatorics · Mathematics 2016-09-07 Leonard M. Smiley

This report details the generation and use of tree node ordering keys in a single relational database table. The keys for each node are calculated from the keys of its parent, in such a way that the sort order places every node in the tree…

Databases · Computer Science 2008-06-20 Dan Hazel

Let T d (n) be the set of d-ary rooted trees with n internal nodes. We give a method to construct a sequence (t n , n $\ge$ 0) where, for any n $\ge$ 1, t n has the uniform distribution in T d (n), and t n is constructed from t n--1 by the…

Combinatorics · Mathematics 2021-05-13 Jean-Francois Marckert

We continue to study (see arXiv:2401.08618, https://doi.org/10.48550/arXiv.2401.08618) a renewal equation $\phi(t)=\frak F\phi_t$ proposed in [C. Barril et al., J. Math. Biology, https://doi.org/10.1007/s00285-024-02084-x] to model trees…

Dynamical Systems · Mathematics 2024-04-26 Franco Herrera , Sergei Trofimchuk

In this paper we study the properties of the \emph{Triangular tree}, a complete tree of rational pairs introduced in \cite{cas}, in analogy with the main properties of the Farey tree (or Stern-Brocot tree). To our knowledge the Triangular…

Number Theory · Mathematics 2020-07-14 Claudio Bonanno , Alessio Del Vigna

Recently, Han discovered two formulas involving binary trees which have the interestig property that hooklengths appear as exponents. The purpose of this note is to give a probabilistic proof of one of Han's formulas. Yang has generalized…

Combinatorics · Mathematics 2008-06-12 Bruce E. Sagan

The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix…

Machine Learning · Computer Science 2021-02-02 Thibaut Vidal , Toni Pacheco , Maximilian Schiffer

This paper finally fully elaborates the tree pulldown method used by one of us (Harrington) to settle McLaughlin's conjecture. This method enables the construction of a computable tree $T_0$ whose paths are incomparable over $0^{(\alpha)}$…

Logic · Mathematics 2025-04-22 Leo A. Harrington , Peter M. Gerdes

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…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon
‹ Prev 1 8 9 10 Next ›