Related papers: Signed words and permutations, IV; Fixed and pixed…
Stirling number of the first and the second kinds have seen many generalizations and applications in various areas of mathematics. We introduce some combinatorial parameters which realize $q$-analogues and Broder's $r$-variants of Stirling…
The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…
In this paper, we characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems, which generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including flag descent…
We introduce a statistic $\pmaj$ on partitions of $[n]=\{1,2,..., n\}$, and show that it is equidistributed with the number of 2-crossings over partitions of $[n]$ with given sets of minimal block elements and maximal block elements. This…
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…
Four recursive constructions of permutation polynomials over $\gf(q^2)$ with those over $\gf(q)$ are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over…
The bicategory of parameterized spectra has a remarkably rich structure. In particular, it is possible to take traces in this bicategory, which give classical invariants that count fixed points. We can also take equivariant traces, which…
Given a polynomial \( H(x) \) over \(\mathbb{F}_{q^n}\), we study permutation polynomials of the form \( x + \gamma \mathrm{Tr}(H(x)) \) over \(\mathbb{F}_{q^n}\). Let \[P_H=\{\gamma\in \mathbb{F}_{q^n} : x+\gamma \mathrm{Tr}(H(x))~\text{is…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
In this paper, we introduce an inversion statistic on the hyperoctahedral group $B_n$ by using an decomposition of a positive root system of this reflection group. Then we prove some combinatorial properties for the inversion statistic. We…
In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…
In this paper, we construct a mixed-base number system over the generalized symmetric group $G(m,1,n)$, which is a complex reflection group with a root system of type $B_n^{(m)}$. We also establish one-to-one correspondence between all…
Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…
Given a hyperbolic quadric of PG(5,2), there are 28 points off this quadric and 56 lines skew to it. It is shown that the $(28_6, 56_3)$-configuration formed by these points and lines is isomorphic to the combinatorial Grassmannian of type…
Noticing that some recent variations of descent polynomials are special cases of Carlitz and Scoville's four-variable polynomials, which enumerate permutations by the parity of descent and ascent positions, we prove a $q$-analogue of…
In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…
The {\em sign pattern} defined by the real polynomial $Q:=\Sigma _{j=0}^da_jx^j$, $a_j\neq 0$, is the string $\sigma (Q):=({\rm sgn(}a_d{\rm )},\ldots ,{\rm sgn(}a_0{\rm )})$. The quantities $pos$ and $neg$ of positive and negative roots of…
Laminations are a combinatorial and topological way to study Julia sets. Laminations give information about the structure of parameter space of degree $d$ polynomials with connected Julia sets. We first study fixed point portraits in…