Related papers: Effective Disjunction and Effective Interpolation …
Persistent excitation (PE) is a necessary and sufficient condition for uniform exponential parameter convergence in several adaptive, identification, and learning schemes. In this article, we consider, in the context of multi-input linear…
Even-order dispersion cancellation, an effect previously identified with frequency-entangled photons, is demonstrated experimentally for the first time with a linear, classical interferometer. A combination of a broad bandwidth laser and a…
We study the existence, uniqueness and rate of decay of correlation of equilibrium measures associated to robust classes of non-uniformly expanding local diffeomorphisms and H\"older continuous potentials. The approach used in this paper is…
We study a low-energy effective field theory (EFT) describing the NN system in which all exchanged particles are integrated out. We show that fitting the residue of the 3S1 amplitude at the deuteron pole, rather than the 3S1 effective…
Uninorms with continuous underlying t-norm and t-conorm are discussed and properties of the set of discontinuity points of such a uninorm are shown. This set is proved to be a subset of the graph of a special symmetric, surjective,…
The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to…
McLean's notion of Selective Interleaving Functions (SIFs) is perhaps the best-known attempt to construct a framework for expressing various security properties. We examine the expressive power of SIFs carefully. We show that SIFs cannot…
Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed analyses are known for a wide range of classical algorithms.…
It is proved that almost every interval exchange transformation given by the symmetric permutation 1->m, 2->m-1,..., m-1->2, m->1, where m>1 is an odd number, is disjoint from ELF systems. The notion of ELF systems was introduced to express…
Random matrices like GUE, GOE and GSE have been studied for decades and have been shown that they possess a lot of nice properties. In 2005, a new property of independent GUE random matrices is discovered by Haagerup and Thorbj{\o}rnsen in…
This work investigates the intersection property of conditional independence. It states that for random variables $A,B,C$ and $X$ we have that $X$ independent of $A$ given $B,C$ and $X$ independent of $B$ given $A,C$ implies $X$ independent…
We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
Optical interferometric imaging enables astronomical observation at extremely high angular resolution. The necessary optical information for imaging, such as the optical path differences and visibilities, is easy to extract from fringes…
Let $\textbf{SU}$ be the superintuitionistic logic defined by the axiom $\boldsymbol{su} = ((\neg p\to q)\land(\neg q\to p) \rightarrow r \vee s) \to ( p \rightarrow r) \vee(q \rightarrow s)$, or equivalently, by Andrew's axiom. It is easy…
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…
For the uniform random regular directed graph we prove concentration inequalities for (1) codegrees and (2) the number of edges passing from one set of vertices to another. As a consequence, we can deduce discrepancy properties for the…
In previous papers we have introduced a sufficient condition for uniform attractivity of the origin for a class of nonlinear time-varying systems which is stated in terms of persistency of excitation (PE), a concept well known in the…
We settle the fusion product decomposition theorem for higher-level affine Demazure modules for the cases $E^{(1)}_{6, 7, 8}, F^{(1)}_4$ and $E^{(2)}_{6}$, thus completing the main theorems of Chari et al. (J. Algebra, 2016) and Kus et al.…