14 citations · 17 across the 8 of their papers we have counts for
5 papers · 1 filter
On higher multiplicity hyperplane and polynomial covers for symmetry preserving subsets of the hypercube
Arijit Ghosh, Chandrima Kayal, Soumi Nandi +1
Alon and Füredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of…
On Vanishing Properties of Polynomials on Symmetric Sets of the Boolean Cube, in Positive Characteristic
Srikanth Srinivasan, S. Venkitesh
The finite-degree Zariski (Z-) closure is a classical algebraic object, that has found a key place in several applications of the polynomial method in combinatorics. In this work,…
The Young matroid: A multiset extension of the Catalan matroid to arbitrary Young diagrams
Hiranya Kishore Dey, Brahadeesh Sankarnarayanan, S. Venkitesh
Introduced by Ardila (J. Combin. Theory Ser. A, 2003), the Catalan matroid is obtained by defining the bases of the matroid using Dyck paths from to . Further resear…
Covering Weight-Determined Sets of Uniform Grids by Polynomials
S. Venkitesh
We determine the minimum degree of a nonzero polynomial covering "weight-determined" subsets of a uniform grid over a field of characteristic zero. Since such subsets are completel…
Covering Symmetric Sets of the Boolean Cube by Affine Hyperplanes
S. Venkitesh
Alon and Füredi (European J. Combin., 1993) proved that any family of hyperplanes that covers every point of the Boolean cube except one must contain at least hyper…