Related papers: The Rosenberg-Strong Pairing Function
A multivariable version of the strong maximal function is introduced and a sharp distributional estimate for this operator in the spirit of the Jessen, Marcinkiewicz, and Zygmund theorem is obtained. Conditions that characterize the…
We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT$^2_2$ implies DNR over RCA$_0$ but COH does not, and answer a…
The spectral function of a spin-balanced two-dimensional Fermi gas with short-range interactions is calculated by means of a quantum cluster expansion. Good qualitative agreement is found with a recent experiment by Feld $\textit{et al.}$…
The Horton-Strahler (HS) index $r=\max{(i,j)}+\delta_{i,j}$ has been shown to be relevant to a number of physical (such at diffusion limited aggregation) geological (river networks), biological (pulmonary arteries, blood vessels, various…
We generalize the time-honored Weinberg's compositeness relations by including the range corrections through considering a general form factor. In Weinberg's derivation, he considered the effective range expansion up to $\mathcal{O}(p^2)$…
A new type of combinations of Bernstein operators is given in [1]. Here, we introduce another one, which can be used to approximate the functions with singularities. The direct and inverse results of the weighted approximation of this new…
The two point angular correlation function is an excellent measure of structure in the universe. To extract from it the three dimensional power spectrum, one must invert Limber's Equation. Here we perform this inversion using a Bayesian…
A packing function on a set Omega in R^n is a one-to-one correspondence between the set of lattice points in Omega and the set N_0 of nonnegative integers. It is proved that if r and s are relatively prime positive integers such that r…
The theory of two binary relations has the strong amalgamation property when the first relation is assumed to be coarser than the second relation, and each relation satisfies a chosen set of properties from the following list: transitivity,…
This paper is concerned with non-parametric estimation of the entropy in ranked set sampling. Theoretical properties of the proposed estimator are studied. The proposed estimator is compared with the rival estimator in simple random…
We consider a school choice matching model where the priorities for schools are represented by binary relations that may not be weak order. We focus on the (total order) extensions of the binary relations. We introduce a class of algorithms…
Neural networks with tree-based sentence encoders have shown better results on many downstream tasks. Most of existing tree-based encoders adopt syntactic parsing trees as the explicit structure prior. To study the effectiveness of…
The Binary Search Tree (BST) is average in computer science which supports a compact data structure in memory and oneself even conducts a row of quick algorithms, by which people often apply it in dynamical circumstance. Besides these…
It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of…
We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…
We present the results of a quantum Monte Carlo study of the extended $s$ and the $d_{x^2-y^2}$ pairing correlation functions for the two-dimensional Hubbard model, computed with the constrained-path method. For small lattice sizes and weak…
In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be considered to be an extension of Cantor's 1891 second proof and…
In this article we propose a boosting algorithm for regression with functional explanatory variables and scalar responses. The algorithm uses decision trees constructed with multiple projections as the "base-learners", which we call…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…