中文
相关论文

相关论文: An involution on \beta(1,0)-trees

200 篇论文

A genus one labeled circle tree is a tree with its vertices on a circle, such that together they can be embedded in a surface of genus one, but not of genus zero. We define an e-reduction process whereby a special type of subtree, called an…

组合数学 · 数学 2007-05-23 Karola Meszaros

Consider $\beta > 1$ and $\lfloor \beta \rfloor$ its integer part. It is widely known that any real number $\alpha \in \Bigl[0, \frac{\lfloor \beta \rfloor}{\beta - 1}\Bigr]$ can be represented in base $\beta$ using a development in series…

动力系统 · 数学 2022-05-11 Victor Vargas

We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…

经典分析与常微分方程 · 数学 2014-10-24 Kenneth J Falconer

In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.

经典分析与常微分方程 · 数学 2018-12-20 Nicola Arcozzi , Irina Holmes , Pavel Mozolyako , Alexander Volberg

In this article, we construct a generalization of the Blum-Fran\c{c}ois Beta-splitting model for evolutionary trees, which was itself inspired by Aldous' Beta-splitting model on cladograms. The novelty of our approach allows for asymmetric…

概率论 · 数学 2016-07-04 Raazesh Sainudiin , Amandine Veber

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…

组合数学 · 数学 2007-05-23 William Y. C. Chen , Sherry H. F. Yan

The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…

计算复杂性 · 计算机科学 2015-10-16 Amir Abboud , Arturs Backurs , Thomas Dueholm Hansen , Virginia Vassilevska Williams , Or Zamir

We discuss the possibility of deriving an H-theorem for the nonlinear discrete time evolution known as Ulam's redistribution of energy problem. In this model particles are paired at random and then their total energy is redistributed…

统计力学 · 物理学 2013-06-06 S. M. Apenko

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…

逻辑 · 数学 2026-01-06 Saharon Shelah

We provide necessary and sufficient conditions on the unimodality of a convolution of two sequences of binomial coefficients preceded by a finite number of ones. These convolution sequences arise as as rank sequences of posets of…

组合数学 · 数学 2019-10-07 Tricia Muldoon Brown

We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of…

机器学习 · 统计学 2015-04-06 Creighton Heaukulani , David A. Knowles , Zoubin Ghahramani

We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…

概率论 · 数学 2014-08-05 Tim Austin , Dmitry Panchenko

We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead to different distributions of limiting trees from a total…

概率论 · 数学 2014-10-22 Sébastien Bubeck , Ronen Eldan , Elchanan Mossel , Miklós Z. Rácz

We give definitions that distinguish between two notions of indiscernibility for a set $\{a_\eta \mid \eta \in \W\}$ that saw original use in \cite{sh90}, which we name \textit{$\s$-} and \textit{$\n$-indiscernibility}. Using these…

逻辑 · 数学 2013-12-25 Byunghan Kim , Hyeung-Joon Kim , Lynn Scow

Our main results in this paper are new equidistributions on plane trees and $132$-avoiding permutations, two closely related objects. As for the former, we discover a characteristic for vertices of plane trees that is equally distributed as…

组合数学 · 数学 2024-09-09 Zi-Wei Bai , Ricky X. F. Chen

In this paper we consider two aspects of the inverse problem of how to construct merge trees realizing a given barcode. Much of our investigation exploits a recently discovered connection between the symmetric group and barcodes in general…

代数拓扑 · 数学 2021-07-27 Justin Curry , Jordan DeSha , Adélie Garin , Kathryn Hess , Lida Kanari , Brendan Mallery

The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…

动力系统 · 数学 2021-08-31 Jung-Chao Ban , Chih-Hung Chang , Wen-Guei Hu , Guan-Yu Lai , Yu-Liang Wu

An involution of a real commutative algebra $A$ is a real-linear homomorphism $f : A \rightarrow A$ such that $f^2 = \mathrm{Id}$. We show that there are six involutions of the algebra of bicomplex numbers, contrary to the actual number of…

环与代数 · 数学 2022-08-04 Pierre-Olivier Parisé

We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…

算子代数 · 数学 2013-03-05 Suren A. Grigoryan , Vardan H. Tepoyan

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

组合数学 · 数学 2025-02-14 Yang Li , Zhicong Lin