Results 11 to 20 of about 33,175 (269)
Lattice meets lattice: Application of lattice cubature to models in lattice gauge theory [PDF]
High dimensional integrals are abundant in many fields of research including quantum physics. The aim of this paper is to develop efficient recursive strategies to tackle a class of high dimensional integrals having a special product structure with low order couplings, motivated by models in lattice gauge theory from quantum field theory.
Hartung, Tobias +5 more
openaire +6 more sources
Partial categorification of Hopf algebras and representation theory of towers of \mathcalJ-trivial monoids [PDF]
This paper considers the representation theory of towers of algebras of $\mathcal{J} -trivial$ monoids. Using a very general lemma on induction, we derive a combinatorial description of the algebra and coalgebra structure on the Grothendieck rings $G_0 ...
Aladin Virmaux
doaj +1 more source
Hochschild lattices and shuffle lattices [PDF]
In his study of a Hochschild complex arising in connection with the free loop fibration, S. Saneblidze defined the freehedron, a certain polytope constructed via a truncation process from the hypercube. It was recently conjectured by F. Chapoton and proven by C.
openaire +2 more sources
On Weakly Associative Lattices and Near Lattices [PDF]
Summary . The main aim of this article is to introduce formally two generalizations of lattices, namely weakly associative lattices and near lattices, which can be obtained from the former by certain weakening of the usual well-known axioms.
Damian Sawicki, Adam Grabowski
openaire +2 more sources
Quantum-Resistant Cryptography for the Internet of Things Based on Location-Based Lattices
An important enabler of the Internet of Things (IoT) is the Narrow-Band Internet of Things (NB-IoT) technology, which is a 3GPP standards compliant connectivity solution.
Ohood Saud Althobaiti, Mischa Dohler
doaj +1 more source
Security Analysis of Hybrid Attack for NTRU-Class Encryption Schemes
One of the significant post-quantum cryptographic candidates is the NTRU public key cryptosystem. It operates on polynomial rings, where the parameter largely determines the security of the system.
Alla Levina +2 more
doaj +1 more source
The polynomial learning with errors problem and the smearing condition
As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
doaj +1 more source
Lattice surgery on the Raussendorf lattice [PDF]
Abstract Lattice surgery is a method to perform quantum computation fault-tolerantly by using operations on boundary qubits between different patches of the planar code. This technique allows for universal planar code computation without eliminating the intrinsic two-dimensional nearest-neighbor properties of the surface code that ...
Daniel Herr +3 more
openaire +2 more sources
Embedding lattices into lattices of ideals [PDF]
A lattice L is transferable iff, whenever L can be embedded in the ideal lattice of a lattice M, then L can be embedded in M. This concept was introduced by the first author in 1965 who also proved in 1966 that in a transferable lattice there are no doubly reducible elements. In fact, he proved that every lattice can be embedded in the ideal lattice of
Grätzer, G., Platt, C. R., Sands, B.
openaire +3 more sources
3D Printed Elastomeric Lattices With Embedded Deformation Sensing
New durable elastomeric materials are commercially available for 3D printing, enabling a new class of consumer wearable applications. The mechanical response of soft 3D printed lattices can now be tailored for improved safety and comfort by (a ...
Carolyn Carradero Santiago +6 more
doaj +1 more source

