Related papers: Lower Bounds of the Discretization for Piecewise P…

We compute an upper bound for the dimension of the tangent spaces at classical points of certain eigenvarieties associated with definite unitary groups, especially including the so-called critically refined cases. Our bound is given in…

We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

Let $\Omega\subset\mathbb{R}^n$, $n\geq 2$, be a bounded, open and convex set and let $f$ be a positive and non-increasing function depending only on the distance from the boundary of $\Omega$. We consider the $p-$torsional rigidity…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

In this note, we establish sharp regularity for solutions to the following generalized $p$- Poisson equation $$-\ div\ \big(\langle A\nabla u,\nabla u\rangle^{\frac{p-2}{2}}A\nabla u\big)=-\ div\ \mathbf{h}+f$$ in the plane (i.e. in…

We prove that if $\Omega\subset \mathbb R^n$ is a bounded open set and $n\alpha> {\rm dim}_b (\partial \Omega) = d$, then the Brouwer degree deg$(v,\Omega,\cdot)$ of any H\"older function $v\in C^{0,\alpha}\left (\Omega, \mathbb…

Let $\Omega$ be an open set in Euclidean space $\R^m,\, m=2,3,...$, and let $v_{\Omega}$ denote the torsion function for $\Omega$. It is known that $v_{\Omega}$ is bounded if and only if the bottom of the spectrum of the Dirichlet Laplacian…

When $P$ is the fractional Laplacian $(-\Delta )^a$, $0<a<1$, or a pseudodifferential generalization thereof, the Dirichlet problem for the associated heat equation over a smooth set $\Omega \subset{\Bbb R}^n$:…

Motivated by conforming finite element methods for elliptic problems of second order, we analyze the approximation of the gradient of a target function by continuous piecewise polynomial functions over a simplicial mesh. The main result is…

Let $k$ be a fixed integer. We determine the complexity of finding a $p$-partition $(V_1, \dots, V_p)$ of the vertex set of a given digraph such that the maximum out-degree of each of the digraphs induced by $V_i$, ($1\leq i\leq p$) is at…

We derive sharp bounds for three types of eigenvalue problems. First, we derive an upper bound for the first $p$-Dirichlet eigenvalue on conformally compact (CC) spaces. As a consequence, we show that for a class of CC submanifolds of…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

We study the basic computational problem of detecting approximate stationary points for continuous piecewise affine (PA) functions. Our contributions span multiple aspects, including complexity, regularity, and algorithms. Specifically, we…

This paper is dedicated to studying pointwise estimates of the fundamental solution for the higher order Schr\"{o}dinger equation: % we investigate the fundamental solution of the higher order Schr\"{o}dinger equation…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…