Ranking patterns of unfolding models of codimension one

  title={Ranking patterns of unfolding models of codimension one},
  author={Hidehiko Kamiya and Akimichi Takemura and Hiroaki Terao},
  journal={Adv. Appl. Math.},
We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all braid slices, including those not associated with unfolding models, are in one-to-one correspondence with the chambers of an arrangement. By identifying those which are associated with unfolding models, we find the number of ranking patterns. We also give an… 

Figures, Tables, and Topics from this paper

Application of arrangement theory to unfolding models
Arrangement theory plays an essential role in the study of the unfolding model used in many fields. This paper describes how arrangement theory can be usefully employed in solving the problems of
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Application of Arrangement Theory to Unfolding Models
This paper describes how arrangement theory can be usefully employed in solving the problems of counting (i) the number of admissible rankings in an unfolding model and (ii) theNumber of ranking patterns generated by unfolding models.
Maximal unbalanced families
A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the
Clustering and Prediction of Rankings Within a Kemeny Distance Framework
A common building block for both prediction of rankings and clustering of rankings is identified, which is also valid for partial rankings, and the impurity measure of the subgroups formed as the sum of all within-node Kemeny distances is defined.
Root Cones and the Resonance Arrangement
This work focuses on data structures for labeling chambers, such as sign vectors and sets of alternating trees, with an aim at better understanding the structure of the resonance arrangement, and, in particular, enumerating its chambers, and clarifies the connections between resonance chambers and threshold functions.
Arrangements stable under the Coxeter groups
Let B be a real hyperplane arrangement which is stable under the action of a Coxeter group W. Then W acts naturally on the set of chambers of B. We assume that B is disjoint from the Coxeter
Computational determination of the largest lattice polytope diameter
A computational framework is developed to determine the largest diameter over all lattice (d, k)-polytopes and proves the conjecture whereby δ ( d , k ) is at most ⌊ ( k + 1 ) d / 2 ⌋ and is achieved, up to translation, by a Minkowski sum of lattice vectors.
The Universality of the Resonance Arrangement and its Betti Numbers
The resonance arrangement An is the arrangement of hyperplanes which has all non-zero 0/1-vectors in Rn as normal vectors. It is the adjoint of the Braid arrangement and is also called the
Boolean product polynomials and Schur-positivity
We study a family of symmetric polynomials that we refer to as the Boolean product polynomials. The motivation for studying these polynomials stems from the computation of the characteristic
The vertices of primitive zonotopes
Primitive zonotopes arise naturally in various research areas, as for instance discrete geometry, combinatorial optimization, and theoretical physics. We provide geometric and combinatorial


Arrangements and Ranking Patterns
Abstract.In the unidimensional unfolding model, given m objects in general position on the real line, there arise 1 + m(m − 1)/2 rankings. The set of rankings is called the ranking pattern of the m
On Rankings Generated by Pairwise Linear Discriminant Analysis ofmPopulations
Pairwise linear discriminant analysis ofmpopulations inRncan be regarded as a process to generate rankings of the populations. Whennis small compared withm, some of them! rankings are not generated.
Ordering events in Minkowski space
  • R. Stanley
  • Mathematics, Computer Science
    Adv. Appl. Math.
  • 2006
This work considers the question of what sets of orderings of the points are possible and shows a connection with sphere orders and the allowable sequences of Goodman and Pollack.
Algebraic combinatorics of graph spectra, subspace arrangements and Tutte polynomials
The present thesis consists of three independent parts. In the first part we employ an elementary counting method to study the eigenvalues of the adjacency matrices of some special families of
Characterization of rankings generated by linear discriminant anlaysis
Pairwise linear discriminant analysis can be regarded as a process to generate rankings of the populations. But in general, not all rankings are generated. We give a characterization of generated
Perpendicular Dissections of Space
  • T. Zaslavsky
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2002
The main theorem is that there is a real, additive gain graph whose set of balanced flats has the same structure as the intersection semilattice of intersections of the hyperplanes for generic reference points.
Characteristic Polynomials of Subspace Arrangements and Finite Fields
Let A be any subspace arrangement in Rndefined over the integers and let Fqdenote the finite field withqelements. Letqbe a large prime. We prove that the characteristic polynomialχ(A, q) of A counts
Stirling Numbers and a Geometric Structure from Voting Theory
The combinatorics of such a structure and shows that the Stirling numbers have a geometrical significance are discussed.
Periodicity of hyperplane arrangements with integral coefficients modulo positive integers
Abstract We study central hyperplane arrangements with integral coefficients modulo positive integers q. We prove that the cardinality of the complement of the hyperplanes is a quasi-polynomial in
New developments in psychological choice modeling
Order Invariant Unfolding Analysis under Smoothness Restrictions (W.J. Heiser). An Analytical Approach to Unfolding (H. Feger). GENFOLD 2: A General Unfolding Methodology for the Analysis of