Results 51 to 60 of about 117,839 (222)

A Rogers-Ramanujan bijection

open access: yesJournal of Combinatorial Theory, Series A, 1981
AbstractIn this paper we give a bijection between the partitions of n with parts congruent to 1 or 4 (mod 5) and the partitions of n with parts differing by at least 2. This bijection is obtained by a cut-and-paste procedure which starts with a partition in one class and ends with a partition in the other class.
Adriano M. Garsia, Stephen C. Milne
openaire   +2 more sources

Kuga–Satake Construction on Families of K3 Surfaces of Picard Rank 14

open access: yesMathematische Nachrichten, EarlyView.
ABSTRACT The isometry between the type IV6 and the type II4 hermitian symmetric domains suggests a possible relation between suitable moduli spaces of K3 surfaces of Picard rank 14 and of polarized abelian 8‐folds with totally definite quaternion multiplication. We show how this isometry induces a geometrically meaningful map between such moduli spaces
Flora Poon
wiley   +1 more source

Composition of Fractional Integral and Derivative Operators: Summarised in Tables

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT This paper compiles a complete, detailed list of composition properties for Riemann–Liouville fractional differintegrals, in all possible cases for orders anywhere in the complex plane, with the results presented clearly in a table for easy visual consumption.
Arran Fernandez
wiley   +1 more source

An equivalence of multistatistics on permutations

open access: yes, 2018
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, starting with a
Nunge, Arthur
core   +2 more sources

Ordered Median Traveling Salesman Problem

open access: yesNetworks, Volume 88, Issue 1, Page 59-84, July 2026.
ABSTRACT This paper introduces a novel combinatorial optimization problem with ordering constraints, termed the Ordered Median Traveling Salesman Problem (OMTSP). The OMTSP integrates key elements from both the classic Traveling Salesman Problem (TSP) and the Ordered Median Location Problem.
Ivana Ljubić   +3 more
wiley   +1 more source

Characters of odd degree of symmetric groups

open access: yes, 2016
We construct a natural bijection between odd-degree irreducible characters of S_n and linear characters of its Sylow 2-subgroup P_n. When n is a power of 2, we show that such a bijection is nicely induced by the restriction functor.
Giannelli, Eugenio
core   +1 more source

Limit Shapes via Bijections [PDF]

open access: yesCombinatorics, Probability and Computing, 2018
We compute the limit shape for several classes of restricted integer partitions, where the restrictions are placed on the part sizes rather than the multiplicities. Our approach utilizes certain classes of bijections which map limit shapes continuously in the plane. We start with bijections outlined in [43], and extend them to include limit shapes with
Stephen Desalvo, Igor Pak
openaire   +2 more sources

DrLS: Distortion‐Resistant Lossless Steganography via Colour Depth Interpolation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
ABSTRACT The lossless data steganography is to hide a certain amount of information into a container image. Previous lossless steganography methods fail to strike a balance between capacity, imperceptibility, accuracy, and robustness, commonly vulnerable to distortion on container images.
Youmin Xu   +3 more
wiley   +1 more source

Operators of equivalent sorting power and related Wilf-equivalences [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
We study sorting operators $\textrm{A}$ on permutations that are obtained composing Knuth's stack sorting operator \textrmS and the reverse operator $\textrm{R}$, as many times as desired.
Michael Albert, Mathilde Bouvel
doaj   +1 more source

Reductions of Young Tableau Bijections [PDF]

open access: yesSIAM Journal on Discrete Mathematics, 2010
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a number of classical bijections, and establish formal connections between them.
Igor Pak, Ernesto Vallejo
openaire   +2 more sources

Home - About - Disclaimer - Privacy