Results 81 to 90 of about 11,631 (230)

Enumerative properties of generalized associahedra

, 2004
Some enumerative aspects of the fans, called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras are considered, in relation with a bicomplex and its two spectral sequences.
Chapoton, Frederic
core   +3 more sources

A complete enumeration of Ballot permutations avoiding sets of small patterns [PDF]

Enumerative Combinatorics and Applications, 2022
Nathan Sun
doaj   +1 more source

Spectral Decomposition of Discrepancy Kernels on the Euclidean Ball, the Special Orthogonal Group, and the Grassmannian Manifold. [PDF]

Constr Approx, 2023
Dick J, Ehler M, Gräf M, Krattenthaler C.   +3 more
europepmc   +1 more source

Enumerative and planar combinatorics of trivariate monomial resolutions

, 2020
The canonical sylvan resolution is a resolution of an arbitrary monomial ideal over a polynomial ring that is minimal and has an explicit combinatorial formula for the differential. The differential is a weighted sum over lattice paths of weights of chain-link fences, which are sequences of faces that are linked to each other via higher-dimensional ...
openaire   +2 more sources

Enumeration of binary trees compatible with a perfect phylogeny. [PDF]

J Math Biol, 2022
Palacios JA, Bhaskar A, Disanto F, Rosenberg NA.   +3 more
europepmc   +1 more source

Enumerating Stable Nanopores in Graphene and their Geometrical Properties Using the Combinatorics of Hexagonal Lattices

, 2022
Sneha Thomas, Kevin S. Silmore, Ananth Govind Rajan   +2 more
openalex   +2 more sources

Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems [PDF]

, 2018
Sylvain E. Cappell, Edward Y. Miller
openalex   +1 more source

Enumerative Combinatorics and Shannon's Theory of Discrete Noiseless Channels

Electronic Notes in Discrete Mathematics, 2001
Abstract Abstract In this paper we demonstrate the application of combinatorial techniques as a way to finding the Shannon capacity of the discrete noiseless channel.
Cecilio Pimentel, Bartolomeu F. Uchoa-Filho   +1 more
openaire   +2 more sources

Fundamental polytopes of metric trees via parallel connections of matroids

, 2019
We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and, for tree-like
Delucchi, Emanuele, Hoessly, Linard
core  

Interview with Anne Schilling [PDF]

Enumerative Combinatorics and Applications, 2023
ECA
doaj   +1 more source