This paper is a contribution to the general problem of giving an explicit description of the basic locus in the reduction modulo $p$ of Shimura varieties. Motivated by \cite{Vollaard-Wedhorn} and \cite{Rapoport-Terstiege-Wilson}, we classify the cases where the basic locus is (in a natural way) the union of classical Deligne-Lusztig sets associated to Coxeter elements. We show that if this is satisfied, then the Newton strata and Ekedahl-Oort strata have many nice properties.

No abstract uploaded!

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.

No abstract uploaded!

No abstract uploaded!