English
Related papers

Related papers: Bijective Approaches for Schmidt-Type Theorems

200 papers

We prove analytic and combinatorial identities reminiscent of Schur's classical partition theorem. Specifically, we show that certain families of overpartitions whose parts satisfy gap conditions are equinumerous with partitions whose parts…

Number Theory · Mathematics 2013-11-22 Kathrin Bringmann , Jeremy Lovejoy , Karl Mahlburg

For finite-dimensional algebras over a field, Koenig and Yang established a bijection between silting complexes and simple-minded collections in the bounded derived category, with further contributions by many authors in various settings.…

Representation Theory · Mathematics 2026-03-20 Riku Fushimi

We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…

Combinatorics · Mathematics 2018-09-10 Markus Fulmek

We evaluate combinatorially certain connection coefficients of the symmetric group that count the number of factorizations of a long cycle as a product of three permutations. Such factorizations admit an important topological interpretation…

Combinatorics · Mathematics 2015-03-17 Alejandro H. Morales , Ekaterina A. Vassilieva

We study thick subcategories of the category of 2-term complexes of projective modules over an associative algebra. We show that those thick subcategories that have enough injectives are in explicit bijection with 2-term silting complexes…

Representation Theory · Mathematics 2023-08-23 Monica Garcia

Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…

Combinatorics · Mathematics 2024-10-31 Melanie Ferreri

In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…

General Mathematics · Mathematics 2023-04-06 Dario T. de Castro

We present several bijections, in terms of combinatorial objects counted by the Schr\"oder numbers, that are then used (via coloring) for the construction and enumeration of rational Schr\"oder paths with integer slope, ordered rooted…

Combinatorics · Mathematics 2022-03-15 Daniel Birmajer , Juan B. Gil , Juan D. Gil , Michael D. Weiner

A bijection $\Phi$ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the…

Combinatorics · Mathematics 2009-03-20 Eric Fusy , Dominique Poulalhon , Gilles Schaeffer

Sylvester showed that the partition function can be written as a sum of the polynomial term and quasiperiodic components called the Sylvester waves. Recently an explicit expression of the Sylvester wave as a finite sum over the Bernoulli…

Number Theory · Mathematics 2025-12-24 Boris Y. Rubinstein

In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Kathy Q. Ji

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

Number Theory · Mathematics 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

Number Theory · Mathematics 2021-08-31 Abdulaziz M. Alanazi , Darlison Nyirenda

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…

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…

Combinatorics · Mathematics 2013-01-25 Olcay Coşkun , Müge Taşkın

Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…

Combinatorics · Mathematics 2014-03-21 Thotsaporn Aek Thanatipanonda

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

Combinatorics · Mathematics 2007-05-23 Y. Safarov

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

Representation Theory · Mathematics 2007-05-23 Tom Halverson , Arun Ram

Taking symmetric powers of varieties can be seen as a functor from the category of varieties to the category of varieties with an action by the symmetric group. We study a corresponding map between the Grothendieck groups of these…

Algebraic Geometry · Mathematics 2019-04-16 Daniel Bergh

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…

Combinatorics · Mathematics 2007-05-23 Jason Burns