Related papers: Rational generating series for affine permutation …
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…
Motivated by the recent proof of the Stanley-Wilf conjecture, we study the asymptotic behavior of the number of permutations avoiding a generalized pattern. Generalized patterns allow the requirement that some pairs of letters must be…
In this paper, we revisit the application of generating trees to the pattern avoidance problem for permutations. In particular, we study this problem for certain general sets of patterns and propose a new procedure leveraging the FinLabel…
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate…
We study the question whether the affine semigroup of integer points in a convex cone can be finitely generated up to symmetries of the cone. We establish general properties of finite generation up to symmetry, and then concentrate on the…
We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…
Nonnesting permutations are permutations of the multiset $\{1,1,2,2,\dots,n,n\}$ that avoid subsequences of the form $abba$ for any $a\neq b$. These permutations have recently been studied in connection to noncrossing (also called…
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…
In this note, we identify a natural class of subsets of affine Weyl groups whose Poincare series are rational functions. This class includes the sets of minimal coset representatives of reflection subgroups. As an application, we construct…
Sequences that are defined by multisums of hypergeometric terms with compact support occur frequently in enumeration problems of combinatorics, algebraic geometry and perturbative quantum field theory. The standard recipe to study the…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
We present some combinatorial interpretations for coefficients appearing in series partitioning the permutations avoiding 132 along marked mesh patterns. We identify for patterns in which only one parameter is non zero the combinatorial…
We enumerate several classes of pattern-avoiding rectangulations. We establish new bijective links with pattern-avoiding permutations, prove that their generating functions are algebraic, and confirm several conjectures by Merino and…
We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…
We construct derived fundamental group schemes for Tate motives over connected smooth schemes over fields. We show that there exists a pro affine derived group scheme over the rationals such that its category of perfect representations…
We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern.…
We derive the algebraic generating function for inversion sequences avoiding the patterns $201$ and $210$ by describing a set of succession rules, converting them to a system of generating function equations with one catalytic variable, and…