Results 41 to 50 of about 11,738 (234)
New directions in enumerative chess problems [PDF]
, 2005 Normally a chess problem must have a unique solution, and is deemed unsound even if there are alternatives that differ only in the order in which the same moves are played.
Elkies, Noam D.
core +1 more source
, 2019 The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry.
Allen Hatcher +36 more
core +1 more source
A curious polynomial interpolation of Carlitz-Riordan's $q$-ballot numbers [PDF]
, 2013 We study a polynomial sequence $C_n(x|q)$ defined as a solution of a $q$-difference equation. This sequence, evaluated at $q$-integers, interpolates Carlitz-Riordan's $q$-ballot numbers.
Chapoton, Frédéric, Zeng, Jiang
core +4 more sources
Enumerative Geometry Meets Statistics, Combinatorics, and Topology
Notices of the American Mathematical Society, 2023 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.
openaire +2 more sources
Existence and orthogonality of stable envelopes for bow varieties
Bulletin of the London Mathematical Society, EarlyView.Abstract Stable envelopes, introduced by Maulik and Okounkov, provide a family of bases for the equivariant cohomology of symplectic resolutions. They are part of a fascinating interplay between geometry, combinatorics and integrable systems. In this expository article, we give a self‐contained introduction to cohomological stable envelopes of type A$A$
Catharina Stroppel, Till Wehrhan
wiley +1 more source
Enumeration of simple random walks and tridiagonal matrices
, 2002 We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration of weighted ...
Bauer M +23 more
core +1 more source
Indiscernibles in monadically NIP theories
Bulletin of the London Mathematical Society, EarlyView.Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley +1 more source
Transitive factorizations of permutations and geometry [PDF]
, 2014 We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of curves.
Goulden, I. P., Jackson, D. M.
core
Estimates on the decay of the Laplace–Pólya integral
Bulletin of the London Mathematical Society, EarlyView.Abstract The Laplace–Pólya integral, defined by Jn(r)=1π∫−∞∞sincntcos(rt)dt$J_n(r) = \frac{1}{\pi }\int _{-\infty }^\infty \operatorname{sinc}^n t \cos (rt) \,\mathrm{d}t$, appears in several areas of mathematics. We study this quantity by combinatorial methods; accordingly, our investigation focuses on the values at integer rs$r{\rm s}$.
Gergely Ambrus, Barnabás Gárgyán
wiley +1 more source
Promotion of Lattice Paths by Riordan Arrays
MathematicsThis paper investigates the use of Riordan arrays in the enumeration and transformation of lattice paths through a combinatorial framework of promotion.
Aoife Hennessy +3 more
doaj +1 more source