Related papers: Hyperarithmetical Complexity of Infinitary Action …

In this note, we consider the complexity of optimizing a highly smooth (Lipschitz $k$-th order derivative) and strongly convex function, via calls to a $k$-th order oracle which returns the value and first $k$ derivatives of the function at…

Let $G$ be a connected reductive group over a perfect field $k$ acting on an algebraic variety $X$ and let $P$ be a minimal parabolic subgroup of $G$. For $k$-spherical $G$-varieties we prove finiteness result for $P$-orbits that contain…

We study first-order methods (FOMs) for solving \emph{composite nonconvex nonsmooth} optimization with linear constraints. Recently, the lower complexity bounds of FOMs on finding an ($\varepsilon,\varepsilon$)-KKT point of the considered…

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…

Let $L_{\widehat{sl(2|1)}}(\mathcal{k},0)$ be the simple affine vertex operator superalgebra associated to the affine Lie superalgebra $\widehat{sl(2|1)}$ with admissible level $\mathcal{k}$. We conjecture that…

We exhibit a uniform method for obtaining (wellfounded and non-wellfounded) cut-free sequent-style proof systems that are sound and complete for various classes of action algebras, i.e., Kleene algebras enriched with meets and residuals.…

In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In…

In [3] a short proof is given that some strings have maximal plain Kolmogorov complexity but not maximal prefix-free complexity. The proof uses Levin's symmetry of information, Levin's formula relating plain and prefix complexity and Gacs'…

Let ${\cal R}_{\mathbb{K}}[H]$ be the Hibi ring over a field $\mathbb{K}$ on a finite distributive lattice $H$, $P$ the set of join-irreducible elements of $H$ and $\omega$ the canonical ideal of ${\cal R}_{\mathbb{K}}[H]$. We show the…

The aim of this paper is to prove multiplicity of solutions for nonlocal fractional equations modeled by $$ \left\{ \begin{array}{ll} (-\Delta)^s u-\lambda u=f(x,u) & {\mbox{ in }} \Omega\\ u=0 & {\mbox{ in }} \mathbb{R}^n\setminus…

The (local) invariant symplectic action functional $\A$ is associated to a Hamiltonian action of a compact connected Lie group $\G$ on a symplectic manifold $(M,\omega)$, endowed with a $\G$-invariant Riemannian metric $<\cdot,\cdot>_M$. It…

We establish an omega theorem for logarithmic derivative of the Riemann zeta function near the 1-line by resonance method. We show that the inequality $\left| \zeta^{\prime}\left(\sigma_A+it\right)/\zeta\left(\sigma_A+it\right) \right|…

We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…

We introduce an operator on problems in Weihrauch complexity, which we call the inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a…

We investigate the non-elementary computational complexity of a family of substructural logics without contraction. With the aid of the technique pioneered by Lazi\'c and Schmitz (2015), we show that the deducibility problem for full Lambek…

In this paper, we consider the following problem involving fractional Laplacian operator: \begin{equation}\label{eq:0.1} (-\Delta)^{\alpha} u= |u|^{2^*_\alpha-2-\varepsilon}u + \lambda u\,\, {\rm in}\,\, \Omega,\quad u=0 \,\, {\rm on}\, \,…

We prove results on the relaxation and weak* lower semicontinuity of integral functionals of the form \[ \mathcal{F}[u] := \int_{\Omega} f \bigg( \frac{1}{2} \bigl( \nabla u(x) + \nabla u(x)^T \bigr) \bigg)\,\mathrm{d} x, \qquad u : \Omega…

The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…