Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections

DOI10.1080/09720529.2020.1776932zbMath1496.05002arXiv1906.10553OpenAlexW3092976511MaRDI QIDQ5043922

No author found.

Publication date: 6 October 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.10553

zbMATH Keywords

enumerationpermutation patternforbidden configurationgroup-separable electionrestricted election

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Voting theory (91B12) Individual preferences (91B08)

Related Items (2)

Structure of single-peaked preferences ⋮ Structured preferences: a literature survey

Uses Software

• OEIS

Cites Work

• Unnamed Item
• A characterization of the single-peaked domain
• Permuting machines and priority queues
• On the likelihood of single-peaked preferences
• On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles
• Small one-dimensional Euclidean preference profiles
• The one-dimensional Euclidean domain: finitely many obstructions are not enough
• A characterization of the single-crossing domain

This page was built for publication: Enhancing the connections between patterns in permutations and forbidden configurations in restricted elections