Related papers: Divergent permutations
We show that the left (right) sample quantile tends to the left (right) distribution quantile at p in [0,1], if the left and right quantiles are identical at p. We show that the sample quantiles diverge almost surely otherwise. The latter…
Interval graphs and interval orders are deeply linked. In fact, edges of an interval graphs represent the incomparability relation of an interval order, and in general, of different interval orders. The question about the conditions under…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
A permutiple is a natural number whose representation in some base, $b>1$, is an integer multiple of a number whose base-$b$ representation has the same collection of digits. Previous efforts have made progress in finding such numbers using…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We investigate bicomplex analogues of fundamental notions from classical algebraic number theory. In particular, we show that the primitive element theorem admits a natural generalization to bicomplex extensions, giving rise to two distinct…
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…
We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.
A graph G is said to be 2-distinguishable if there is a 2-labeling of its vertices which is not preserved by any nontrivial automorphism of G. We show that every locally finite graph with infinite motion and growth at most…
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…
A graph labeling assigns values to the components of a graph (vertices, edges, etc.). In particular, distance magic labelings have been widely studied in undirected graphs. In such a labeling, the vertices are labeled with unique values…
The principal filtration of the infinite-dimensional odd Contact Lie superalgebra over a field of characteristic $p>2$ is proved to be invariant under the automorphism group by investigating ad-nilpotent elements and determining certain…
There is only one fully supported ergodic invariant probability measure for the adic transformation on the space of infinite paths in the graph that underlies the Eulerian numbers. This result may partially justify a frequent assumption…
In deformations of polynomial functions one may encounter ``singularity exchange at infinity'' when singular points disappear from the space and produce ``virtual'' singularities which have an influence on the topology of the limit…
We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets…
For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…
In this paper, using the well known fact that the series of reciprocals of primes diverges, we obtain a general inequality for gaps of consecutive primes that holds for infinitely many primes. As it is shown the key ingredient for this…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
In the simple case of a Bernoulli shift on two symbols, zero and one, by permuting the symbols, it is obvious that any two equal entropy shifts are isomorphic. We show that the isomorphism can be realized by a factor that maps a binary…
This paper develops a new divergence that generalizes relative entropy and can be used to compare probability measures without a requirement of absolute continuity. We establish properties of the divergence, and in particular derive and…