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

Cited in

(67)

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

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)