Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.03799

Derivations of large classes of facet-defining inequalities of the weak order polytope using ranking structures

Adolfo R. Escobedo·Romena Yasmin
View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of ordering polytopes has been essential to the solution of various challenging combinatorial optimization problems. For instance, the incorporation of facet defining inequalities (FDIs) from these polytopes in branch-and-cut approaches represents among the most effective solution methodologies known to date for some of these problems. The weak order polytope, defined as the convex hull of the characteristic vectors of all binary orders on $n$ alternatives that are reflexive, transitive, and complete, has been particularly important for tackling problems in computational social choice, preference aggregation, and comparative probability. For the most part, FDIs for the weak order polytope have been obtained through enumeration and through derivation from FDIs of other combinatorial polytopes. This paper derives new classes of FDIs for the weak order polytope by utilizing the equivalent representation of a weak order as a ranking of $n$ objects that allows ties and by grouping characteristic vectors that share certain ranking structures. Furthermore, we demonstrate that a number of FDIs previously obtained through enumeration are actually special cases of these ranking-based FDIs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adolfo R. Escobedo, Romena Yasmin. 2021-03-25. Derivations of large classes of facet-defining inequalities of the weak order polytope using ranking structures. https://arxiv.org/abs/2008.03799

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗