English
Related papers

Related papers: Mixed cobinary trees

200 papers

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a…

Combinatorics · Mathematics 2026-05-07 Emily Barnard , Jean-Christophe Novelli , Vincent Pilaud

We show that the $m$-cluster category of type $A_{n-1}$ is equivalent to a certain geometrically-defined category of diagonals of a regular $nm+2$-gon. This generalises a result of Caldero, Chapoton and Schiffler for $m=1$. The approach…

Representation Theory · Mathematics 2020-12-21 Karin Baur , Bethany Marsh

In this series of articles we study connections between combinatorics of multidimensional generalizations of Cauchy identity and continuous objects such as multidimensional Brownian motions and Brownian bridges. In Part I of the series we…

Combinatorics · Mathematics 2007-05-23 Piotr Sniady

In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula involves a new class of generalized Littlewood-Richardson coefficients, all of which surprisingly seem to be…

Combinatorics · Mathematics 2007-05-23 Anders S. Buch

We study the average number of distinct fringe subtrees in random trees generated by leaf-centric binary tree sources as introduced by Zhang, Yang and Kieffer. A leaf-centric binary tree source induces for every $n \geq 2$ a probability…

Discrete Mathematics · Computer Science 2025-04-30 Louisa Seelbach Benkner , Markus Lohrey , Stephan Wagner

We denote a polygon as a connected component in Cayley tree of order 2 containing certain number of fix vertices. We found an exact formula for a polygon counting problem for two cases, in which, for the first case the polygon contain a…

Number Theory · Mathematics 2010-04-15 Farrukh Mukhamedov , Chin Hee Pah , Mansoor Saburov

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

We prove that the set of c-vectors of the cluster algebra associated to an acyclic quiver Q coincides with the set of real Schur roots and their opposites in the root system associated to Q.

Representation Theory · Mathematics 2012-12-11 Alfredo Nájera Chávez

We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…

Combinatorics · Mathematics 2021-02-01 Philippe Biane

We give a representation-theoretic bijection between rooted labeled forests with $n$ vertices and complete exceptional sequences for the quiver of type $A_n$ with straight orientation. The ascending and descending vertices in the forest…

Representation Theory · Mathematics 2025-01-03 Kiyoshi Igusa , Emre Sen

We consider extremal problems related to decks and multidecks of rooted binary trees (a.k.a. rooted phylogenetic tree shapes). Here, the deck (resp. multideck) of a tree $T$ refers to the set (resp. multiset) of leaf induced binary subtrees…

The Raney numbers $R_{p,r}(n)$ are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns \cite{Raney}. We give a new combinatorial interpretation for all…

Combinatorics · Mathematics 2015-01-29 Jonathan E. Beagley , Paul Drube

In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…

Combinatorics · Mathematics 2014-04-15 Jean-Christophe Aval , Adrien Boussicault , Philippe Nadeau

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

Combinatorics · Mathematics 2019-10-30 Olivier Bodini , Antoine Genitrini , Bernhard Gittenberger , Stephan Wagner

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…

Combinatorics · Mathematics 2016-05-11 Pawel Hitczenko , Amanda Lohss

We propose a model-based clustering algorithm for a general class of functional data for which the components could be curves or images. The random functional data realizations could be measured with error at discrete, and possibly random,…

Machine Learning · Statistics 2022-03-14 Steven Golovkine , Nicolas Klutchnikoff , Valentin Patilea

The cluster-weighted model (CWM) is a mixture model with random covariates which allows for flexible clustering and density estimation of a random vector composed by a response variable and by a set of covariates. In this class of models,…

Methodology · Statistics 2013-08-06 Salvatore Ingrassia , Antonio Punzo

In this paper a formula is proved for the general degeneracy locus associated to an oriented quiver of type A_n. Given a finite sequence of vector bundles with maps between them, these loci are described by putting rank conditions on…

Algebraic Geometry · Mathematics 2009-10-31 Anders S. Buch , William Fulton

For an algebraically closed field $K$, we investigate a class of noncommutative $K$-algebras called connected quantized Weyl algebras. Such an algebra has a PBW basis for a set of generators $\{x_1,\dots,x_n\}$ such that each pair satisfies…

Rings and Algebras · Mathematics 2017-08-29 Christopher D. Fish , David A. Jordan

A weighted bicolored plane tree is a bicolored plane tree whose edges are endowed with positive integral weights. The degree of a vertex is defined as the sum of the weights of the edges incident to this vertex. Using the theory of dessins…

Number Theory · Mathematics 2013-06-19 F. Pakovich , A. Zvonkin