Related papers: Distant decimals of $\pi$
The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…
This paper modifies a n-dimensional Hopf-Cole transformation to the n-dimensional Burgers' system. We obtain the n-dimensional heat conduction equation through the modification of the Hopf-Cole transformation. Then the fourth-order precise…
We propose simple schemes that can perfectly identify projective measurement apparatus secretly chosen from a finite set. Entanglements are used in these schemes both to make possible the perfect identification and to improve the efficiency…
Distance measuring is a very important task in digital geometry and digital image processing. Due to our natural approach to geometry we think of the set of points that are equally far from a given point as a Euclidean circle. Using the…
In this work, we extend the fractional linear multistep methods in [C. Lubich, SIAM J. Math. Anal., 17 (1986), pp.704--719] to the tempered fractional integral and derivative operators in the sense that the tempered fractional derivative…
We study dynamical decoupling in a multi-qubit setting, where it is combined with quantum logic gates. This is illustrated in terms of computation using Heisenberg interactions only, where global decoupling pulses commute with the…
In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…
Motivated by putting empirical work based on (synthetic) election data on a more solid mathematical basis, we analyze six distances among elections, including, e.g., the challenging-to-compute but very precise swap distance and the distance…
Goppa codes form an important class of alternant codes with wide applications in algebraic coding theory and code-based cryptography. Determining the true minimum distance of a Goppa code is a difficult problem. In this paper, we provide a…
We consider a problem concerning the distribution of points with missing digits coordinates that are close to non-degenerate analytic submanifolds. We show that large enough (to be specified in the paper) sets of points with missing digits…
We propose a protocol to improve the accuracy of direct complex state measurements (DSM) by using rebits in real Hilbert spaces. We show that to improve the accuracy, the initial complex state should be decomposed into the real and…
In the present paper we explore a way to represent numbers with respect to the base $-\frac32$ using the set of digits $\{0,1,2\}$. Although this number system shares several properties with the classical decimal system, it shows remarkable…
Reasoning about real number expressions in a proof assistant is challenging. Several problems in theorem proving can be solved by using exact real number computation. I have implemented a library for reasoning and computing with complete…
We study the problem of computing the upper bound of the discrete Fr\'{e}chet distance for imprecise input, and prove that the problem is NP-hard. This solves an open problem posed in 2010 by Ahn \emph{et al}. If shortcuts are allowed, we…
We introduce two new algebraic invariants, the (co)homological distances between continuous maps, which provide computable lower bounds for the homotopic distance and strictly refine the classical cup-length estimates. We then define the…
We comment on past and more recent efforts to derive a formula yielding the fine structure constant in terms of integers and transcendent numbers. We analyse these "exoteric" attitudes and describe the myths regarding {\alpha}, which seems…
Researchers are often perplexed when their machine learning algorithms are required to deal with complex number. Various strategies are commonly employed to project complex number into real number, although it is frequently sacrificing the…
We describe a new arithmetic system for the Magma computer algebra system for working with $p$-adic numbers exactly, in the sense that numbers are represented lazily to infinite $p$-adic precision. This is the first highly featured such…
We recall the notion of nearest integer continued fractions over the Euclidean imaginary quadratic fields $K$ and characterize the "badly approximable" numbers, ($z$ such that there is a $C(z)>0$ with $|z-p/q|\geq C/|q|^2$ for all $p/q\in…
We compute $\epsilon$-factorized differential equations for all dimensionally-regularized integrals of the nonplanar hexa-box topology, which contribute for instance to 2-loop 5-point QCD amplitudes. A full set of pure integrals is…