Related papers: Solovay reducibility implies S2a-reducibility
A new necessary separability criterion that relates the structures of the total density matrix and its reductions is given. The method used is based on the realignment method [K. Chen and L.A. Wu, Quant. Inf. Comput. 3, 193 (2003)]. The new…
The normality measure $\mathcal{N}$ has been introduced by Mauduit and S{\'a}rk{\"o}zy in order to describe the pseudorandomness properties of finite binary sequences. Alon, Kohayakawa, Mauduit, Moreira and R{\"o}dl proved that the minimal…
Recent progress concerning regularization of supersymmetric theories is reviewed. Dimensional reduction is reformulated in a mathematically consistent way, and an elegant and general method is presented that allows to study the…
In this paper, we introduce a new semi-discrete modulus of smoothness, which generalizes the definition given by Kolomoitsev and Lomako (KL) in 2023 (in the paper published in the J. Approx. Theory), and we establish very general one- and…
It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the…
A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…
Cauchy's sum theorem of 1821 has been the subject of rival interpretations ever since Robinson proposed a novel reading in the 1960s. Some claim that Cauchy modified the hypothesis of his theorem in 1853 by introducing uniform convergence,…
Alternative theories of relativistic rotation considered viable as of 2004 are compared in the light of experiments reported in 2005. En route, the contentious issue of simultaneity choice in rotation is resolved by showing that only one…
Let $A$ be an excellent two-dimensional normal local ring containing an algebraically closed field and let $X\to \mathrm{Spec} (A)$ be a resolution of singularity. We prove a theorem giving a condition under which the dimension of the…
Resolving a conjecture of von Neumann, Ogata's theorem in arXiv:1111.5933 showed the highly nontrivial result that arbitrarily many matrices corresponding to macroscopic observables with $N$ sites and a fixed site dimension $d$ are…
We formulate a classification conjecture for conformally invariant families of measures on simple loops that builds on a conjecture of Kontsevich and Suhov. The main example in this class of objects was constructed by Werner as boundaries…
The paper gives a historical survey of the causal position space renormalization with a special attention to the role of Raymond Stora in the development of this subject. Renormalization is reduced to subtracting the pole term in…
The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of…
Tracy et al.[8] have introduced a family of estimators using Srivenkataramana and Tracy ([6],[7]) transformation in simple random sampling. In this article, we have proposed a dual to ratio-cum-product estimator in stratified random…
This paper extends the link between stochastic approximation (SA) theory and randomized urn models developed in Laruelle, Pag{\`e}s (2013), and their applications to clinical trials introduced in Bai, HU (1999,2005) and Bai, Hu, Shen…
We present a comparative study of two methods for the reduction of the dimensionality of a system of ordinary differential equations that exhibits time-scale separation. Both methods lead to a reduced system of stochastic differential…
The entropy in dynamical systems was introduced by A. Kolmogorov. Initially dedicated to iterations of one finite measure preserving transformation, the notion was gradually generalized so as to encompass amenable group actions and…
The notion of replicable algorithms was introduced in Impagliazzo et al. [STOC '22] to describe randomized algorithms that are stable under the resampling of their inputs. More precisely, a replicable algorithm gives the same output with…
This paper provides a user's guide to the general theory of approximate randomization tests developed in Canay, Romano, and Shaikh (2017) when specialized to linear regressions with clustered data. An important feature of the methodology is…
The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…