Related papers: Hausdorff Reductions and the Exponential Hierarchi…
The expressiveness of propositional non-clausal (NC) formulas is exponentially richer than that of clausal formulas. Yet, clausal efficiency outperforms non-clausal one. Indeed, a major weakness of the latter is that, while Horn clausal…
Generalising a construction of Falconer, we consider classes of $G_\delta$-subsets of $\mathbb{R}^d$ with the property that sets belonging to the class have large Hausdorff dimension and the class is closed under countable intersections. We…
We introduce a unified generalization of several well-established high-throughput coding techniques including staircase codes, tiled diagonal zipper codes, continuously interleaved codes, open forward error correction (OFEC) codes, and…
It was shown in 1994, in Oberguggenberger & Rosinger, that very large classes of nonlinear PDEs have solutions which can be assimilated with usual measurable functions on the Euclidean domains of definition of the respective equations. In…
A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…
We consider algebraic ordinary differential equations (AODEs) and study their polynomial and rational solutions. A sufficient condition for an AODE to have a degree bound for its polynomial solutions is presented. An AODE satisfying this…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
This paper investigates a class of $p$-obstacle problems with subcritical exponents having the form \begin{align} \mathrm{div}\left( a(x)|\nabla u|^{p-2}\nabla u\right) =m_1\chi_{\{u>0\}}-m_2u^{\lambda-1}\chi_{\{u>0\}} \ \text{in}\…
Within i.i.d. multiplicative cascades, a single axiom -- the hierarchical symmetry, a linear contraction on incremental scaling exponents -- is shown to be necessary and sufficient for the cascade multiplier to be log-Poisson. We establish…
Homology features of spaces which appear in applications, for instance 3D meshes, are among the most important topological properties of these objects. Given a non-trivial cycle in a homology class, we consider the problem of computing a…
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…
In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…
The Grothendieck groups of the categories of finitely generated modules and finitely generated projective modules over a tower of algebras can be endowed with (co)algebra structures that, in many cases of interest, give rise to a dual pair…
In 1994 we showed that very large classes of systems of nonlinear PDEs have solutions which can be assimilated with usual measurable functions on the Euclidean domains of definition of the respective equations. Recently, the regularity of…
Deep learning has recently demonstrated its ability to rival the human brain for visual object recognition. As datasets get larger, a natural question to ask is if existing deep learning architectures can be extended to handle the 50+K…
The problem of characterizing normed ordered spaces which admit a representation in the algebraic, order and norm sense as a subspace of $C(X)$, the space of all continuous functions on a compact Hausdorff space is a classical problem that…
In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order H\"older smooth and uniformly convex functions. Specifically, for a function whose $p^{th}$-order derivatives are H\"older continuous with…
In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…
The dot-depth hierarchy of Brzozowski and Cohen classifies the star-free languages of finite words. By a theorem of McNaughton and Papert, these are also the first-order definable languages. The dot-depth rose to prominence following the…