Results 31 to 40 of about 112,233 (315)
Tensor-based trapdoors for CVP and their application to public key cryptography [PDF]
, 1999 We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Jean-Pierre Seifert +3 more
core +1 more source
The lattice size of a lattice polygon
Journal of Combinatorial Theory, Series A, 2015 We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the Newton polygon of the latter.
Castryck, Wouter, Cools, Filip
openaire +5 more sources
On ideals in De Morgan residuated lattices [PDF]
, 2018 summary:In this paper, we introduce a new class of residuated lattices called De Morgan residuated lattices, we show that the variety of De Morgan residuated lattices includes important subvarieties of residuated lattices such as Boolean algebras, MV ...
Holdon, Liviu-Constantin
core +1 more source
Additive Manufacturing of Smart Footwear Components for Healthcare Applications
MicromachinesDiabetic foot complications pose significant health risks, necessitating innovative approaches in orthotic design. This study explores the potential of additive manufacturing in producing functional footwear components with lattice-based structures for ...
Aravind Kanna Kundumani Janarthanan +1 more
doaj +1 more source
Principal element lattices [PDF]
, 1996 summary:In this paper we study primary elements in Prüfer lattices and characterize $\alpha $-lattices in terms of Prüfer lattices. Next we study weak ZPI-lattices and characterize almost principal element lattices and principal element lattices in terms
Jayaram, C. +4 more
core +1 more source
Anderson localization in dissipative lattices
, 2023 Anderson localization predicts that wave spreading in disordered lattices can come to a complete halt, providing a universal mechanism for {dynamical localization}.
Longhi, Stefano +1 more
core +1 more source
Formalized Mathematics, 2015 Summary The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a ...
openaire +3 more sources
Convex isomorphism of $Q$-lattices [PDF]
, 1993 summary:V. I. Marmazejev introduced in [3] the following concept: two lattices are convex isomorphic if their lattices of all convex sublattices are isomorphic.
Emanovský, Petr
core +1 more source
Hermitean (semi) lattices and Rolf’s lattice
Algebra universalis, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cecilia de la Maza, Ana, Moresi, Remo
openaire +4 more sources
Sieve algorithms for the shortest vector problem are practical
Journal of Mathematical Cryptology, 2008 The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension.
Nguyen Phong Q., Vidick Thomas
doaj +1 more source