相关论文: Elliptic enumeration of nonintersecting lattice pa…
We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…
The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…
We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…
Non-negative {\L}ukasiewicz paths are special two-dimensional lattice paths never passing below their starting altitude which have only one single special type of down step. They are well-known and -studied combinatorial objects, in…
Given six points $A,B,C,D,E,F$ on a nonsingular conic in the complex projective plane, Pascal's theorem says that the three intersection points $AE \cap BF, BD \cap CE, AD \cap CF$ are collinear. The line containing them is called a pascal,…
The purpose of the paper is to complete several global and local results concerning parity of ranks of elliptic curves. Primarily, we show that the Shafarevich-Tate conjecture implies the parity conjecture for all elliptic curves over…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
We enumerate rational curves in toric surfaces passing through points and satisfying cross-ratio constraints using tropical and combinatorial methods. Our starting point is arXiv:1509.07453, where a tropical-algebraic correspondence theorem…
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…
Given two semistable, non potentially isotrivial elliptic surfaces over a curve $C$ defined over a field of characteristic zero or finitely generated over its prime field, we show that any compatible family of effective isometries of the…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
We show how a formula concerning ``vicious walkers'' (which basically are nonintersecting lattice paths) on the cylinder given by P.J. Forrester can be proved and generalized by using the Lindstr\"om--Gessel--Viennot method, after having…
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…
We study the integer sequence v_n of numbers of lines in hypersurfaces of degree 2n-3 of P^n, n>1. We prove a number of congruence properties of these numbers of several different types. Furthermore, the asymptotics of the v_n are described…
We prove a conjecture of Kontsevich, which asserts that the iterations of the noncommutative rational map $F_r:(x,y)-->(xyx^{-1},(1+y^r)x^{-1})$ are given by noncommutative Laurent polynomials with nonnegative integer coefficients.