We determine the nature of the fixed point sets of groups of order p, acting on complexes of distinguished p-subgroups (those p-subgroups containing pcentral elements in their cent...
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
We show that the number of maximal sum-free subsets of {1, 2, . . . , n} is at most 23n/8+o(n) . We also show that 20.406n+o(n) is an upper bound on the number of maximal product-...