Results 1 to 10 of about 548 (213)
Enumerative Combinatorics of XX0 Heisenberg Chain [PDF]
Journal of Mathematical Sciences, 2021 In the present paper, the enumeration of a certain class of directed lattice paths is based on the analysis of dynamical correlation functions of the exactly solvable XX0 model. This model is the zero anisotropy limit of one of the basic models of the theory of integrable systems, the XXZ Heisenberg magnet.
N. M. Bogoliubov
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
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
Enumeration of Graded (3 + 1)-Avoiding Posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 The notion of (3+1)-avoidance appears in many places in enumerative combinatorics, but the natural goal of enumerating all (3+1)-avoiding posets remains open. In this paper, we enumerate \emphgraded (3+1)-avoiding posets.
Joel Lewis Brewster, Yan X Zhang
doaj +1 more source