Results 11 to 20 of about 5,051 (115)
Hardware acceleration of number theoretic transform for zk‐SNARK
Engineering Reports, EarlyView., 2023 An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
Strong normalisation for applied lambda calculi
, 2005 We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations' are.
Berger, Ulrich
core +4 more sources
Variations on the Theme of Conning in Mathematical Economics [PDF]
, 2007 The mathematization of economics is almost exclusively in terms of the mathematics of real analysis which, in turn, is founded on set theory (and the axiom of choice) and orthodox mathematical logic.
Velupillai, Kumaraswamy
core +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
Termination of rewrite relations on $\lambda$-terms based on Girard's notion of reducibility [PDF]
, 2015 In this paper, we show how to extend the notion of reducibility introduced by Girard for proving the termination of $\beta$-reduction in the polymorphic $\lambda$-calculus, to prove the termination of various kinds of rewrite relations on $\lambda$-terms,
Blanqui, Frédéric
core +4 more sources
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Contributions to Plasma Physics, EarlyView.ABSTRACT Ab initio path integral Monte Carlo (PIMC) simulations constitute the gold standard for the estimation of a broad range of equilibrium properties of a host of interacting quantum many‐body systems spanning a broad range of conditions from ultracold atoms to warm dense quantum plasmas.
Paul Hamann +2 more
wiley +1 more source
The descriptive theory of represented spaces [PDF]
, 2014 This is a survey on the ongoing development of a descriptive theory of represented spaces, which is intended as an extension of both classical and effective descriptive set theory to deal with both sets and functions between represented spaces.
Pauly, Arno
core
Industry Portfolio Volatility Connections and Industry Portfolio Returns
International Journal of Finance &Economics, EarlyView.ABSTRACT This paper tracks dynamic connections that form among daily US industry portfolio return volatilities using a Bayesian time‐varying parameter VAR model. Market participants often focus on sectors to filter vast amounts of information, and this focus results in cross‐industry return predictability. We characterise connections that form over the
Michael Ellington +2 more
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source