Related papers: Permutations with Extremal number of Fixed Points
The numerical approximation of an inverse problem subject to the convection--diffusion equation when diffusion dominates is studied. We derive Carleman estimates that are on a form suitable for use in numerical analysis and with explicit…
Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…
This paper does three things: It proves a central limit theorem for novel permutation statistics (for example, the number of descents plus the number of descents in the inverse). It provides a clear illustration of a new approach to proving…
Statistical modelling of spatial extreme events has gained increasing attention over the last few decades with max-stable processes, and more recently $r$-Pareto processes, becoming the reference tools for the statistical analysis of…
In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
The paper proposes another extension of the extremal principle. A new extremality model involving collections of arbitrary families of sets is studied. It generalizes the conventional model based on linear translations of given sets as well…
Let $T_n$ be the set of 321-avoiding permutations of order $n$. Two properties of $T_n$ are proved: (1) The {\em last descent} and {\em last index minus one} statistics are equidistributed over $T_n$, and also over subsets of permutations…
In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic…
It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
We show that the number of signed permutations avoiding 1234 equals the number of signed permutations avoiding 2143 (also called vexillary signed permutations), resolving a conjecture by Anderson and Fulton. The main tool that we use is the…
The Eulerian numbers count permutations according to the number of descents. The two-sided Eulerian numbers count permutations according to number of descents and the number of descents in the inverse permutation. Here we derive some…
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…
This paper gives a new representation of Pickands' constants, which arise in the study of extremes for a variety of Gaussian processes. Using this representation, we resolve the long-standing problem of devising a reliable algorithm for…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
The paper explores a new extremality model involving collections of arbitrary families of sets. We demonstrate its applicability to set-valued optimization problems with general preferences, weakening the assumptions of the known results…
This paper deals with the solving of variational inequality problem where the constrained set is given as the intersection of a number of fixed-point sets. To this end, we present an extrapolated sequential constraint method. At each…
A new characterization of the exponential distribution is obtained. It is based on an equation involving randomly shifted (translated) order statistics. No specific distribution is assumed for the shift random variables. The proof uses a…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…