Related papers: Predicting Module-Lattice Reduction
The Korkine-Zolotareff (KZ) reduction has been used in communications and cryptography. In this paper, we modify a very recent KZ reduction algorithm proposed by Zhang et al., resulting in a new algorithm, which can be much faster and more…
The BFKL approach for the investigation of semihard processes is plagued by large next-to-leading corrections, both in the kernel of the universal BFKL Green's function and in the process-dependent impact factors, as well as by large…
We continue our investigation of paraorthomodular BZ*-lattices (PBZ*-lattices), started in \cite{GLP1+,PBZ2,rgcmfp,pbzsums,pbz5}. We shed further light on the structure of the subvariety lattice of the variety $\mathbb{PBZL}^{\ast }$ of…
Zero-forcing (ZF) decoder is a commonly used approximation solution of the integer least squares problem which arises in communications and many other applications. Numerically simulations have shown that the LLL reduction can usually…
We propose a lattice-theoretic framework for modulo sampling of multidimensional bandlimited signals. Standard modulo analog-to-digital converters (ADCs) fold the signal component-wise into a square domain, reducing the recovery problem to…
Surface codes are versatile quantum error-correcting codes known for their planar geometry, making them ideal for practical implementations. While the original proposal used Pauli $X$ or Pauli $Z$ operators in a square structure, these…
In this paper, we thoroughly examined the Berezinskii-Kosterlitz-Thouless (BKT) phase transition in the two-dimensional XY model on the honeycomb lattice. To address its thermodynamical behavior, we combined standard numerical Monte Carlo…
Restricted Boltzmann machines (RBMs) are a powerful class of generative models, but their training requires computing a gradient that, unlike supervised backpropagation on typical loss functions, is notoriously difficult even to…
PBZ*-lattices are bounded lattice-ordered structures endowed with two complements, called Kleene and Brouwer; by definition, they are the paraorthomodular Brouwer-Zadeh lattices in which the pairs of elements with their Kleene complements…
Weber's conjecture (1886) governs three aspects of lattice-based cryptography: the solvability of the Principal Ideal Problem, the freeness of modules over rings of integers, and the tightness of worst-case-to-average-case reductions in…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
A lattice reduction is an algorithm that transforms the given basis of the lattice to another lattice basis such that problems like finding a shortest vector and closest vector become easier to solve. Some of the famous lattice reduction…
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm. In polynomial time it computes a reduced basis with…
Block coordinate methods have been extensively studied for minimization problems, where they come with significant complexity improvements whenever the considered problems are compatible with block decomposition and, moreover, block…
Status of lattice calculations of hadron matrix elements along with CP violation in B and in K systems is reviewed. Lattice has provided useful input which, in conjunction with experimenatl data, leads to the conclusion that CP-odd phase in…
This paper introduces the notion of upper-linearizable/quadratizable functions, a class that extends concavity and DR-submodularity in various settings, including monotone and non-monotone cases over different convex sets. A general…
Status of weak matrix elements is reviewed. In particular, $\epspeps$, $\bkastg$, $B_K$, $B_B$ and $B_{B_s}$ are discussed and the overall situation with respect to the lattice effort and some of its phenomenological implications are…
Block-coordinate descent (BCD) is a popular framework for large-scale regularized optimization problems with block-separable structure. Existing methods have several limitations. They often assume that subproblems can be solved exactly at…
This article present a concise estimate of upper and lower bound on the cardinality containing shortest vector in a lattice reduced by block Korkin-Zolotarev method (BKZ) for different value of the block size. Paper show how density affect…
The Berezinskii-Kosterlitz-Thouless (BKT) essential phase transition in the 2d XY model is revisited. Its mechanism is usually described by the (un)binding of vortex--anti-vortex (V--AV) pairs, which does, however, not provide a clear-cut…