The notion of smooth biproximity space  where $delta_1,delta_2$ are gradation proximities defined by Ghanim et al. [10]. In this paper, we show every smooth biproximity space $(X,delta_1,delta_2)$ induces a supra smooth proximity space $delta_{12}$ finer than $delta_1$ and $delta_2$. We study the relationship between $(X,delta_{12})$ and the $FP^*$-separation axioms which had been introduced by...

This paper considers the relational versions of the surjective and multifunction weak pigeonhole principles for PV , Σ1 and Θ b 2-formulas. We show that the relational surjective pigeonhole principle for Θ2 formulas in S 1 2 implies a circuit block-recognition principle which in turn implies the surjective weak pigeonhole principle for Σ1 formulas. We introduce a class of predicates correspondi...

Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to nbp/2c for a p-th order tensor in Rnp . Previously no efficient algorithm can decompose 3rd order tensors when the rank is super-linear in the dimension. Using ideas from sum-of-squares hierarchy, we give the firs...

We propose the following computational assumption: in general if we try to compress the depth of a circuit family (parallel time) more than a constant factor we will suffer super-quasipolynomial blowup in the size (number of processors). This assumption is only slightly stronger than the popular assumption about the robustness of NC, and we observe that it has surprising consequences. Note also...

Any monotone Boolean function on a lattice can be described by the set of its minimal 1 values. If a lattice is given as a concept lattice, this set can be represented by the set of minimal hypotheses of a classification context. Enumeration of minimal hypotheses in output polynomial time is shown to be impossible unless P = NP, which shows that dualization of monotone functions on lattices wit...

Fagin et al. characterized those symmetric Boolean functions which can be computed by small AND/OR circuits of constant depth and unbounded fan-in. Here we provide a similar characterization for d-perceptrons | AND/OR circuits of constant depth and unbounded fan-in with a single MAJORITY gate at the output. We show that a symmetric function has small (quasipolynomial, or 2 log O(1) n size) d-pe...

In this note we show that any k-CNF which can be refuted by a quasi-polynomial Res(polylog) refutation has a “narrow” refutation in Res (i.e., of poly-logarithmic width). Notice that while Res(polylog) is a complete proof system, this is not the case for Res if we ask for a narrow refutation. In particular is not even possible to express all CNFs with narrow clauses. But even for constant width...

The rst measurement of the quasi-free p+n!p+n+ reaction cross section has been made at the CELSIUS storage ring using a deuterium internal cluster jet target. The energy dependence of the cross section is extracted using a xed incident proton energy of T p = 1350 MeV and exploiting the Fermi momentum of the struck neutron. The data cover a range of centre-of-mass excess energies from 16 MeV to ...