Enumerative Combinatorics of Lattice Polymers
DOI: https://doi.org/10.1090/noti2255 physicists who appreciatemathematical beauty), the physicallymotivatedmodels aremathematically appealing, and have rich combinatorial structure. The third reason is that it is just a really fun research topic.
Nathan Clisby
semanticscholar +4 more sources
Enumerative Combinatorics [PDF]
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It is strongly connected to the probabilistic analysis of large combinatorial structures and has fruitful connections to several disciplines, including statistical physics, algebraic combinatorics, graph theory and computer science.
Mireille Bousquet-Mélou +3 more
semanticscholar +4 more sources
Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs [PDF]
In this paper, we present a general methodology to solve a wide variety of classical lattice path counting problems in a uniform way. These counting problems are related to Dyck paths, Motzkin paths and some generalizations. The methodology uses weighted
R. De Castro, A. Ramírez, J.L. Ramírez
doaj +3 more sources
Enumerative Combinatorics of Intervals in the Dyck Pattern Poset [PDF]
We initiate the study of the enumerative combinatorics of the intervals in the Dyck pattern poset. More specifically, we find some closed formulas to express the size of some specific intervals, as well as the number of their covering relations.
Antonio Bernini +3 more
openalex +3 more sources
Computer Algebra in the Service of Enumerative Combinatorics
Classifying lattice walks in restricted lattices is an important problem in enumerative combinatorics. Recently, computer algebra has been used to explore and to solve a number of difficult questions related to lattice walks.
Alin Bostan
openalex +3 more sources
Selected non-holonomic functions in lattice statistical mechanics and enumerative combinatorics [PDF]
We recall that the full susceptibility series of the Ising model, modulo powers of the prime 2, reduce to algebraic functions. We also recall the non-linear polynomial differential equation obtained by Tutte for the generating function of the q-coloured ...
Boukraa, S., Maillard, J-M.
core +3 more sources
Enumerative Geometry Meets Statistics, Combinatorics, and Topology [PDF]
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.
M. Michałek
openaire +3 more sources
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems [PDF]
This paper considers three separate matrices associated to graphs and (each dimension of) cell complexes. It relates all the coefficients of their respective characteristic polynomials to the geometric and combinatorial enumeration of three kinds of sub ...
Sylvain E. Cappell, Edward Y. Miller
semanticscholar +4 more sources
Enumerative and Algebraic Combinatorics in the 1960's and 1970's [PDF]
The period 1960–1979 was an exciting time for enumerative and algebraic combinatorics (EAC). During this period EAC was transformed into an independent subject which is even stronger and more active today.
Richard P. Stanley
openalex +3 more sources
An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics [PDF]
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics.
Felix Breuer
openalex +3 more sources

