Lattice points in a circle: An improved mean-square asymptotics

Werner Georg Nowak

The search session has expired. Please query the service again.

Displaying similar documents to “Lattice points in a circle: An improved mean-square asymptotics”

The densest lattice in twenty-four dimensions.

Cohn, Henry, Kumar, Abhinav (2004)

Electronic Research Announcements of the American Mathematical Society [electronic only]

Similarity:

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...

Dual Lattice of ℤ-module Lattice

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...

The lattice of equational theories. Part II: The lattice of full sets of terms

Jaroslav Ježek (1981)

Czechoslovak Mathematical Journal

Similarity:

About the equivalence of nullnorms on bounded lattice

M. Nesibe Kesicioğlu (2017)

Kybernetika

Similarity:

In this paper, an equivalence on the class of nullnorms on a bounded lattice based on the equality of the orders induced by nullnorms is introduced. The set of all incomparable elements w.r.t. the order induced by nullnorms is investigated. Finally, the recently posed open problems have been solved.

On a Hadwiger-Wills inequality concerning lattice points.

Kołodziejczyk, Krzysztof (1999)

Beiträge zur Algebra und Geometrie

Similarity:

Incomparability with respect to the triangular order

Emel Aşıcı, Funda Karaçal (2016)

Kybernetika

Similarity:

In this paper, we define the set of incomparable elements with respect to the triangular order for any t-norm on a bounded lattice. By means of the triangular order, an equivalence relation on the class of t-norms on a bounded lattice is defined and this equivalence is deeply investigated. Finally, we discuss some properties of this equivalence.

Crystal lattices and sub-lattices

J. L. Ericksen (1982)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Residuation in orthomodular lattices

Ivan Chajda, Helmut Länger (2017)

Topological Algebra and its Applications

Similarity:

We show that every idempotent weakly divisible residuated lattice satisfying the double negation law can be transformed into an orthomodular lattice. The converse holds if adjointness is replaced by conditional adjointness. Moreover, we show that every positive right residuated lattice satisfying the double negation law and two further simple identities can be converted into an orthomodular lattice. In this case, also the converse statement is true and the corresponence is nearly one-to-one. ...

Embedded Lattice and Properties of Gram Matrix

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in Mizar [14] the definition of embedding of lattice and its properties. We formally define an inner product on an embedded module. We also formalize properties of Gram matrix. We formally prove that an inverse of Gram matrix for a rational lattice exists. Lattice of Z-module is necessary for lattice problems, LLL (Lenstra, Lenstra and Lov´asz) base reduction algorithm [16] and cryptographic systems with lattice [17].