Related papers: Involutions Restricted by 3412, Continued Fraction…
The convolution of a function with an isotropic Gaussian appears in many contexts such as differential equations, computer vision, signal processing, and numerical optimization. Although this convolution does not always have a closed form…
Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We adapt the vertical and horizontal insertion encodings of Cayley permutations to enumerate restricted growth functions, which are in bijection with unordered set partitions. For both insertion encodings, we fully classify the classes for…
We prove a new restriction theorem for semistable sheaves on varieties in all characteristics strengthening previous results. We also prove restriction theorem for strong semistability for varieties with some non-negativity constrains on…
Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In this paper we study the generating…
In this paper, we consider the evolution of an (infinitely large) population under recombination and additional evolutionary forces, modelled by a measure-valued ordinary differential equation. We provide a stochastic representation for the…
Kronheimer and Mrowka asked whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large. This question is answered affirmatively by studying a knot invariant derived from equivariant…
Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime…
We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset $\{1,1,2,2,\ldots, n,n\}$ that avoid the patterns 1212 and 2121. Their study is motivated by a known relationship between…
We show that the coefficient array of a family of Chebyshev moments defines an involution in the group of Riordan arrays. We then extend this result to certain families of $d$-orthogonal polynomials.
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential)…
Pervasive natural selection can strongly influence observed patterns of genetic variation, but these effects remain poorly understood when multiple selected variants segregate in nearby regions of the genome. Classical population genetics…
In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…
In chemistry, Cyvin-Gutman enumerates Kekul\'{e} numbers for certain benzenoids and record it as $A050446$ on OEIS. This number is exactly the two variable array $T(n,m)$ defined by the recursion $T(n, m) = T(n, m-1) +…
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…
We consider pseudo-involutions in the Riordan group where the generating function $g$ for the first column of a Riordan array satisfies a palindromic or near-palindromic functional equation. For those types of equations, we find, for very…
Solving the first nonmonotonic, longer-than-three instance of a classic enumeration problem, we obtain the generating function $H(x)$ of all 1342-avoiding permutations of length $n$ as well as an {\em exact} formula for their number…