Searcharxiv⌕ Search

arXiv subjects

Neeraja Kulkarni

Publications and source records attributed to Neeraja Kulkarni.

3 recordsLinked to original sources

Exceptional parameters in the Erdős similarity problem

The Erd\H os similarity conjecture says that for every infinite set $A \subset \mathbb{R}$, there exists a set $E$ of positive Lebesgue measure which does not contain any affine copy of $x + tA$ of $A$ (with $t \neq 0$). Kolountzakis proved that for every infinite $A$, there exists $E$ of positive Lebesgue measure so that the exceptional sets $D_E(A)$ of scales $t$, and $\mathcal E_E(A)$ of affine maps $(x,t)$, for which $x+tA\subseteq E$, are both Lebesgue null. We show that these exceptional parameter sets are small in two finer senses. First, given any countable family of Fourier decay rates, a single $E$ can be constructed so that $D_E(A)$ is null with respect to every measure whose Fourier transform decays at one of these rates. Consequently, there are compact sets $K$ of measure arbitrarily close to $1$ for which $D_K(A)$ and $\mathcal E_K(A)$ have modified Fourier dimension zero. Second, we give a criterion, depending both on the growth of a gauge function $h$ and on the gaps between elements of lacunary sequences in $A$, which guarantees that $\mathcal H^h(D_E(A))=0$ for gauges with $h(u)/u\to\infty$, as well as a similar result for $\mathcal E_K(A)$. For sets such as $A = \{1/n!\}$ and $A = \{e^{-n^q}\}$, this yields explicit gauges of the form $h(u) = u\exp((\log 1/u)^θ)$ with $0 < θ< 1$.

math.CA↗

The Manickam-Miklós-Singhi Parameter of Graphs and Degree Sequences

Let $G$ be a simple graph. Consider all weightings of the vertices of $G$ with real numbers whose total sum is nonnegative. How many edges of $G$ have endpoints with a nonnegative sum? We consider the minimum number of such edges over all such weightings as a graph parameter. Computing this parameter has been shown to be NP-hard but we give a polynomial algorithm to compute the minimum of this parameter over realizations of a given degree sequence. We also completely determine the minimum and maximum value of this parameter for regular graphs.

math.CO↗

Factorizations of $k$-Nonnegative Matrices

A matrix is $k$-nonnegative if all its minors of size $k$ or less are nonnegative. We give a parametrized set of generators and relations for the semigroup of $k$-nonnegative $n\times n$ invertible matrices in two special cases: when $k = n-1$ and when $k = n-2$, restricted to unitriangular matrices. For these two cases, we prove that the set of $k$-nonnegative matrices can be partitioned into cells based on their factorizations into generators, generalizing the notion of Bruhat cells from totally nonnegative matrices. Like Bruhat cells, these cells are homeomorphic to open balls and have a topological structure that neatly relates closure of cells to subwords of factorizations. In the case of $(n-2)$-nonnegative unitriangular matrices, we show the cells form a Bruhat-like CW-complex.

math.CO↗