Related papers: A framework unifying some bijections for graphs an…

The thirty years old programme of Griffiths and Harris of understanding higher-dimensional analogues of Poncelet-type problems and synthetic approach to higher genera addition theorems has been settled and completed in this paper. Starting…

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

We present a new method of establishing a bijective correspondence - in fact, a lattice isomorphism - between action- and coaction-invariant ideals of C*-algebras and their crossed products by a fixed locally compact group. It is known that…

A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…

In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…

Jacobi algebroids, that is graded Lie brackets on the Grassmann algebra associated with a vector bundle which satisfy a property similar to that of the Jacobi brackets, are introduced. They turn out to be equivalent to generalized Lie…

This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks…

In the present paper we investigate the faithfulness of certain linear representations of groups of automorphisms of a graph $X$ in the group of symmetries of the Jacobian of $X$. As a consequence we show that if a $3$-edge-connected graph…

We introduce some basic concepts for Jacobi-Jordan algebras such as: representations, crossed products or Frobenius/metabelian/co-flag objects. A new family of solutions for the quantum Yang-Baxter equation is constructed arising from any…

A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.

On a projective complex manifold, the Abelian group of Divisors maps surjectively onto that of holomorphic line bundles (the Picard group). On a $G_2$-manifold we use coassociative submanifolds to define an analogue of the first, and a…

It is a result of Gabriel that hereditary torsion pairs in categories of modules are in bijection with certain filters of ideals of the base ring, called Gabriel filters or Gabriel topologies. A result of Jans shows that this bijection…

A diagram of groupoid correspondences is a homomorphism to the bicategory of \'etale groupoid correspondences. We study examples of such diagrams, including complexes of groups and self-similar higher-rank graphs. We encode the diagram in a…

We show that there is a bijection between the subtoposes of the classifying topos of a geometric theory T over a signature L and the closed geometric theories over L which are `quotients' of the theory T; next, we analyze how classical…

Hereditary chip-firing models generalize the Abelian sandpile model and the cluster firing model to an exponential family of games induced by covers of the vertex set. This generalization retains some desirable properties, e.g.…

We define a 2-category structure (Pre-Orb) on the category of reduced complex orbifold atlases. We construct a 2-functor F from (Pre-Orb) to the 2-category (Grp) of proper \'etale effective groupoid objects over the complex manifolds. Both…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

Sandpile groups are a subtle graph isomorphism invariant, in the form of a finite abelian group, whose cardinality is the number of spanning trees in the graph. We study their group structure for graphs obtained by attaching a cone vertex…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…