Related papers: Rational generating series for affine permutation …
The aim of this article is to show the existence, and also give an explicit construction, of infinite sets of orthogonal exponentials for certain families of convex polytopes which include simple-rational polytopes and also non simple…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
An element w of a Coxeter group W is said to be fully commutative, if any reduced expression of w can be obtained from any other by transposing adjacent pairs of generators. These elements were described in 1996 by Stembridge in the case of…
We show that if a Laurent series $f\in\mathbb{C}((t))$ satisfies a particular kind of linear iterative equation, then $f$ is either a rational function or it is differentially transcendental over $\mathbb{C}(t)$. This condition is more…
We determine the structure of permutations avoiding the patterns 4213 and 2143. Each such permutation consists of the skew sum of a sequence of plane trees, together with an increasing sequence of points above and an increasing sequence of…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
The generating series of a radix-rational sequence is a rational formal power series from formal language theory viewed through a fixed radix numeration system. For each radix-rational sequence with complex values we provide an asymptotic…
In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
Assuming standard conjectures, we show that the canonical symmetrizing trace evaluated at powers of a Coxeter element produces rational Catalan numbers for irreducible spetsial complex reflection groups. This extends a technique used by…
Each positive increasing integer sequence $\{a_n\}_{n\geq 0}$ can serve as a numeration system to represent each non-negative integer by means of suitable coefficient strings. We analyse the case of $k$-generalized Fibonacci sequences…
Certain results on representations of quivers have analogs in the structure theory of general Coxeter groups. A fixed Coxeter element turns the Coxeter graph into an acyclic quiver, allowing for the definition of a preprojective root. A…
We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…
We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…
We prove that the class of permutations generated by passing an ordered sequence $12\dots n$ through a stack of depth 2 and an infinite stack in series is in bijection with an unambiguous context-free language, where a permutation of length…
The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…
Classical pattern avoidance and occurrence are well studied in the symmetric group $\mathcal{S}_{n}$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in…
Symmetry-informed machine learning can exhibit advantages over machine learning which fails to account for symmetry. In the context of continuous symmetry detection, current state of the art experiments are largely limited to detecting…
Every set of natural numbers determines a generating function convergent for $q \in (-1,1)$ whose behavior as $q \rightarrow 1^-$ determines a germ. These germs admit a natural partial ordering that can be used to compare sizes of sets of…
The past decade has seen a flurry of research into pattern avoiding permutations but little of it is concerned with their exhaustive generation. Many applications call for exhaustive generation of permutations subject to various constraints…