Related papers: A Remark on Recent Lower Bounds for Nodal Sets

We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower…

Using the translation method of Tartar, Murat, Lurie, and Cherkaev bounds are derived on the volume occupied by an inclusion in a three-dimensional conducting body. They assume electrical impedance tomography measurements have been made for…

We study ancient solutions of polynomial growth to heat equations on graphs, and extend Colding and Minicozzi's theorem [CM19] on manifolds to graphs: For a graph of polynomial volume growth, the dimension of the space of ancient solutions…

We study the high--energy limit for eigenfunctions of the laplacian, on a compact negatively curved manifold. We review the recent result of Anantharaman-Nonnenmacher giving a lower bound on the Kolmogorov-Sinai entropy of semiclassical…

In this paper, we consider set optimization problems where the solution concept is given by the set approach. Specifically, we deal with the lower less and the upper less set relations. First, we derive the convexity and Lipschitzianity of…

For the spatially inhomogeneous, non-cutoff Boltzmann equation posed in the whole space $\mathbb R^3_x$, we establish pointwise lower bounds that appear instantaneously even if the initial data contains vacuum regions. Our lower bounds…

We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

We give an upper bound for the $(n-1)$-dimensional Hausdorff measure of the critical set of eigenfunctions of the Laplacian on compact analytic Riemannian manifolds. This is the analog of H. Donnely and C. Fefferman result on nodal set of…

This is a survey of recent results on eigenfunctions of the Laplacian on compact Riemannian manifolds and their nodal sets. It is the write-up of my talk at JDG 2011.

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

We obtain a new extension of Rogers-Shephard inequality providing an upper bound for the volume of the sum of two convex bodies $K$ and $L$. We also give lower bounds for the volume of the $k$-th limiting convolution body of two convex…

We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…

In this paper, we improve the sup-norm bound and the lower bound of the number of nodal domains for dihedral Maass forms, which are a distinguished sequence of Laplacian eigenfunctions on an arithmetic hyperbolic surface. More specifically,…

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

We study the semiclassical behaviour of eigenfunctions of quantum systems with ergodic classical limit. By the quantum ergodicity theorem almost all of these eigenfunctions become equidistributed in a weak sense. We give a simple derivation…

We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erd\H{o}s-R\'{e}nyi graphs. We investigate…

We give a simpler proof, via query elimination, of a result due to O'Donnell, Saks, Schramm and Servedio, which shows a lower bound on the zero-error randomized query complexity of a function f in terms of the maximum influence of any…

In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to…