Related papers: The Statistic $\mathtt{pinv}$ for Number System
Motivated by population studies of Diffusion Tensor Imaging, the paper investigates the use of mean-based and dispersion-based permutation tests to define and compute the significance of a statistical test for data taking values on…
Simple semitoric systems were classified about ten years ago in terms of a collection of invariants, essentially given by a convex polygon with some marked points corresponding to focus-focus singularities. Each marked point is endowed with…
The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…
A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…
Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…
Since the problem: "What is statistics?" is most fundamental in sceince, in order to solve this problem, there is every reason to believe that we have to start from the proposal of a worldview. Recently we proposed measurement theory (i.e.,…
Inverse statistics in economics is considered. We argue that the natural candidate for such statistics is the investment horizons distribution. This distribution of waiting times needed to achieve a predefined level of return is obtained…
A permutiple is a natural number whose representation in some base is an integer multiple of a number whose representation has the same collection of digits. A previous paper utilizes a finite-state-machine construction and its state graph…
Counting inversions is a classic and important problem in databases. The number of inversions, $K^*$, in a list $L=(L(1),L(2),\ldots,L(n))$ is defined as the number of pairs $i < j$ with $L(i) > L(j)$. In this paper, new results for this…
A novel numerical method for solving inverse scattering problem with fixed-energy data is proposed. The method contains a new important concept: the stability index of the inversion problem. This is a number, computed from the data, which…
We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the…
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…
Recently Cheng et al. (Adv. in Appl. Math. 143 (2023) 102451) generalized the inversion number to partial permutations, which are also known as Laguerre digraphs, and asked for a suitable analogue of MacMahon's major index. We provide such…
We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…
We use recurrences (alias difference equations) to prove the longstanding conjecture that the two most important permutation statistics, namely the number of inversions and the major index, are asymptotically joint-independently-normal. We…
The purpose of this paper is twofold. First, the definition of new statistical convergence with Fibonacci sequence is given and some fundamental properties of statistical convergence are examined. Second, approximation theory worked as a…
Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying…
We consider stochastic and open quantum systems with a finite number of states, where a stochastic transition between two specific states is monitored by a detector. The long-time counting statistics of the observed realizations of the…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
Using simultaneously two operator identities, we consider the inversion of the convolution operators on a rectangular. The structure of the inverse operators and of some corresponding forms, which are important in signal processing, is…