相关论文: Subclasses of Presburger Arithmetic and the Weak E…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

We show that the Morse index of unstable closed minimal hypersurface $\Sigma$ in a compact semi-simple Riemannian symmetric space $M=G/K$ is bounded from below by constant times the first Betti number of $\Sigma$. Our proof is based on a…

First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…

We reinvestigate known lower bounds for the Intersection Non-Emptiness Problem for Deterministic Finite Automata (DFA's). We first strengthen conditional time complexity lower bounds from T. Kasai and S. Iwata (1985) which showed that…

One important goal of black-box complexity theory is the development of complexity models allowing to derive meaningful lower bounds for whole classes of randomized search heuristics. Complementing classical runtime analysis, black-box…

Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…

We prove existence and uniqueness of solutions of a large class of initial-boundary-value problems characterized by a quasi-linear third order equation (the third order term being dissipative) on a finite space interval with Dirichlet,…

In this paper we deal with the well-posedness of Dirichlet problems associated to nonlocal Hamilton-Jacobi parabolic equations in a bounded, smooth domain $\Omega$, in the case when the classical boundary condition may be lost. We address…

The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets--i.e., the amount of Karp--Lipton advice needed for polynomial-time machines…

We prove a downward separation for $\mathsf{\Sigma}_2$-time classes. Specifically, we prove that if $\Sigma_2$E does not have polynomial size non-deterministic circuits, then $\Sigma_2$SubEXP does not have \textit{fixed} polynomial size…

We consider the inverse boundary value problem for operators of the form $-\triangle+q$ in an infinite domain $\Omega=\mathbb{R}\times\omega\subset\mathbb{R}^{1+n}$, $n\geq3$, with a periodic potential $q$. For Dirichlet-to-Neumann data…

We study extrema of the first and the second mixed eigenvalues of the Laplacian on the disk among some families of Dirichlet-Neumann boundary conditions. We show that the minimizer of the second eigenvalue among all mixed boundary…

We introduce a class of notions of forcing which we call $\Sigma$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $\Sigma$-Prikry. We show that given…

In this article we establish exponential moment bounds, moment bounds in fractional order smoothness spaces, a uniform H\"older continuity in time, and strong convergence rates for a class of fully discrete exponential Euler-type numerical…

In this paper, we provide an efficient method for computing the Taylor coefficients of $1-p_n f$, where $p_n$ denotes the optimal polynomial approximant of degree $n$ to $1/f$ in a Hilbert space $H^2_\omega$ of analytic functions over the…

Let $S \subset \Bbb R^n$ be a smooth compact hypersurface with a strictly positive second fundamental form, $E$ be the Fourier extension operator on $S$, and $X$ be a Lebesgue measurable subset of $\Bbb R^n$. If $X$ contains a ball of each…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

We deal with a wide class of nonlinear nonlocal equations led by integro-differential operators of order $(s,p)$, with summability exponent $p \in (1,\infty)$ and differentiability exponent $s\in (0,1)$, whose prototype is the fractional…

We investigate the consequences of the existence of ``efficiently describable'' hitting sets for polynomial sized algebraic circuit ($\mathsf{VP}$), in particular, \emph{$\mathsf{VP}$-succinct hitting sets}. Existence of such hitting sets…