In this paper, we investigate the reconstruction of permutations on {1, 2, . . . , n} from betweenness constraints involving the minimum and the maximum element located between t and t + 1, for all t = 1, 2, . . . , n − 1. We propose two variants of the problem (directed and undirected), and focus first on the directed version, for which we draw up general features and design a polynomial algor...

We prove a range of minmax theorems about cycle packing and covering in digraphs whose vertices are cyclically ordered, a notion promoted by Bessy and Thomassé in their beautiful proof of the following conjecture of Gallai: the vertices of a strongly connected digraph can be covered by at most as many cycles as the stability number. The results presented here provide relations between cycle pac...

The separated electromagnetic responses RL(q, ω) and RT (q, ω) for inclusive electron scattering off nuclei are studied within a functional scheme.

We prove a generalization of von Neumann’s minmax theorem to the class of separable multiplayer zerosum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix—that is, graphical games in which every edge is a two-player game between its endpoints—in which every outcome has zero total sum of players’ payoffs. Our generalization of the minmax theorem implies convexity of equili...

A new algorithm, Laplacian MinMax Discriminant Projection (LMMDP), is proposed in this paper for supervised dimensionality reduction. LMMDP aims at learning a discriminant linear transformation. Specifically, we define the within-class scatter and the between-class scatter using similarities which are based on pairwise distances in sample space. After the transformation, the considered pairwise...