相关论文: Self-dual interval orders and row-Fishburn matrice…

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…

We examine clusters in the cluster tube of rank $n+1$ using exceptional sequences in the abelian tube of rank $n+1$. Although the abelian tube has more exceptional sequences than the module categories of type $B_{n}/C_{n}$, we obtain a…

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 provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…

We prove a family of partition identities which is "dual" to the family of Andrews-Gordon's identities. These identities are inspired by a correspondence between a special type of partitions and "hypergraphs" and their proof uses…

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

In this note, we give a simple extension map from partitions of subsets of [n] to partitions of [n+1], which sends $\delta$-distant k-crossings to $(\delta+1)$-distant k-crossings (and similarly for nestings). This map provides a…

A category N of labeled (oriented) trivalent graphs (nets) or ribbon graphs is extended by new generators called fusing, braiding, twist and switch with relations which can be called Moore--Seiberg relations. A functor to N is constructed…

We consider two partial orders on standard Young tableaux. The first one is induced from the weak right Bruhat order on symmetric group by Robinson-Schensted algorithm. The second one is induced from the order on Young diagrams by…

Zeilberger proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey, for the number of alternating sign matrices with given top row. Stroganov proved an explicit…

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.

We show that every countable set of partial bijections from an infinite set to itself can be obtained as a composition of just two such partial bijections. This strengthens a result by Higgins, Howie, Mitchell and Ru\v{s}kuc stating that…

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects,…

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

In this paper we affirm Br\"{u}ck conjecture provided $f$ is of hyper-order less than one by studying the infinite hyper-order of solutions of a complex differential equation.

Let $\mathcal{X}$ be a semibrick in an extriangulated category $\mathscr{C}$. Let $\mathcal{T}$ be the filtration subcategory generated by $\mathcal{X}$. We give a one-to-one correspondence between simple semibricks and length wide…

As shown by A. Melnikov, the orbits of a Borel subgroup acting by conjugation on upper-triangular matrices with square zero are indexed by involutions in the symmetric group. The inclusion relation among the orbit closures defines a partial…