Consider two graphs G and H. Let H[G] be the lexicographic product of H and G, where H is the lexicographic product of the graph H by itself k times. In this paper, we determine the spectrum of H[G] and H whenG andH are regular and the Laplacian spectrum ofH[G] andH for G and H arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic p...

Regardless of their name (dictionary, glossary, encyclopaedia, or even ‘leximat’, in the case of a new generation of online, semi-automated lexicographic tools), subject-field, purpose, or medium (paper or cyber), lexicographic reference works should be regarded as functional information tools that are solely designed to cater to the information needs of their users in different usage situation...

Let I be a homogeneous Artinian ideal in a polynomial ring R = k[x1, . . . , xn] over a field k of characteristic 0. We study an equivalent condition for the generic initial ideal gin(I) with respect to reverse lexicographic order to be almost reverse lexicographic. As a result, we show that Moreno-Socias conjecture implies Fröberg conjecture. And for the case codimI ≤ 3, we show that R/I has t...

This paper presents three simple and efficient algorithms for generating, ranking and unranking t-ary trees in a lexicographic order. The simplest idea of encoding a t-ary tree with n nodes as a bit-string of length t*n is exploited to its full advantages. It is proved that the lexicographic order in the set of t-ary trees with n nodes is preserved in the set of bit-strings of length t*n, using...

This work develops and tests a theory of voter choice in parliamentary elections. I demonstrate that voters are concerned with policy outcomes and hence incorporate the way institutions convert votes to policy into their choices. Since policy is often the result of institutionalized multi-party bargaining and thus votes are watered-down by power-sharing, voters often compensate for this waterin...

In this paper, we describe a general method for building coverings, that we call lexicographic covering. The name comes from the fact that the scheme although more general than that is particularly fitted to the case where the transitions of an automaton are given an ordering at each state and thus the computations in the automaton may be lexicographic ordered. The lexicographic covering allows...

We propose a flexible model and several integer linear programming and constraint programming formulations for integrated employee timetabling and production scheduling problems. A hybrid constraint and linear programming exact method is designed to solve a basic integrated employee timetabling and job-shop scheduling problem for lexicographic minimization of makespan and labor costs. Prelimina...

We interpret the problem of updating beliefs as a choice problem (selecting a posterior from a set of admissible posteriors) with a reference point (prior). We use AGM belief revision to define the support of admissible posteriors after observing zero probability events and investigate two classes of updating rules for probabilities : 1) ”minimum distance” updating rules which select the poster...

We propose a model, Lexicographic Partially Observable Markov Decision Process (LPOMDP), which extends POMDPs with lexicographic preferences over multiple value functions. It allows for slack–slightly less-than-optimal values–for higherpriority preferences to facilitate improvement in lower-priority value functions. Many real life situations are naturally captured by LPOMDPs with slack. We cons...

We consider cheap talk by a biased expert comparing multiple issues, e.g., discussion of different spending proposals by an industry lobbyist, evaluation of different stocks by a sell-side analyst, or analysis of different topics by a biased newspaper. When the expert’s motives are sufficiently transparent, we find that cheap talk is credible and influential even when the expert strongly favors...