Related papers: Boolean Operations, Joins, and the Extended Low Hi…
A set $E \subset \mathbb{N}$ is an interpolation set for nilsequences if every bounded function on $E$ can be extended to a nilsequence on $\mathbb{N}$. Following a theorem of Strzelecki, every lacunary set is an interpolation set for…
The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is…
In this note, we frst consider boundedness properties of a family of operators generalizing the Hilbert operator in the upper triangle case. In the diagonal case, we give the exact norm of these operators under some restrictions on the…
We prove lower bounds for the randomized approximation of the embedding $\ell_1^m \rightarrow \ell_\infty^m$ based on algorithms that use arbitrary linear (hence non-adaptive) information provided by a (randomized) measurement matrix $N \in…
The presence of second-order smoothness for objective functions of optimization problems can provide valuable information about their stability properties and help us design efficient numerical algorithms for solving these problems. Such…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
We extend for the second time the Nonstandard Analysis by adding the left monad closed to the right, and right monad closed to the left, while besides the pierced binad (we introduced in 1998) we add now the unpierced binad - all these in…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
Worst-case optimal join algorithms are the class of join algorithms whose runtime match the worst-case output size of a given join query. While the first provably worst-case optimal join algorithm was discovered relatively recently, the…
Abduction is a fundamental and important form of non-monotonic reasoning. Given a knowledge base explaining how the world behaves it aims at finding an explanation for some observed manifestation. In this paper we focus on propositional…
We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…
Natural target functions and tasks typically exhibit hierarchical modularity -- they can be broken down into simpler sub-functions that are organized in a hierarchy. Such sub-functions have two important features: they have a distinct set…
We derive two types of sets of higher-order conditions for bipartite entanglement in terms of continuous variables. One corresponds to an extension of the well-known Duan inequalities from second to higher moments describing a kind of…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
An important issue in neural network research is how to choose the number of nodes and layers such as to solve a classification problem. We provide new intuitions based on earlier results by An et al. (2015) by deriving an upper bound on…
We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined…
This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example,…
Structure of certain simple $\mathcal{W}$-algebras assocated with the Deligne exceptional Lie algebras and non-admissible levels are described as the {\it simple current extensions} of certain vertex operator algebras. As an application,…
In the first part of the paper we prove that for $2 < p, r < \infty$ every operator $T: L_p \to \ell_r$ is narrow. This completes the list of sequence and function Lebesgue spaces $X$ with the property that every operator $T:L_p \to X$ is…