Related papers: Element order versus minimal degree in permutation…
We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…
When $\{\alpha_i\}_{1 \leq i \leq m}$ is a sequence of distinct non-zero elements of an integral domain $A$ and $\gamma$ is a common multiple of the $\alpha_i$ in $A$ we obtain, by means of a simple identity for the Vandermonde determinant,…
We study the reconstruction problem of permutation sequences from their $k$-minors, which are subsequences of length $k$ with entries renumbered by $1,2,\ldots,k$ preserving order. We prove that the minimum number $k$ such that any…
We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…
Generalizing a result in the theory of finite fields we prove that, apart from a couple of exceptions that can be classified, for any elements $a_1,...,a_m$ of the cyclic group of order $m$, there is a permutation $\pi$ such that…
We consider the problem of detecting the presence of a submatrix with larger-than-usual values in a large data matrix. This problem was considered in (Butucea and Ingster, 2013) under a one-parameter exponential family, and one of the test…
We characterise those classes of permutations having the property that for every tableau shape either every permutation of that shape or no permutation of that shape belongs to the class. The characterisation is in terms of the dominance…
This study was aimed to consider the NG-group that consisting of transformations on a nonempty set A has no bijection as its element. In addition, it tried to find the maximal order of these groups. It found the order of NG-group not…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the…
In phylogenetic analysis, for non-molecular data, particularly morphology, parsimony optimization is the most commonly employed approach. In the past and present application of the parsimony principle, extra step numbers have been added…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…
The present paper is devoted to the study of classes of mappings with non--bounded characteristics of quasiconformality. It is proved that the normal families of mappings distorting the families of mappings in ${\Bbb R}^n$ by special way,…
Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…
In this paper, we provide an upper bound for the number of one-element commutation classes of a permutation, that is, the number of reduced words in which no commutation can be applied. Using this upper bound, we prove a conjecture that…
By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
If $f(p, n)$ is the number of pairwise nonisomorphic groups of order $p^n$, and $g(p,n)$ is the number of groups of order $p^n$ whose automorphism group is a $p$-group, then, for $n \leq 7$, we prove that the ratio $g(p,n)/f (p,n)$ is…
We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size $N$ requires size $2^{\Omega(\sqrt[7]{N/logN})}$ to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…