Complete classification of 3-multisets up to combinatorial equivalence

DOI10.1016/J.JNT.2016.09.035zbMATH Open1387.05005OpenAlexW2557543166MaRDI QIDQ503695FDOQ503695

Authors: Davi Lopes Alves de Medeiros, Lev Birbrair 

Publication date: 23 January 2017

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2016.09.035

Recommendations

• A multiple set version of the \(3k-3\) theorem
• Some remarks on 3-partitions of multisets
• scientific article; zbMATH DE number 1164016
• Partitions of a finite three-complete poset
• scientific article; zbMATH DE number 4049618
• Characterizing 3-Sets in Union-Closed Families
• Classification of the total and regular graphs of three-point sets
• On 3-way combinatorial identities
• Finite 3-set-homogeneous graphs

zbMATH Keywords

combinatorial equivalencefocal classificationresonance sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Generalizations of some divisibility relations in \(\mathbb N\)
• Resonance sequences and recoverability
• Resonance sequences and focal decomposition

Cited In (5)

• Title not available (Why is that?)
• Mutually describing multisets and integer partitions
• A multiple set version of the \(3k-3\) theorem
• Resonance sequences and recoverability
• All \(s\)-sum sets of type 2 or 3 are triple-sum sets

This page was built for publication: Complete classification of 3-multisets up to combinatorial equivalence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503695)