Related papers: Han's Bijection via Permutation Codes
Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…
Consider the following partial "sorting algorithm" on permutations: take the first entry of the permutation in one-line notation and insert it into the position of its own value. Continue until the first entry is 1. This process imposes a…
We prove the existence of common fixed points for three selfmaps $T,f$ and $g$ defined on a metric space $(X,d)$ satisfying, $T$ is $(f,g)$-weakly contractive; and the pairs $(T,f)$ and $(T,g)$ are weakly compatible. Also, for such $T,f$…
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…
Little is known about the global structure of the basins of attraction of Newton's method in two or more complex variables. We make the first steps by focusing on the specific Newton mapping to solve for the common roots of $P(x,y) =…
Any permutation polynomial is an $ n $-cycle permutation. When $n$ is a specific small positive integer, one can obtain efficient permutations, such as involutions, triple-cycle permutations and quadruple-cycle permutations. These…
We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…
We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…
We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…
We establish some common fixed point results for four transformations in vector S-metric spaces by using the notion of weakly compatibility (WC) and occasionally weakly compatibility (OWC). The first theorem is proved by using the concept…
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…
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the…
We consider semidifferentiable (possibly nonsmooth) maps, acting on a subset of a Banach space, that are nonexpansive either in the norm of the space or in the Hilbert's or Thompson's metric inherited from a convex cone. We show that the…
We generalize the cosection localized Gysin map to intersection homology and Borel-Moore homology, which provides us with a purely topological construction of the Fan-Jarvis-Ruan-Witten invariants and some GLSM invariants.
The Foata bijection $\Phi : S_n \to S_n$ is extended to the bijections $\Psi : A_{n+1} \to A_{n+1}$ and $\Psi_q : S_{n+q-1} \to S_{n+q-1}$, where S_m, A_m are the symmetric and the alternating groups. These bijections imply bijective proofs…
This version is similar to math.CO/0210113. We've changed Conjectures 1.1 and 1.2 so that they cover arbitrary graphs(digraphs). Let G be an arbitrary graph(digraph). Then - in polynomial time - either an algorithm obtains a hamilton…
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…
In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…
We introduce and study a new type of mappings in metric spaces termed $n$-point Kannan-type mappings. A fixed-point theorem is proved for these mappings. In general case such mappings are discontinuous in the domain but necessarily…