相关论文: Short Proofs in Algebraic and Enumerative Combinat…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions…

We investigate the join semilattice of modal operators on a Boolean algebra $B$. Furthermore, we consider pairs $(f,g)$ of modal operators whose supremum is the unary discriminator on $B$, and study the associated bi--modal algebras.

With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…

This paper focuses on the algebraic theory underlying the study of the complexity and the algorithms for the Constraint Satisfaction Problem (CSP). We unify, simplify, and extend parts of the three approaches that have been developed to…

We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…

We develop techniques to deal with monotonicity of sequences z_{n+1}/z_n and \sqrt[n]{z_n}. A series of conjectures of Zhi-Wei Sun and of Amdeberhan et al. are verified in certain unified approaches.

This paper gives bijective proofs of some novel coinversion identities first discovered by Ayyer, Mandelshtam, and Martin (arxiv:2011.06117) as part of their proof of a new combinatorial formula for the modified Macdonald polynomials…

We extend the notion of a commuting poset for a finite group to p-blocks and fusion systems, and we generalize a result, due originally to Alperin and proved independently by Aschbacher and Segev, to commuting graphs of blocks, with a very…

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

We conjecture two combinatorial interpretations for the symmetric function $\Delta_{e_k} e_n$, where $\Delta_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations…

We shall present a ``linear algebraic'' proof (involving some calculations in the algebra of linear operators on a vector space of polynomials and some manipulations of determinants) of the formula for the enumeration of symmetric…

In the recent progress [BE1], [M], [Z1] and [Z2], the well-known Jacobian conjecture ([BCW], [E]) has been reduced to a problem on HN (Hessian nilpotent) polynomials (the polynomials whose Hessian matrix are nilpotent) and their (deformed)…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

The Algebraic Dichotomy Conjecture states that the Constraint Satisfaction Problem over a fixed template is solvable in polynomial time if the algebra of polymorphisms associated to the template lies in a Taylor variety, and is NP-complete…

We present a library of formalized results around symmetric functions and the character theory of symmetric groups. Written in Coq/Rocq and based on the Mathematical Components library, it covers a large part of the contents of a graduate…

In a recent preprint, Matherne, Morales and Selover conjectured that two different representations of unit interval posets are related by the famous zeta map in $q,t$-Catalan combinatorics. This conjecture was proved recently by G\'elinas,…

Recent results have placed the classical shuffle conjecture of Haglund et al. in a broader context of an infinite family of conjectures about parking functions in any rectangular lattice. The combinatorial side of the new conjectures has…

We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general…

We provide sufficient and necessary conditions guaranteeing equations $(A+B)^*=A^*+B^*$ and $(AB)^*=B^*A^*$ concerning densely defined unbounded operators $A,B$ between Hilbert spaces. We also improve the perturbation theory of selfadjoint…