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

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)