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

Related Items (57)

Application of Faà di Bruno's formula in characterization of inverse relations ⋮ A new combinatorial interpretation for generalized Catalan number ⋮ 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 ⋮ The number of decision sets involving n means ⋮ ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE ⋮ Raney numbers, threshold sequences and Motzkin-like paths ⋮ Many non-equivalent realizations of the associahedron ⋮ On the number of crossing-free partitions ⋮ Packing 1-plane Hamiltonian cycles in complete geometric graphs ⋮ A half-normal distribution scheme for generating functions ⋮ Critical site percolation on the triangular lattice: from integrability to conformal partition functions ⋮ Counting cycles on planar graphs in subexponential time ⋮ Integrability properties of Motzkin polynomials ⋮ Rhyming schemes: crossings and coverings ⋮ Counting cycles on planar graphs in subexponential time ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ Algorithms for counting minimum-perimeter lattice animals ⋮ On the enumeration of planar trees of hexagons ⋮ Motzkin algebras ⋮ On the complexity of Jensen's algorithm for counting fixed polyominoes ⋮ A bijection on ordered trees and its consequences ⋮ Logarithmic superconformal minimal models ⋮ Motzkin numbers ⋮ 0-Calabi-Yau configurations and finite Auslander-Reiten quivers of Gorenstein orders ⋮ Deux propriétés combinatoires des nombres de Schröder ⋮ Functional Composition Patterns and Power Series Reversion ⋮ Some more properties of Catalan numbers ⋮ Motzkin algebras and the An tensor categories of bimodules ⋮ Chords, trees and permutations ⋮ Brown's theorem and its application for enumeration of dissections and planar trees ⋮ The permuted analogues of three Catalan sets ⋮ Seven (lattice) paths to log-convexity ⋮ Structural properties of Potts model partition functions and chromatic polynomials for lattice strips ⋮ 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 ⋮ Potts model partition functions for self-dual families of strip graphs ⋮ Binomial self-inverse sequences and tangent coefficients ⋮ Unnamed Item ⋮ Patterns in trees ⋮ Restricted plane tree representations of four Motzkin-Catalan equations ⋮ Bijective recurrences for Motzkin paths ⋮ Polynomial enumeration of multidimensional lattices ⋮ On general dissections of a polygon ⋮ The cycle lemma and some applications ⋮ Identities from representation theory ⋮ Combinatorial aspects of boundary loop models ⋮ Generalized noncrossing partitions and combinatorics of Coxeter groups ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ Why Delannoy numbers? ⋮ Catalan, Motzkin, and Riordan numbers ⋮ Unusual area-law violation in random inhomogeneous systems ⋮ Taylor expansions for Catalan and Motzkin numbers ⋮ Motzkin path decompositions of functionals in noncommutative probability

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