Results 11 to 20 of about 518 (190)
An Extension of the Exponential Formula in Enumerative Combinatorics [PDF]
The Electronic Journal of Combinatorics, 1995 Let $\alpha$ be a formal variable and $F_w$ be a weighted species of structures (class of structures closed under weight-preserving isomorphisms) of the form ${F}_{w} = E({F}_{w}^{c})$, where $E$ and $F_w^c$ respectively denote the species of sets and of connected $F_w$-structures.
Gilbert Labelle, Pierre Leroux
openalex +3 more sources
Software for enumerative and analytic combinatorics
, 2016 We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P lya theory, combinatorial species, and asymptotics.
Andrew MacFie
openalex +4 more sources
Tests and Proofs for Enumerative Combinatorics [PDF]
, 2016 In this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification. We formalize in Coq the combinatorial structures of permutations and maps, and a couple of related operations. Before formally proving soundness theorems about these operations, we first validate them, by using logic programming (
Catherine Dubois +2 more
openalex +4 more sources
Algebraic and geometric methods in enumerative combinatorics [PDF]
, 2014 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
Federico Ardila
openalex +3 more sources
Enumerative geometry meets statistics, combinatorics and topology
Notices of the American Mathematical Society, 2022 We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of Lorentzian polynomials. The main concept joining the mentioned fields is a linear space of matrices.
Mateusz Michałek
openalex +4 more sources
A challenge in enumerative combinatorics: The graph of contribution
, 2002 One LaTex file, 63 pages In honor of F.Y. Wu on the occasion of his 70th birthday. Statphys-Taiwan 2002. The second APCTP and sixth Taiwan International Symposium on Statistical Physics.
J-M Maillard
openalex +4 more sources
Enumerative combinatorics on determinants and signed bigrassmannian polynomials
, 2019 As an application of linear algebra for enumerative combinatorics, we introduce two new ideas, signed bigrassmannian polynomials and bigrassmannian determinant. First, a signed bigrassmannian polynomial is a variant of the statistic given by the number of bigrassmannian permutations below a permutation in Bruhat order as Reading suggested (2002) and ...
Masato Kobayashi
openalex +5 more sources
Book Review: Enumerative combinatorics, Volume 2 [PDF]
Bulletin of the American Mathematical Society, 2001 Ira M. Gessel
openalex +3 more sources
Book Review: Enumerative combinatorics, vol. I [PDF]
Bulletin of the American Mathematical Society, 1987 George E. Andrews
openalex +4 more sources
THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G [PDF]
Journal of Algebraic Systems, 2020 To a simple graph $G=(V,E)$, we correspond a simple graph $G_{\triangle,\square}$ whose vertex set is $\{\{x,y\}: x,y\in V\}$ and two vertices $\{x,y\},\{z,w\}\in G_{\triangle,\square}$ are adjacent if and only if $\{x,z\},\{x,w\},\{y,z\},\{y,w\}\in V ...
Gh. A. Nasiriboroujeni +2 more
doaj +1 more source