English
Related papers

Related papers: Involutions on Tip-Augmented Plane Trees for Leaf …

200 papers

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…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Sherry H. F. Yan

The time process of transport on randomly evolving trees is investigated. By introducing the notions of living and dead nodes a model of random tree evolution is constructed which describes the spreading in time of objects corresponding to…

Statistical Mechanics · Physics 2009-11-11 L. Pal

This article is a conceptual exposition on the structure of the tree. It demonstrates an evolutionary design that the tree possesses in the perspective of a structural engineer.

Popular Physics · Physics 2018-07-03 Munishwer Chander Chadda , Mayank Chadha

We provide a complete structure theorem for involutory matrices. This yields a new approach to principal angles between subspaces and provide a series of nice formulae for these angles.

Functional Analysis · Mathematics 2026-02-24 Jean-Christophe Bourin , Eun-Young Lee

To an algebraic variety equipped with an involution, we associate a cycle class in the modulo two Chow group of its fixed locus. This association is functorial with respect to proper morphisms having a degree and preserving the involutions.…

Algebraic Geometry · Mathematics 2018-12-04 Olivier Haution

This note is dedicated to presenting a polynomial analogue of $(n+1)!C_n=2^n(2n-1)!!$ (with $C_n$ as the $n$-th Catalan number) in the context of labeled plane trees and increasing plane trees, based on the definition of improper edges in…

Combinatorics · Mathematics 2025-10-06 Lora R. Du , Kathy Q. Ji , Dax T. X. Zhang

Consider the Aldous Markov chain on the space of rooted binary trees with $n$ labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix $1\le k < n$ and project the leaf…

Probability · Mathematics 2018-02-06 Noah Forman , Soumik Pal , Douglas Rizzolo , Matthias Winkel

In this paper we introduce mutation of Brauer trees. We show that our mutation of Brauer trees explicitly describes the tilting mutation of Brauer tree algebras introduced by Okuyama and Rickard.

Rings and Algebras · Mathematics 2011-07-08 Takuma Aihara

We prove that every tree of maximum degree $\Delta$ with $\ell$ leaves contains paths between leaves of at least $\log_{\Delta-1}((\Delta-2)\ell)$ distinct lengths. This settles in a strong form a conjecture of Narins, Pokrovskiy and…

Combinatorics · Mathematics 2025-04-18 Francesco Di Braccio , Kyriakos Katsamaktsis , Alexandru Malekshahian

The space of phylogenetic trees arises naturally in tropical geometry as the tropical Grassmannian. Tropical geometry therefore suggests a natural notion of a tropical path between two trees, given by a tropical line segment in the tropical…

Combinatorics · Mathematics 2023-12-06 Shelby Cox

This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…

Combinatorics · Mathematics 2009-08-04 Erik Ouchterlony

We present an unusual algorithm involving classification trees where two trees are grown in opposite directions so that they are matched at their leaves. This approach finds application in a new data mining task we formulate, called…

Computational Engineering, Finance, and Science · Computer Science 2007-05-23 Deept Kumar , Naren Ramakrishnan , Malcolm Potts , Richard F. Helm

Data augmentation methods for neural machine translation are particularly useful when limited amount of training data is available, which is often the case when dealing with low-resource languages. We introduce a novel augmentation method,…

Computation and Language · Computer Science 2023-11-07 Attila Nagy , Dorina Lakatos , Botond Barta , Judit Ács

We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…

Dynamical Systems · Mathematics 2018-05-29 Karl Petersen , Ibrahim Salama

This is a collection of articles, written as sections, on arithmetic properties of differential equations, holomorphic foliations, Gauss-Manin connections and Hodge loci. Each section is independent from the others and it has its own…

Algebraic Geometry · Mathematics 2025-12-16 Hossein Movasati

One can often make inferences about a growing network from its current state alone. For example, it is generally possible to determine how a network changed over time or pick among plausible mechanisms explaining its growth. In practice,…

Social and Information Networks · Computer Science 2021-01-27 George T. Cantwell , Guillaume St-Onge , Jean-Gabriel Young

In this paper, we study alternating links in thickened surfaces in terms of the lattices of integer flows on their Tait graphs. We use this approach to give a short proof of the first two generalised Tait conjectures. We also prove that the…

Geometric Topology · Mathematics 2024-09-27 Hans U. Boden , Zsuzsanna Dancso , Damian J. Lin , Tilda S. Wilkinson-Finch

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…

Combinatorics · Mathematics 2019-07-05 Lisa Berry , Stefan Forcey , Maria Ronco , Patrick Showers

The evolution of structure in biology is driven by accretion and change. Accretion brings together disparate parts to form bigger wholes. Change provides opportunities for growth and innovation. Here we review patterns and processes that…

Other Quantitative Biology · Quantitative Biology 2019-01-16 Derek Caetano-Anollés , Kelsey Caetano-Anollés , Gustavo Caetano-Anollés

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Combinatorics · Mathematics 2010-08-16 David Callan
‹ Prev 1 3 4 5 6 7 10 Next ›