Related papers: Inversions and the Gog-Magog problem

We use sign-reversing involutions to solve two computational problems that arise naturally in the geometry of moduli spaces of curves. In particular, we give an explicit combinatorial formula for arbitrary $\psi$ class intersection products…

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but no bijective proof for any of these equivalences has been…

We provide two explicit bijections demonstrating that, among permutations, the number of invisible inversions is equidistributed with the number of occurrences of the vincular pattern 13-2 after sorting the set of runs.

We study the homogeneous involutions on the full square matrices over an algebraically closed field endowed with a division grading with commutative support. We obtain the classification of the isomorphism and equivalence classes for the…

We survey recent results on inverse problems for geodesic X-ray transforms and other linear and non-linear geometric inverse problems for Riemannian metrics, connections and Higgs fields defined on manifolds with boundary.

Alternating sign triangles have been introduced by Ayyer, Behrend and Fischer in 2016 and it was proven that there is the same number of alternating sign triangles with $n$ rows as there is of $n\times n$ alternating sign matrices. Later on…

Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane…

Using the theory of Properly Embedded Graphs developed in an earlier work we define an involutory duality on the set labeled non-crossing trees that lifts the obvious duality in the set of unlabeled non-crossing trees. The set of…

Recently Cheng et al. (Adv. in Appl. Math. 143 (2023) 102451) generalized the inversion number to partial permutations, which are also known as Laguerre digraphs, and asked for a suitable analogue of MacMahon's major index. We provide such…

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

Let $V$ be a vertex operator algebra and $g$ an automorphism of finite order. We construct an associative algebra $A_g(V)$ and a pair of functors between the category of $A_g(V)$-modules and a certain category of admissible $g$-twisted…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

For integers m, n $\ge$ 1, we describe a bijection sending dissections of the (mn + 2)-regular polygon into (m + 2)-sided polygons to a new basis of the quotient of the polynomial algebra in mn variables by an ideal generated by some kind…

We study the problem of sampling weighted partial triangulations of a convex polygon. We consider the distribution where each partial triangulation $\sigma$ is chosen with probability proportional to $\lambda^{|\sigma|}$, where $\lambda>0$…

Reconfiguration problems involve determining whether two given configurations can be transformed into each other under specific rules. The Token Sliding problem asks whether, given two different set of tokens on vertices of a graph $G$, we…

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec…

In this short note, we describe the so-called homogeneous involution on finite-dimensional graded-division algebra over an algebraically closed field. We also compute their graded polynomial identities with involution. As pointed out by L.…

The problem of counting plane trees with $n$ edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and…

The reconfiguration problem for homomorphisms of digraphs to a reflexive digraph cycle, which amounts to deciding if a `reconfiguration graph' is connected, is known to by polynomially time solvable via a greedy algorithm based on certain…