Related papers: The Foata correspondence, cycle lengths and anomal…
The paper presents a unified approach to different fluctuation relations for classical nonequilibrium dynamics described by diffusion processes. Such relations compare the statistics of fluctuations of the entropy production or work in the…
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 the notion of filtration between topologies and study its stabilization properties. Descriptive set theoretic complexity plays a role in this study. Filtrations lead to natural transfinite sequences approximating a given…
In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…
A recent paper [R22] established "Frobenius reciprocity" as a bijection $t$ between certain symplectically reduced spaces (which need not be manifolds), and conjectured: 1{\deg}) $t$ is a diffeomorphism when these spaces are endowed with…
The paper concerns a simple model of bicycle kinematics: a bicycle is represented by an oriented segment of constant length in n-dimensional space that can move in such a way that the velocity of its rear end is aligned with the segment…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
The odd diagram of a permutation is a subset of the classical diagram with additional parity conditions. In this paper, we study classes of permutations with the same odd diagram, which we call odd diagram classes. First, we prove a…
For any regular cardinal $\kappa$ and ordinal $\eta<\kappa^{++}$ it is consistent that $2^{\kappa}$ is as large as you wish, and every function $f:\eta \to [\kappa,2^{\kappa}]\cap Card$ with $f(\alpha)=\kappa$ for $cf(\alpha)<\kappa$ is the…
We give a bijective proof of a conjecture of Regev and Vershik on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture,…
In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…
We introduce a new geometric structure on differentiable manifolds. A \textit{Contact} \textit{Pair}on a manifold $M$ is a pair $(\alpha,\eta) $ of Pfaffian forms of constant classes $2k+1$ and $2h+1$ respectively such that $\alpha\wedge…
In this paper the theorems that determine composition laws for both cardinal ordering permutations and their inverses are proven. So, the relative positions of points in a hs-periodic orbit become completely known as well as in which order…
A number of physical processes show some form of bifurcation or periodic splintering of a single distribution into two new ones. Recently, it has been noted that cavity searches for interactions between photons and exotic fields may also…
The fundamental bijection is a bijection $\theta:\mathcal{S}_n\to\mathcal{S}_n$ in which one uses the standard cycle form of one permutation to obtain another permutation in one-line form. In this paper, we enumerate the set of permutations…
Permutations that avoid given patterns are among the most classical objects in combinatorics and have strong connections to many fields of mathematics, computer science and biology. In this paper we study fixed points of both 123- and…
We study random bubble lattices which can be produced by processes such as first order phase transitions, and derive characteristics that are important for understanding the percolation of distinct varieties of bubbles. The results are…