相关论文: Adjacencies on random ordering polytopes and flow …

This paper investigates best-worst choice probabilities (picking the best and the worst alternative from an offered set). It is shown that non-negativity of best-worst Block-Marschak polynomials is necessary and sufficient for the existence…

The random utility model, a cornerstone in economics, is axiomatized by Falmagne (1978) and McFadden and Richter (1990) with the assumption that if a menu is observable, the choice frequencies of all alternatives are also observable.…

Let M be a Q-divisor on a smooth surface over C. In this paper we give criteria for very ampleness of the adjoint of the round-up of M. (Similar results for global generation were given by Ein and Lazarsfeld and used in their proof of…

Taking up a suggestion of David Gale from 1956, we generate sets of combinatorially isomorphic polytopes by choosing their Gale diagrams at random. We find that in high dimensions, and under suitable assumptions on the growth of the…

With respect to earlier investigations, the theory of multi-component, concentric, copolar, axisymmetric, rigidly rotating polytropes is improved and extended, including subsystems with nonzero density on the boundary and subsystems with…

The metric polytope m(n) is the polyhedron associated with all semimetrics on n nodes. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the metric polytope is adjacent to some integral vertex. The…

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and…

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…

Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…

We show that there is a unique hypersurface of minimal degree passing through the non-faces of a polytope which is defined by a simple hyperplane arrangement. This generalizes the construction of the adjoint curve of a polygon by Wachspress…

Polycons, initially introduced by Wachspress in 1975 as a tool in finite element methods, are generalizations of polygons in that they allow conic boundary components. We are interested in the adjoint curve of a given polycon, i.e. the…

Following an approach presented by N. Frantzikinakis, B. Host and B. Kra, we show that the parameters in the multidimensional Szemer\'edi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes…

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

In 1999, Pitman and Stanley introduced the polytope bearing their name along with a study of its faces, lattice points, and volume. The Pitman-Stanley polytope is well-studied due to its connections to probability, parking functions, the…

Using Malliavin operators together with an interpolation technique inspired by Arratia, Goldstein and Gordon (1989), we prove a new inequality on the Poisson space, allowing one to measure the distance between the laws of a general random…

Random utility theory models an agent's preferences on alternatives by drawing a real-valued score on each alternative (typically independently) from a parameterized distribution, and then ranking the alternatives according to scores. A…

Flexible graph connectivity is a new network design model introduced by Adjiashvili. It has seen several recent algorithmic advances. Despite these, the approximability even in the setting of a single-pair $(s,t)$ is poorly understood. In…

Symmetric edge polytopes, a.k.a. PV-type adjacency polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In…

We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a…