Related papers: Most principal permutation classes have nonrationa…
Non-overlapping codes are a set of codewords in $\bigcup_{n \ge 2} \mathbb{Z}_q^n$, where $\mathbb{Z}_q = \{0,1,\dots,q-1\}$, such that, the prefix of each codeword is not a suffix of any codeword in the set, including itself; and for…
Following a question of J. Cooper, we study the expected number of occurrences of a given permutation pattern $q$ in permutations that avoid another given pattern $r$. In some cases, we find the pattern that occurs least often, (resp. most…
We study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…
We introduce a $q$-deformation that generalises in a single framework previous works on classical and enriched $P$-partitions. In particular, we build a new family of power series with a parameter $q$ that interpolates between Gessel's…
It is proved that the numerical semigroups associated to the combinatorial configurations satisfy a family of non-linear symmetric patterns. Also, these numerical semigroups are studied for two particular classes of combinatorial…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
A generalized Nevanlinna function $Q(z)$ with one negative square has precisely one generalized zero of nonpositive type in the closed extended upper halfplane. The fractional linear transformation defined by $Q_\tau(z)=(Q(z)-\tau)/(1+\tau…
A restricted growth function (RGF) of length n is a sequence w = w_1 w_2 ... w_n of positive integers such that w_1 = 1 and w_i is at most 1 + max{w_1,..., w_{i-1}} for i at least 2. RGFs are of interest because they are in natural…
We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…
It is shown that the sequence of rational numbers $r(k)$ generated by the ordinary generating function $\prod_{k=1}^\infty (1+x^k/k)$ converges to a limit $C > 0$. $C$ can be expressed as $C = \exp\Bigl(-\sum_{k = 2}^\infty…
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…
We obtain new non-existence results of generalized bent functions from \ZZ^n_q to \ZZ_q (called type [n,q]). The first case is a class of types where q=2p_1^{r_1}p_2^{r_2}. The second case contains two types [1 <= n <= 3, 2 * 31^e]$ and [1…
A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…
Motivated by earlier work of P.~A.~MacMahon and recent contributions of T.~Amdeberhan, G.~E.~Andrews, K.~Ono, A.~Singh, and R.~Tauraso on higher-order partition enumerants, we study a class of $q$-series arising from nested divisor…
Representations of $SO(5)_{q}$ can be constructed on bases such that either the Chevalley triplet $(e_{1},\;f_{1},\;h_{1})$ or $(e_{2},\;f_{2},\;h_{2})$ has the standard $SU(2)_{q}$ matrix elements. The other triplet in each cases has a…
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…
In this paper, we develop some basic techniques towards the Riemann hypothesis for higher rank non-abelian zeta functions of an integral regular projective curve of genus $g$ over a finite field $\mathbb F_q$. As an application of the…
It is known that the notion of a transitive subgroup of a permutation group $G$ extends naturally to subsets of $G$. We consider subsets of the general linear group $\operatorname{GL}(n,q)$ acting transitively on flag-like structures, which…
We consider GL_n(F_q)-analogues of certain factorization problems in the symmetric group S_n: rather than counting factorizations of the long cycle (1, 2, ..., n) given the number of cycles of each factor, we count factorizations of a…
Given coprime positive integers $g_1 < \ldots < g_e$, the Frobenius number $F=F(g_1,\ldots,g_e)$ is the largest integer not representable as a linear combination of $g_1,\ldots,g_e$ with non-negative integer coefficients. Let $n$ denote the…