Results 11 to 20 of about 112,233 (315)
The Electronic Journal of Combinatorics, 2007 A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way.
Bonin, Joseph E., Joseph E. Bonin
core +6 more sources
Lattice meets lattice: Application of lattice cubature to models in lattice gauge theory [PDF]
Journal of Computational Physics, 2021 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 +7 more sources
Embedding lattices into lattices of ideals [PDF]
Pacific Journal of Mathematics, 1979 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
Hochschild lattices and shuffle lattices [PDF]
European Journal of Combinatorics, 2022 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
Lattice surgery on the Raussendorf lattice [PDF]
Quantum Science and Technology, 2018 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
On Weakly Associative Lattices and Near Lattices [PDF]
Formalized Mathematics, 2021 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
Lattice codes for lattice-based PKE
Designs, Codes and Cryptography, 2023 Existing error correction mechanisms in lattice-based public key encryption (PKE) rely on either naive modulation or its concatenation with error correction codes (ECC). This paper shows that lattice coding, as a joint ECC and modulation technique, can substitute the naive modulation in existing lattice-based PKEs to enjoy better correction performance.
Shanxiang Lyu +4 more
openaire +5 more sources
Lattices with Complemented Tolerance Lattice [PDF]
Czechoslovak Mathematical Journal, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Radeleczki, S., Schweigert, D.
openaire +2 more sources
Ideal lattices of lattices [PDF]
Pacific Journal of Mathematics, 1975 This paper shows that any compactly generated lattice is a subdirect product of subdirectly irreducible lattices which are complete and upper continuous. An example of a compactly generated lattice which cannot be subdirectly decomposed into subdirectly irreducible compactly generated lattices is given.
openaire +2 more sources
One-loop perturbative calculation of Wilson loops on finite lattices [PDF]
, 1985 Heller UM, Karsch F. One-loop perturbative calculation of Wilson loops on finite lattices. Nuclear Physics, B. 1985;251(2):254-278.We present the one-loop (order g 4) perfturbative calculation of the expectation values of Wilson loops and Polyakov lines ...
Karsch, Frithjof +2 more
core +1 more source