2,103+ open-access research outputs.
We study square-base Calderbank--Shor--Steane (CSS) hypergraph-product codes as a finite-length class for regular high-girth quantum low-density parity-check (LDPC) design. For base matrices of small โฆ
A convex polyhedron is Rupert if a hole can be cut into it (making its genus $1$) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of Jerrard-Wetzel-Yuanโฆ
In this paper, we introduce GET-2D-1.0, a fast grasp planner for the GET asymmetrical gripper that operates from a single-view RGB-D image, using the Ferrari-Canny metric and a novel sampling strategyโฆ
Stephen Wolfram proclaimed in his 2003 seminal work "A New Kind Of Science" that simple recursive programs in the form of Cellular Automata (CA) are a promising approach to replace currently used mathโฆ
The Peyrard-Bishop-Dauxois (PBD) model of DNA denaturation, although successful in the description of melting profiles, fails to predict melting entropies, unzipping forces and dynamical properties, eโฆ
We construct a quantum low-density parity-check code family from a length-$512$ Calderbank--Shor--Steane base matrix pair. The base pair is permutation-equivalent to the known SPC(3) product CSS code,โฆ
We give a new simple geometric proof that any seven points in the plane have four Tverberg partitions into three sets. This is the only confirmed non-trivial case of Sierksma's conjecture. Earlier proโฆ
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We prove this for every nonrecursive \ce\ many-one degree containing a $D$-maximal set.โฆ
This paper investigates certified upper bounds on the minimum distance of an explicit family of Calderbank-Shor-Steane quantum LDPC codes constructed from affine permutation matrices. All codes considโฆ
We study the singular central fibre arising in the Donaldson-Friedman construction for twistor spaces of connected sums, viewing it as a Ferrand pushout of two blown-up twistor spaces along the exceptโฆ
Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerabโฆ
Randomized experiments have long been the gold standard for scientists seeking to learn about cause and effect. When randomized experiments are infeasible, scientists often resort to observational stuโฆ
The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic candidate for realizing fault-tolerant quantum computation. Among existing error-correction protocols for GKP code, the Steane-type scheโฆ
W. L. Ferrar seems to have been the first mathematician to clearly draw a connection between the functional aspects of a summation formula and the behavior of the Dirichlet series underlying it. Takinโฆ
Many theoretical predictions in fluctuating hydrodynamics under uniform shear flow have lacked precise quantitative verification due to analytical approximations whose quantitative impacts are difficuโฆ
We present the first complete calculation of the analytic structure of the zero-spatial-momentum finite-temperature Landau-gauge gluon propagator carried out at one loop by a massive deformation of QCโฆ
We present a novel proposal for the effective Lagrangian of the low-energy Yang--Mills quantum field theory. The proposed effective Lagrangian exhibits the spontaneous BRST symmetry breaking. We builtโฆ
We construct a nonrecursive set \(A\le_T\emptyset'\) and a uniformly computable family of sets \(C_0,C_1,\dots\), all bounded finite-one equivalent to \(A\), such that the corresponding \(1\)-degrees โฆ
We present new MeerKAT 21cm spectral line observations of the neutral hydrogen gas in the compact galaxy group Stephan's Quintet (HCG 92). These data provide a significantly improved view of the atomiโฆ
We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. In the fixed-degree regime, we prove that the coding rate stays bouโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ