Related papers: A simple explicit bijection between (n,2) Gog and …
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…
The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…
In this paper, we construct a bijection from a set of bounded free Motzkin paths to a set of bounded Motzkin prefixes that induces a bijection from a set of bounded free Dyck paths to a set of bounded Dyck prefixes. We also give bijections…
A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term…
In this article it is shown that there is no continuous bijection from $\mathbb{R}^n$ onto $\mathbb{R}^2$ for $n\neq 2$ by an elementary method. This proof is based on showing that for any cardinal number $\beta\leq 2^{\aleph_0}$, there is…
We give a new explicit construction for the simplicial group $K(A,n)$. We explain the topological interpretation and discuss some possible applications.
This is a footnote to earlier joint work with Yu. Berest, which constructed a bijection between the space of ideal classes of the Weyl algebra and a union of Calogero-Moser varieties. A key property of this bijection is that it is…
In arXiv:1905.07734 we presented a construction that is an analogue of Pontryagin's for proper maps in stable dimensions. This gives a bijection between the cobordism set of framed embedded compact submanifolds in $W\times\mathbb{R}^n$ for…
When $G$ is a real reductive group and $G_0$ is its Cartan motion group, the Mackey-Higson bijection is a natural one-to-one correspondence between all irreducible tempered representations of $G$ and all irreducible unitary representations…
Lattice paths are important tools on solving some combinatorial identities. This note gives a new bijection between unbalanced Dyck path (a path that never reaches the diagonal of the lattice) and NE (North and East only) lattice path from…
The subject of this note is a challenging conjecture about X-rays of permutations which is a special case of a conjecture regarding Skolem sequences. In relation to this, Brualdi and Fritscher [Linear Algebra and its Applications, 2014]…
A complete mapping of a group $G$ is a bijection $\phi\colon G\to G$ such that $x\mapsto x\phi(x)$ is also bijective. Hall and Paige conjectured in 1955 that a finite group $G$ has a complete mapping whenever $\prod_{x\in G} x$ is the…
MacMahon enumerated the plane partitions in an $a \times b \times c$ box. These are in bijection to lozenge tilings of a hexagon, to certain perfect matchings, and to families of non-intersecting lattice paths. In this work we consider more…
We construct a natural bijection between the set of admissible pictures and the set of $U_q(gl(m,n))$-Littlewood-Richardson tableaux.
Given $n$ point masses turning in a plane at a constant speed, this paper deals with the global bifurcation of periodic solutions for the masses, in that plane and in space. As a special case, one has a complete study of n identical masses…
A long-standing open conjecture of Branko Gr\"unbaum from 1972 states that any simple arrangement of $n$ pairwise intersecting pseudocircles in the plane can have at most $2n-2$ digons. Agarwal et al. proved this conjecture for arrangements…
This paper investigates the impossibility of certain $({n^2+n+k}_{n+1})$ configurations. Firstly, for $k=2$, the result of \cite{gropp1992non} that $\frac{n^2+n}{2}$ is even and $n+1$ is a perfect square or $\frac{n^2+n}{2}$ is odd and…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…