Related papers: Combinatorial specifications for juxtapositions of…
We study the combinatorics of an analogue of Green's $\mathcal{J}$-relation (a.k.a. the two-sided relation) for the bicategory of finite-dimensional bimodules over finite-dimensional associative algebras over a fixed field. In particular,…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
In this article, we consider a combinatorial settlement model on a rectangular grid where at least one side (east, south or west) of each house must be exposed to sunlight without obstructions. We are interested in maximal configurations,…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
A (v,b,r,k) combinatorial configuration is a (r,k)-biregular bipartite graph with v vertices on the left and b vertices on the right and with no cycle of length 4. Combinatorial configurations have become very important for some…
Assume $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$. Let $E$ be a $\mathbf{\Sigma}^1_1$ equivalence relation coded in $\mathrm{HOD}$. $E$ has an ordinal definable equivalence class without any ordinal definable elements if and only…
We study the validity of congruence inclusions of the form $ \alpha ( \beta \circ \alpha \gamma \circ \beta \circ \dotsc \circ \alpha \gamma \circ \beta ) \subseteq \alpha \beta \circ \alpha \gamma \circ \alpha \beta \circ \dots$ in…
This paper contains a new proof of the classification of elements of prime order in the Cremona group Bir(P^2), up to conjugation. In addition, we give explicit geometric constructions of these Cremona transformations, and provide a…
A (complete) matching of the cells of a triangulated manifold can be thought as a combinatorial or discrete version of a nonsingular vector field. We give several methods for constructing such matchings.
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
In this note we explain, in terms of finite dimensional representations of Lie algebras $\mathfrak{sp}_{2\ell}\subset\mathfrak{sl}_{2\ell}$, a combinatorial coincidence of difference conditions in two constructions of combinatorial bases…
Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
We show that for some classes of groups $G$, the homotopy fiber $E_{\mathrm{com}} G$ of the inclusion of the classifying space for commutativity $E_{\mathrm{com}} G$ into the classifying space $BG$, is contractible if and only if $G$ is…
A representation field for a non-maximal order $\Ha$ in a central simple algebra is a subfield of the spinor class field of maximal orders which determines the set of spinor genera of maximal orders containing a copy of $\Ha$. Not every…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
We find an explicit combinatorial gradient vector field on the well known complex S (Salvetti complex) which models the complement to an arrangement of complexified hyperplanes. The argument uses a total ordering on the facets of the…
Let $\F$ be an algebraically closed field. Let $\V$ be a vector space equipped with a non-degenerate symmetric or symplectic bilinear form $B$ over $\F$. Suppose the characteristic of $\F$ is \emph{large}, i.e. either zero or greater than…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…