11 citations · 27 across the 9 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CG2014
Efficient algorithms to decide tightness
Bhaskar Bagchi, Benjamin A. Burton, Basudeb Datta +2
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex…
math.GT2014★ 11 cited
Separation index of graphs and stacked 2-spheres
Benjamin A. Burton, Basudeb Datta, Nitin Singh +1
In 1987, Kalai proved that stacked spheres of dimension are characterised by the fact that they attain equality in Barnette's celebrated Lower Bound Theorem. This result…
math.CO2014
On Additive Combinatorics of Permutations of \mathbb{Z}_n
L. Sunil Chandran, Deepak Rajendraprasad, Nitin Singh
Let denote the ring of integers modulo . In this paper we consider two extremal problems on permutations of , namely, the maximum size of a collecti…