English
Related papers

Related papers: Stern-Brocot Trees from Weighted Mediants

200 papers

Let w be a binary string and let a_w (n) be the number of occurrences of the word w in the binary expansion of n. As usual we let s(n) denote the Stern sequence; that is, s(0)=0, s(1)=1, and for n >= 1, s(2n)=s(n) and s(2n+1)=s(n)+s(n+1).…

Number Theory · Mathematics 2011-07-08 Michael Coons , Jeffrey Shallit

This paper describes the Context Tree Switching technique, a modification of Context Tree Weighting for the prediction of binary, stationary, n-Markov sources. By modifying Context Tree Weighting's recursive weighting scheme, it is possible…

Information Theory · Computer Science 2011-11-15 Joel Veness , Kee Siong Ng , Marcus Hutter , Michael Bowling

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…

Combinatorics · Mathematics 2013-04-22 Valentin Féray , I. P. Goulden

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

Combinatorics · Mathematics 2024-02-13 Hajime Fujita , Kimiko Hasegawa , Yukie Inaba , Takefumi Kondo

The use of decision trees for percolation inequalities started with the celebrated O'Donnell--Saks--Schramm--Servedio (OSSS) inequality. We prove decision tree generalizations of the Harris--Kleitman (HK), van den Berg--Kesten (vdBK), and…

Probability · Mathematics 2024-08-26 Nikita Gladkov

Clustering is a popular form of unsupervised learning for geometric data. Unfortunately, many clustering algorithms lead to cluster assignments that are hard to explain, partially because they depend on all the features of the data in a…

Machine Learning · Computer Science 2020-09-23 Sanjoy Dasgupta , Nave Frost , Michal Moshkovitz , Cyrus Rashtchian

By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…

Combinatorics · Mathematics 2011-04-05 Ilse Fischer

We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the…

Probability · Mathematics 2007-09-25 Arnaud Durand

We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…

Number Theory · Mathematics 2021-02-22 Kevin Hare , J. C. Saunders

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…

Representation Theory · Mathematics 2024-03-19 Nate Harman , Ilia Nekrasov , Andrew Snowden

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…

Dynamical Systems · Mathematics 2016-05-17 Yuke Huang , Zhiying Wen

Given an edge-weighted tree $T$ with $n$ leaves, sample the leaves uniformly at random without replacement and let $W_k$, $2 \le k \le n$, be the length of the subtree spanned by the first $k$ leaves. We consider the question, "Can $T$ be…

Combinatorics · Mathematics 2015-06-04 Steven N. Evans , Daniel Lanoue

We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but…

Discrete Mathematics · Computer Science 2015-03-17 Hermann Gruber

The recent CDF-II measurement of the mass of the $W$ boson shows a significant tension with the Standard Model (SM) expectation, even when averaged with earlier measurements. The tension can be explained in the framework of any beyond-SM…

High Energy Physics - Phenomenology · Physics 2022-08-12 Poulami Mondal

It is known that all degenerations of the complex projective plane into a surface with only quotient singularities are controlled by the positive integer solutions $(a,b,c)$ of the Markov equation $$x^2+y^2+z^2=3xyz.$$ It turns out that…

Algebraic Geometry · Mathematics 2025-05-14 Giancarlo Urzúa , Juan Pablo Zúñiga

For an element $w$ in the Weyl algebra generated by $D$ and $U$ with relation $DU=UD+1$, the normally ordered form is $w=\sum c_{i,j}U^iD^j$. We demonstrate that the normal order coefficients $c_{i,j}$ of a word $w$ are rook numbers on a…

Combinatorics · Mathematics 2007-05-23 Anna Varvak

We give a condition on weighted mean matrices so that their $l^p$ norms are determined on decreasing sequences when the condition is satisfied. We apply our result to give a proof of a conjecture of Bennett and discuss some related results.

Functional Analysis · Mathematics 2008-10-07 Peng Gao

We deal with unweighted and weighted enumerations of lozenge tilings of a hexagon with side lengths $a,b+m,c,a+m,b,c+m$, where an equilateral triangle of side length $m$ has been removed from the center. We give closed formulas for the…

Combinatorics · Mathematics 2007-05-23 Mihai Ciucu , Theresia Eisenkölbl , C. Krattenthaler , D. Zare

Bifurcating Markov chains (BMC) are Markov chains indexed by a full binary tree representing the evolution of a trait along a population where each individual has two children. Motivated by the functional estimation of the density of the…

Statistics Theory · Mathematics 2021-06-17 S. Valère Bitseki Penda , Jean-François Delmas