5 papers
Sparse Cuts in Hypergraphs from Random Walks on Simplicial Complexes
Anand Louis, Rameesh Paul, Arka Ray
There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning to hypergraphs. There have been two broad directions toward this goal. One gene…
Exact recovery algorithm for Planted Bipartite Graph in Semi-random Graphs
Akash Kumar, Anand Louis, Rameesh Paul
The problem of finding the largest induced balanced bipartite subgraph in a given graph is NP-hard. This problem is closely related to the problem of finding the smallest Odd Cycle…
Independent Sets in Semi-random Hypergraphs
Yash Khanna, Anand Louis, Rameesh Paul
A set of vertices in a hypergraph is called an independent set if no hyperedge is completely contained inside the set. Given a hypergraph, computing its largest size independent se…
Centrally Image partition Regularity near 0
Tanushree Biswas, Dibyendu De, Ram Krishna Paul
The notion of Image partition regularity near zero was first introduced by De and Hindman. It was shown there that like image partition regularity over the main source…
Combined algebraic and multiplicative properties near zero
Dibyendu De, Ram Krishna Paul
It was proved that whenever is partitioned into finitely many cells, one cell must contain arbitrary length arithmetic and geometric progression nicely intertwined, so…