Related papers: An Explicit Near-Conjugacy Between the Collatz Map…
We present sufficient conditions so that a conformal map between planar domains whose boundary components are Jordan curves or points has a continuous or homeomorphic extension to the closures of the domains. Our conditions involve the…
Probabilistic rounding error analysis can yield much sharper bounds than classical worst-case theory, but existing results typically rely on zero-mean rounding errors and often leave the confidence parameter implicit. This work revisits…
We prove that any two real-analytic critical circle maps with cubic critical point and the same irrational rotation number of bounded type are $C^{1+\alpha}$ conjugate for some $\alpha>0$.
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal…
The random percolation model can be viewed as the dual of a well defined confining gauge theory; since this theory, having no Monte Carlo dynamics at all, is simple to simulate, it is possible to study the properties of the flux tube with…
Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition…
Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ with many more rows…
Turbulent Taylor-Couette flow between counter-rotating cylinders develops intermittently fluctuating boundary layers for sufficient counter-rotation. We demonstrate the phenomenon in direct numerical simulations for radius ratios \eta=0.5…
It is shown that if $f$ and $g$ are any two analytic critical circle mappings with the same irrational rotation number, then the conjugacy that maps the critical point of $f$ to that of $g$ has regularity $C^{1+\alpha}$ at the critical…
Given an $r\times r$ complex matrix $T$, if $T=U|T|$ is the polar decomposition of $T$, then, the Aluthge transform is defined by $$ \Delta(T)= |T|^{1/2} U |T |^{1/2}. $$ Let $\Delta^{n}(T)$ denote the n-times iterated Aluthge transform of…
We introduce a variant of PCPs, that we refer to as rectangular PCPs, wherein proofs are thought of as square matrices, and the random coins used by the verifier can be partitioned into two disjoint sets, one determining the row of each…
Let $\lambda \in (0,1)$ and let $T$ be a $r\times r$ complex matrix with polar decomposition $T=U|T|$. Then, the $\la$- Aluthge transform is defined by $$ \Delta_\lambda (T )= |T|^{\lambda} U |T |^{1-\lambda}. $$ Let $\Delta_\lambda^{n}(T)$…
We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…
We give a self-contained randomized algorithm based on shifted inverse iteration which provably computes the eigenvalues of an arbitrary matrix $M\in\mathbb{C}^{n\times n}$ up to backward error $\delta\|M\|$ in…
We consider the combined effect of readout errors and coherent errors, i.e., deterministic phase rotations, on the surface code. We use a recently developed numerical approach, via a mapping of the physical qubits to Majorana fermions. We…
In this paper, we establish new explicit bounds for the Mertens function $M(x)$. In particular, we compare $M(x)$ against a short-sum over the non-trivial zeros of the Riemann zeta-function $\zeta(s)$, whose difference we can bound using…
We demonstrate that, even when there are moderate overlaps in the inputs of sloppy or accurate double-word addition algorithms in the QD library, these algorithms still guarantee error bounds of $O(u^2(|a|+|b|))$ in faithful rounding.…
Recent work showed holographic error correcting codes to have simple universal features at $O(1/G)$. In particular, states of fixed Ryu-Takayanagi (RT) area in such codes are associated with flat entanglement spectra indicating maximal…
We establish rigorous error bounds for prime counting using a truncated Gaussian (TG) kernel in the explicit formula framework. Our main theorem proves that the approximation error remains globally below 1/2 for all sufficiently large…
We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture is easier to explore because certain…