Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

Cited in

(62)

Motzkin numbers
Catalan, Motzkin, and Riordan numbers
A new combinatorial interpretation for generalized Catalan number
Packing 1-plane Hamiltonian cycles in complete geometric graphs
The \(S_{n+1}\) action on spherical models and supermaximal models of tipe \(A_{n-1}\)
Unusual area-law violation in random inhomogeneous systems
Patterns in trees
0-Calabi-Yau configurations and finite Auslander-Reiten quivers of Gorenstein orders
Binomial self-inverse sequences and tangent coefficients
Motzkin algebras
Some canonical sequences of integers
Restricted plane tree representations of four Motzkin-Catalan equations
Integrability properties of Motzkin polynomials
Motzkin algebras and the \(A_n\) tensor categories of bimodules
The relevant prefixes of coloured Motzkin walks: an average case analysis
Deux propriétés combinatoires des nombres de Schröder
scientific article; zbMATH DE number 6989305 (Why is no real title available?)
Critical site percolation on the triangular lattice: from integrability to conformal partition functions
On the enumeration of planar trees of hexagons
From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
The permuted analogues of three Catalan sets
A bijection on ordered trees and its consequences
Many non-equivalent realizations of the associahedron
Application of Faà di Bruno's formula in characterization of inverse relations
Brown's theorem and its application for enumeration of dissections and planar trees
On the number of crossing-free partitions
The cycle lemma and some applications
Seven (lattice) paths to log-convexity
Logarithmic superconformal minimal models
Chords, trees and permutations
A short proof of an identity of Touchard's concerning Catalan numbers
Bijective recurrences for Motzkin paths
On general dissections of a polygon
ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE
Identities from representation theory
On the cell-growth problem for arbitrary polygons
Generalized noncrossing partitions and combinatorics of Coxeter groups
Crossing-free perfect matchings in wheel point sets
Some more properties of Catalan numbers
Combinatorial aspects of boundary loop models
Potts model partition functions for self-dual families of strip graphs
Algorithms for counting minimum-perimeter lattice animals
Functional Composition Patterns and Power Series Reversion
Counting cycles on planar graphs in subexponential time
The number of decision sets involving n means
On the complexity of Jensen's algorithm for counting fixed polyominoes
Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
A half-normal distribution scheme for generating functions
Exact site-percolation probability on the square lattice
Rhyming schemes: crossings and coverings
Polynomial enumeration of multidimensional lattices
Taylor expansions for Catalan and Motzkin numbers
Raney numbers, threshold sequences and Motzkin-like paths
Enumeration of plane trees by branches and endpoints
Why Delannoy numbers?
Motzkin path decompositions of functionals in noncommutative probability
Realizability of some combinatorial sequences
Exterior corners on bargraphs of Motzkin words
Counting cycles on planar graphs in subexponential time
Supercongruences involving Motzkin numbers and central trinomial coefficients
On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
Pattern avoidance in parking functions

This page was built for publication: Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5790179)