Relevant bibliographies by topics / Lattices theory

Academic literature on the topic 'Lattices theory'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Lattices theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Lattices theory"

1

Day, Alan. "Doubling Constructions in Lattice Theory." Canadian Journal of Mathematics 44, no. 2 (April 1, 1992): 252–69. http://dx.doi.org/10.4153/cjm-1992-017-7.

Full text
Abstract:
AbstractThis paper examines the simultaneous doubling of multiple intervals of a lattice in great detail. In the case of a finite set of W-failure intervals, it is shown that there in a unique smallest lattice mapping homomorphically onto the original lattice, in which the set of W-failures is removed. A nice description of this new lattice is given. This technique is used to show that every lattice that is a bounded homomorphic image of a free lattice has a projective cover. It is also used to give a sufficient condition for a fintely presented lattice to be weakly atomic and shows that the problem of which finitely presented lattices are finite is closely related to the problem of characterizing those finite lattices with a finite W-cover.
APA, Harvard, Vancouver, ISO, and other styles
2

Flaut, Cristina, Dana Piciu, and Bianca Liana Bercea. "Some Applications of Fuzzy Sets in Residuated Lattices." Axioms 13, no. 4 (April 18, 2024): 267. http://dx.doi.org/10.3390/axioms13040267.

Full text
Abstract:
Many papers have been devoted to applying fuzzy sets to algebraic structures. In this paper, based on ideals, we investigate residuated lattices from fuzzy set theory, lattice theory, and coding theory points of view, and some applications of fuzzy sets in residuated lattices are presented. Since ideals are important concepts in the theory of algebraic structures used for formal fuzzy logic, first, we investigate the lattice of fuzzy ideals in residuated lattices and study some connections between fuzzy sets associated to ideals and Hadamard codes. Finally, we present applications of fuzzy sets in coding theory.
APA, Harvard, Vancouver, ISO, and other styles
3

Harremoës, Peter. "Entropy Inequalities for Lattices." Entropy 20, no. 10 (October 12, 2018): 784. http://dx.doi.org/10.3390/e20100784.

Full text
Abstract:
We study entropy inequalities for variables that are related by functional dependencies. Although the powerset on four variables is the smallest Boolean lattice with non-Shannon inequalities, there exist lattices with many more variables where the Shannon inequalities are sufficient. We search for conditions that exclude the existence of non-Shannon inequalities. The existence of non-Shannon inequalities is related to the question of whether a lattice is isomorphic to a lattice of subgroups of a group. In order to formulate and prove the results, one has to bridge lattice theory, group theory, the theory of functional dependences and the theory of conditional independence. It is demonstrated that the Shannon inequalities are sufficient for planar modular lattices. The proof applies a gluing technique that uses that if the Shannon inequalities are sufficient for the pieces, then they are also sufficient for the whole lattice. It is conjectured that the Shannon inequalities are sufficient if and only if the lattice does not contain a special lattice as a sub-semilattice.
APA, Harvard, Vancouver, ISO, and other styles
4

Ježek, J., P. PudláK, and J. Tůma. "On equational theories of semilattices with operators." Bulletin of the Australian Mathematical Society 42, no. 1 (August 1990): 57–70. http://dx.doi.org/10.1017/s0004972700028148.

Full text
Abstract:
In 1986, Lampe presented a counterexample to the conjecture that every algebraic lattice with a compact greatest element is isomorphic to the lattice of extensions of an equational theory. In this paper we investigate equational theories of semi-lattices with operators. We construct a class of lattices containing all infinitely distributive algebraic lattices with a compact greatest element and closed under the operation of taking the parallel join, such that every element of the class is isomorphic to the lattice of equational theories, extending the theory of a semilattice with operators.
APA, Harvard, Vancouver, ISO, and other styles
5

Frapolli, Nicolò, Shyam Chikatamarla, and Ilya Karlin. "Theory, Analysis, and Applications of the Entropic Lattice Boltzmann Model for Compressible Flows." Entropy 22, no. 3 (March 24, 2020): 370. http://dx.doi.org/10.3390/e22030370.

Full text
Abstract:
The entropic lattice Boltzmann method for the simulation of compressible flows is studied in detail and new opportunities for extending operating range are explored. We address limitations on the maximum Mach number and temperature range allowed for a given lattice. Solutions to both these problems are presented by modifying the original lattices without increasing the number of discrete velocities and without altering the numerical algorithm. In order to increase the Mach number, we employ shifted lattices while the magnitude of lattice speeds is increased in order to extend the temperature range. Accuracy and efficiency of the shifted lattices are demonstrated with simulations of the supersonic flow field around a diamond-shaped and NACA0012 airfoil, the subsonic, transonic, and supersonic flow field around the Busemann biplane, and the interaction of vortices with a planar shock wave. For the lattices with extended temperature range, the model is validated with the simulation of the Richtmyer–Meshkov instability. We also discuss some key ideas of how to reduce the number of discrete speeds in three-dimensional simulations by pruning of the higher-order lattices, and introduce a new construction of the corresponding guided equilibrium by entropy minimization.
APA, Harvard, Vancouver, ISO, and other styles
6

McCulloch, Ryan. "Finite groups with a trivial Chermak–Delgado subgroup." Journal of Group Theory 21, no. 3 (May 1, 2018): 449–61. http://dx.doi.org/10.1515/jgth-2017-0042.

Full text
Abstract:
Abstract The Chermak–Delgado lattice of a finite group is a modular, self-dual sublattice of the lattice of subgroups of G. The least element of the Chermak–Delgado lattice of G is known as the Chermak–Delgado subgroup of G. This paper concerns groups with a trivial Chermak–Delgado subgroup. We prove that if the Chermak–Delgado lattice of such a group is lattice isomorphic to a Cartesian product of lattices, then the group splits as a direct product, with the Chermak–Delgado lattice of each direct factor being lattice isomorphic to one of the lattices in the Cartesian product. We establish many properties of such groups and properties of subgroups in the Chermak–Delgado lattice. We define a CD-minimal group to be an indecomposable group with a trivial Chermak–Delgado subgroup. We establish lattice theoretic properties of Chermak–Delgado lattices of CD-minimal groups. We prove an extension theorem for CD-minimal groups, and use the theorem to produce twelve examples of CD-minimal groups, each having different CD lattices. Curiously, quasi-antichain p-group lattices play a major role in the author’s constructions.
APA, Harvard, Vancouver, ISO, and other styles
7

Grabowski, Adam. "Stone Lattices." Formalized Mathematics 23, no. 4 (December 1, 2015): 387–96. http://dx.doi.org/10.1515/forma-2015-0031.

Full text
Abstract:
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 pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the other which is dense. The core of the paper is of course the idea of Stone identity $$a^* \sqcup a^{**} = {\rm{T}},$$ which is fundamental for us: Stone lattices are those lattices L, which are distributive, bounded, and satisfy Stone identity for all elements a ∈ L. Stone algebras were introduced by Grätzer and Schmidt in [18]. Of course, the pseudocomplement is unique (if exists), so in a pseudcomplemented lattice we defined a * as the Mizar functor (unary operation mapping every element to its pseudocomplement). In Section 2 we prove formally a collection of ordinary properties of pseudocomplemented lattices. All Boolean lattices are Stone, and a natural example of the lattice which is Stone, but not Boolean, is the lattice of all natural divisors of p 2 for arbitrary prime number p (Section 6). At the end we formalize the notion of the Stone lattice B [2] (of pairs of elements a, b of B such that a ⩽ b) constructed as a sublattice of B 2, where B is arbitrary Boolean algebra (and we describe skeleton and the set of dense elements in such lattices). In a natural way, we deal with Cartesian product of pseudocomplemented lattices. Our formalization was inspired by [17], and is an important step in formalizing Jouni Järvinen Lattice theory for rough sets [19], so it follows rather the latter paper. We deal essentially with Section 4.3, pages 423–426. The description of handling complemented structures in Mizar [6] can be found in [12]. The current article together with [15] establishes the formal background for algebraic structures which are important for [10], [16] by means of mechanisms of merging theories as described in [11].
APA, Harvard, Vancouver, ISO, and other styles
8

Bronzan, J. B. "Hamiltonian lattice gauge theory: wavefunctions on large lattices." Nuclear Physics B - Proceedings Supplements 30 (March 1993): 916–19. http://dx.doi.org/10.1016/0920-5632(93)90356-b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ge, Mo-Lin, Liangzhong Hu, and Yiwen Wang. "KNOT THEORY, PARTITION FUNCTION AND FRACTALS." Journal of Knot Theory and Its Ramifications 05, no. 01 (February 1996): 37–54. http://dx.doi.org/10.1142/s0218216596000047.

Full text
Abstract:
In this paper we first provide the open chain and the closed chain method to calculate the partition functions of the typical fractal lattices, i.e. a special kind of Sierpinski carpets(SC) and the triangular Sierpinski gaskets(SG). We then apply knot theory to fractal lattices by changing lattice graphs into link diagrams according to the interaction models, and explicitly obtain the partition functions of a special SC for the edge interaction models. These partition functions are also the knot invariants of the corresponding link diagrams. This is the first time that topology enters into fractals.
APA, Harvard, Vancouver, ISO, and other styles
10

NEBE, GABRIELE. "ON AUTOMORPHISMS OF EXTREMAL EVEN UNIMODULAR LATTICES." International Journal of Number Theory 09, no. 08 (December 2013): 1933–59. http://dx.doi.org/10.1142/s179304211350067x.

Full text
Abstract:
The automorphism groups of the three known extremal even unimodular lattices of dimension 48 and the one of dimension 72 are determined using the classification of finite simple groups. Restrictions on the possible automorphisms of 48-dimensional extremal lattices are obtained. We classify all extremal lattices of dimension 48 having an automorphism of order m with φ(m) > 24. In particular the lattice P48nis the unique extremal 48-dimensional lattice that arises as an ideal lattice over a cyclotomic number field.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Lattices theory"

1

Race, David M. (David Michael). "Consistency in Lattices." Thesis, North Texas State University, 1986. https://digital.library.unt.edu/ark:/67531/metadc331688/.

Full text
Abstract:
Let L be a lattice. For x ∈ L, we say x is a consistent join-irreducible if x V y is a join-irreducible of the lattice [y,1] for all y in L. We say L is consistent if every join-irreducible of L is consistent. In this dissertation, we study the notion of consistent elements in semimodular lattices.
APA, Harvard, Vancouver, ISO, and other styles
2

Radu, Ion. "Stone's representation theorem." CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3087.

Full text
Abstract:
The thesis analyzes some aspects of the theory of distributive lattices, particularly two representation theorems: Birkhoff's representation theorem for finite distributive lattices and Stone's representation theorem for infinite distributive lattices.
APA, Harvard, Vancouver, ISO, and other styles
3

Gragg, Karen E. (Karen Elizabeth). "Dually Semimodular Consistent Lattices." Thesis, North Texas State University, 1988. https://digital.library.unt.edu/ark:/67531/metadc330641/.

Full text
Abstract:
A lattice L is said to be dually semimodular if for all elements a and b in L, a ∨ b covers b implies that a covers a ∧ b. L is consistent if for every join-irreducible j and every element x in L, the element x ∨ j is a join-irreducible in the upper interval [x,l]. In this paper, finite dually semimodular consistent lattices are investigated. Examples of these lattices are the lattices of subnormal subgroups of a finite group. In 1954, R. P. Dilworth proved that in a finite modular lattice, the number of elements covering exactly k elements is equal to the number of elements covered by exactly k elements. Here, it is established that if a finite dually semimodular consistent lattice has the same number of join-irreducibles as meet-irreducibles, then it is modular. Hence, a converse of Dilworth's theorem, in the case when k equals 1, is obtained for finite dually semimodular consistent lattices. Several combinatorial results are shown for finite consistent lattices similar to those already established for finite geometric lattices. The reach of an element x in a lattice L is the difference between the rank of x*, the join of x and all the elements covering x, and the rank of x; the maximum reach of all elements in L is the reach of L. Sharp lower bounds for the total number of elements and the number of elements of a given reach in a semimodular consistent lattice given the rank, the reach, and the number of join-irreducibles are found. Extremal lattices attaining these bounds are described. Similar results are then obtained for finite dually semimodular consistent lattices.
APA, Harvard, Vancouver, ISO, and other styles
4

Cheng, Y. "Theory of integrable lattices." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.568779.

Full text
Abstract:
This thesis deals with the theory of integrable lattices in "solitons" throughout. Chapter 1 is a general introduction, which includes an historical survey and a short surrunary of the "solitons" theory and the present work. In Chapter 2, we discuss the equivalence between two kinds of lattice AKNS spectral problems - one includes two potentials, while the other includes four. The two nonlinear lattice systems associated with those two spectral problems, respectively is also proved to be equivalent to each other. In Chapter 3, we derive a class of nonlinear differential-difference equations (NDDEs) and put them into the Hamiltonian systems. Their complete integrability are proved in terms of so called "r-matrix". In the end of this Chapter, we study the symmetry properties and the related topics for lattice systems. In particular, we give detail for the Toda lattice systems. Chapter 4 is concerned with the Backlund transformations (BTs) and nonlinear superposition formulae (NSFs) for a class of NDDEs. A new method is presented to derive the generalized BTs and to prove that these BTs are precisely and really the auto-BTs. The three kinds of NSFs are derived by analysis of so called "elementary BTs". In Chapter 5, we investigate some relations between our lattices and the well-studied continuous systems. The continuum limits of our lattice systems and the discretizations of the continuous systems are discussed. The other study is about how we can consider a BT of continuous systems as a NDDE and then how a BT of such a NDDE can be reduced to the three kinds of NSFs of the continuous systems. The last Chapter is a study of integrable lattices under periodic boundary conditions. It provides a mathematical foundation for the study of integrable models in statistical mechanics. We are particularly interested in the lattice sine-Gordon and sinh-Gordon models. We not only prove the integrability of these models but also derive all kinds of classical phase shifts and some other physically interesting relations.
APA, Harvard, Vancouver, ISO, and other styles
5

Heeney, Xiang Xia Huang. "Small lattices." Thesis, University of Hawaii at Manoa, 2000. http://hdl.handle.net/10125/25936.

Full text
Abstract:
This dissertation introduces triple gluing lattices and proves that a triple gluing lattice is small if the key subcomponents are small. Then attention is turned to triple gluing irreducible small lattices. The triple gluing irreducible [Special characters omitted.] lattices are introduced. The conditions which insure [Special characters omitted.] small are discovered. This dissertation also give some triple gluing irreducible small lattices by gluing [Special characters omitted.] 's. Finally, K-structured lattices are introduced. We prove that a K-structured lattice L is triple gluing irreducible if and only if [Special characters omitted.] . We prove that no 4-element antichain lies in u 1 /v1 of a K-structured small lattice. We also prove that some special lattices with 3-element antichains can not lie in u1 /v1 of a K-structured small lattice.
viii, 87 leaves, bound : ill. ; 29 cm.
Thesis (Ph. D.)--University of Hawaii at Manoa, 2000.
APA, Harvard, Vancouver, ISO, and other styles
6

Craig, Andrew Philip Knott. "Lattice-valued uniform convergence spaces the case of enriched lattices." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1005225.

Full text
Abstract:
Using a pseudo-bisymmetric enriched cl-premonoid as the underlying lattice, we examine different categories of lattice-valued spaces. Lattice-valued topological spaces, uniform spaces and limit spaces are described, and we produce a new definition of stratified lattice-valued uniform convergence spaces in this generalised lattice context. We show that the category of stratified L-uniform convergence spaces is topological, and that the forgetful functor preserves initial constructions for the underlying stratified L-limit space. For the case of L a complete Heyting algebra, it is shown that the category of stratified L-uniform convergence spaces is cartesian closed.
APA, Harvard, Vancouver, ISO, and other styles
7

Jipsen, Peter. "Varieties of lattices." Master's thesis, University of Cape Town, 1988. http://hdl.handle.net/11427/15851.

Full text
Abstract:
Bibliography: pages 140-145.
An interesting problem in universal algebra is the connection between the internal structure of an algebra and the identities which it satisfies. The study of varieties of algebras provides some insight into this problem. Here we are concerned mainly with lattice varieties, about which a wealth of information has been obtained in the last twenty years. We begin with some preliminary results from universal algebra and lattice theory. The next chapter presents some properties of the lattice of all lattice sub-varieties. Here we also discuss the important notion of a splitting pair of varieties and give several characterisations of the associated splitting lattice. The more detailed study of lattice varieties splits naturally into the study of modular lattice varieties and non-modular lattice varieties, dealt with in the second and third chapter respectively. Among the results discussed there are Freese's theorem that the variety of all modular lattices is not generated by its finite members, and several results concerning the question which varieties cover a given variety. The fourth chapter contains a proof of Baker's finite basis theorem and some results about the join of finitely based lattice varieties. Included in the last chapter is a characterisation of the amalgamation classes of certain congruence distributive varieties and the result that there are only three lattice varieties which have the amalgamation property.
APA, Harvard, Vancouver, ISO, and other styles
8

Bystrik, Anna. "On Delocalization Effects in Multidimensional Lattices." Thesis, University of North Texas, 1998. https://digital.library.unt.edu/ark:/67531/metadc278868/.

Full text
Abstract:
A cubic lattice with random parameters is reduced to a linear chain by the means of the projection technique. The continued fraction expansion (c.f.e.) approach is herein applied to the density of states. Coefficients of the c.f.e. are obtained numerically by the recursion procedure. Properties of the non-stationary second moments (correlations and dispersions) of their distribution are studied in a connection with the other evidences of transport in a one-dimensional Mori chain. The second moments and the spectral density are computed for the various degrees of disorder in the prototype lattice. The possible directions of the further development are outlined. The physical problem that is addressed in the dissertation is the possibility of the existence of a non-Anderson disorder of a specific type. More precisely, this type of a disorder in the one-dimensional case would result in a positive localization threshold. A specific type of such non-Anderson disorder was obtained by adopting a transformation procedure which assigns to the matrix expressing the physics of the multidimensional crystal a tridiagonal Hamiltonian. This Hamiltonian is then assigned to an equivalent one-dimensional tight-binding model. One of the benefits of this approach is that we are guaranteed to obtain a linear crystal with a positive localization threshold. The reason for this is the existence of a threshold in a prototype sample. The resulting linear model is found to be characterized by a correlated and a nonstationary disorder. The existence of such special disorder is associated with the absence of Anderson localization in specially constructed one-dimensional lattices, when the noise intensity is below the non-zero critical value. This work is an important step towards isolating the general properties of a non-Anderson noise. This gives a basis for understanding of the insulator to metal transition in a linear crystal with a subcritical noise.
APA, Harvard, Vancouver, ISO, and other styles
9

Madison, Kirk William. "Quantum transport in optical lattices /." Digital version accessible at:, 1998. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ocansey, Evans Doe. "Enumeration problems on lattices." Thesis, Stellenbosch : Stellenbosch University, 2013. http://hdl.handle.net/10019.1/80393.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2013.
ENGLISH ABSTRACT: The main objective of our study is enumerating spanning trees (G) and perfect matchings PM(G) on graphs G and lattices L. We demonstrate two methods of enumerating spanning trees of any connected graph, namely the matrix-tree theorem and as a special value of the Tutte polynomial T(G; x; y). We present a general method for counting spanning trees on lattices in d 2 dimensions. In particular we apply this method on the following regular lattices with d = 2: rectangular, triangular, honeycomb, kagomé, diced, 9 3 lattice and its dual lattice to derive a explicit formulas for the number of spanning trees of these lattices of finite sizes. Regarding the problem of enumerating of perfect matchings, we prove Cayley’s theorem which relates the Pfaffian of a skew symmetric matrix to its determinant. Using this and defining the Pfaffian orientation on a planar graph, we derive explicit formula for the number of perfect matchings on the following planar lattices; rectangular, honeycomb and triangular. For each of these lattices, we also determine the bulk limit or thermodynamic limit, which is a natural measure of the rate of growth of the number of spanning trees (L) and the number of perfect matchings PM(L). An algorithm is implemented in the computer algebra system SAGE to count the number of spanning trees as well as the number of perfect matchings of the lattices studied.
AFRIKAANSE OPSOMMING: Die hoofdoel van ons studie is die aftelling van spanbome (G) en volkome afparings PM(G) in grafieke G en roosters L. Ons beskou twee metodes om spanbome in ’n samehangende grafiek af te tel, naamlik deur middel van die matriks-boom-stelling, en as ’n spesiale waarde van die Tutte polinoom T(G; x; y). Ons behandel ’n algemene metode om spanbome in roosters in d 2 dimensies af te tel. In die besonder pas ons hierdie metode toe op die volgende reguliere roosters met d = 2: reghoekig, driehoekig, heuningkoek, kagomé, blokkies, 9 3 rooster en sy duale rooster. Ons bepaal eksplisiete formules vir die aantal spanbome in hierdie roosters van eindige grootte. Wat die aftelling van volkome afparings aanbetref, gee ons ’n bewys van Cayley se stelling wat die Pfaffiaan van ’n skeefsimmetriese matriks met sy determinant verbind. Met behulp van hierdie stelling en Pfaffiaanse oriënterings van planare grafieke bepaal ons eksplisiete formules vir die aantal volkome afparings in die volgende planare roosters: reghoekig, driehoekig, heuningkoek. Vir elk van hierdie roosters word ook die “grootmaat limiet” (of termodinamiese limiet) bepaal, wat ’n natuurlike maat vir die groeitempo van die aantaal spanbome (L) en die aantal volkome afparings PM(L) voorstel. ’n Algoritme is in die rekenaaralgebra-stelsel SAGE geimplementeer om die aantal spanboome asook die aantal volkome afparings in die toepaslike roosters af te tel.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Lattices theory"

1

Kun, Huang, ed. Dynamical theory of crystal lattices. Oxford: Clarendon, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Stern, Manfred. Semimodular lattices: Theory and applications. Cambridge: Cambridge University Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Semimodular lattices. Stuttgart: B.G. Teubner, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lattice theory: First concepts and distributive lattices. Mineola, N.Y: Dover Publications, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Freese, Ralph S. Free lattices. Providence, R.I: American Mathematical Society, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Toda, Morikazu. Theory of Nonlinear Lattices. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-83219-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Toda, Morikazu. Theory of Nonlinear Lattices. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Theory of nonlinear lattices. 2nd ed. Berlin: Springer-Verlag, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

1951-, Hoffmann R. E., and Hofmann Karl Heinrich, eds. Continuous lattices and their applications. New York: M. Dekker, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

service), SpringerLink (Online, ed. Lattice Theory: Foundation. Basel: Springer Basel AG, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Lattices theory"

1

Aigner, Martin. "Lattices." In Combinatorial Theory, 30–72. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59101-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zheng, Zhiyong, Kun Tian, and Fengxia Liu. "Random Lattice Theory." In Financial Mathematics and Fintech, 1–32. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-7644-5_1.

Full text
Abstract:
AbstractIn this chapter, we introduce the basic random theory of lattice, including Fourier transform, discrete Gauss measure, smoothing parameter and some properties of discrete Gauss distribution. Random lattice is a new research topic in lattice theory. However, only a special class of random lattices named Gauss lattice has been defined and studied. We will introduce Gauss lattice, define the smoothing parameter on Gauss lattice, and calculate the statistical distance based on the smoothing parameter
APA, Harvard, Vancouver, ISO, and other styles
3

Corsini, Piergiulio, and Violeta Leoreanu. "Lattices." In Applications of Hyperstructure Theory, 121–60. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3714-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Trifković, Mak. "Lattices." In Algebraic Theory of Quadratic Numbers, 45–59. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-7717-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Beran, Ladislav. "Elementary Theory of Orthomodular Lattices." In Orthomodular Lattices, 28–69. Dordrecht: Springer Netherlands, 1985. http://dx.doi.org/10.1007/978-94-009-5215-7_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Meyer-Nieberg, Peter. "Spectral Theory of Positive Operators." In Banach Lattices, 247–319. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-76724-1_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Grätzer, George. "Distributive Lattices." In General Lattice Theory, 79–168. Basel: Birkhäuser Basel, 2003. http://dx.doi.org/10.1007/978-3-0348-9326-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Constantinescu, Corneliu, Wolfgang Filter, Karl Weber, and Alexia Sontag. "Vector Lattices." In Advanced Integration Theory, 21–278. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-007-0852-5_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Grätzer, George. "Distributive Lattices." In Lattice Theory: Foundation, 109–205. Basel: Springer Basel, 2011. http://dx.doi.org/10.1007/978-3-0348-0018-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kopytov, V. M., and N. Ya Medvedev. "Lattices." In The Theory of Lattice-Ordered Groups, 1–9. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-015-8304-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Lattices theory"

1

Cosmadakis, Stavros S. "Database theory and cylindric lattices." In 28th Annual Symposium on Foundations of Computer Science. IEEE, 1987. http://dx.doi.org/10.1109/sfcs.1987.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Salomon, A. J., and O. Amrani. "On decoding product lattices." In IEEE Information Theory Workshop, 2005. IEEE, 2005. http://dx.doi.org/10.1109/itw.2005.1531883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Horowitz, Alan. "Fermions on Simplicial Lattices and their Dual Lattices." In The 36th Annual International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2019. http://dx.doi.org/10.22323/1.334.0235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zamir, R. "Lattices are everywhere." In 2009 Information Theory and Applications Workshop (ITA). IEEE, 2009. http://dx.doi.org/10.1109/ita.2009.5044976.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yao, Y. Y. "Concept lattices in rough set theory." In IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04. IEEE, 2004. http://dx.doi.org/10.1109/nafips.2004.1337404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Knuth, K. H. "Valuations on Lattices and their Application to Information Theory." In 2006 IEEE International Conference on Fuzzy Systems. IEEE, 2006. http://dx.doi.org/10.1109/fuzzy.2006.1681717.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Boutros, Joseph J., Nicola di Pietro, and Nour Basha. "Generalized low-density (GLD) lattices." In 2014 IEEE Information Theory Workshop (ITW). IEEE, 2014. http://dx.doi.org/10.1109/itw.2014.6970783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Meurice, Yannick. "QCD calculations with optical lattices?" In XXIX International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2012. http://dx.doi.org/10.22323/1.139.0040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hotzy, Paul, Kirill Boguslavski, David I. Müller, and Dénes Sexty. "Highly anisotropic lattices for Yang-Mills theory." In The 40th International Symposium on Lattice Field Theory. Trieste, Italy: Sissa Medialab, 2023. http://dx.doi.org/10.22323/1.453.0150.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kapetanovic, Dzevdan, Hei Victor Cheng, Wai Ho Mow, and Fredrik Rusek. "Optimal lattices for MIMO precoding." In 2011 IEEE International Symposium on Information Theory - ISIT. IEEE, 2011. http://dx.doi.org/10.1109/isit.2011.6034112.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Lattices theory"

1

McCune, W., and R. Padmanabhan. Single identities for lattice theory and for weakly associative lattices. Office of Scientific and Technical Information (OSTI), March 1995. http://dx.doi.org/10.2172/510566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Jianke. Theory and Applications of Nonlinear Optics in Optically-Induced Photonic Lattices. Fort Belvoir, VA: Defense Technical Information Center, February 2012. http://dx.doi.org/10.21236/ada565296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Yee, Ken. Lattice gaugefixing and other optics in lattice gauge theory. Office of Scientific and Technical Information (OSTI), June 1992. http://dx.doi.org/10.2172/10156563.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Yee, Ken. Lattice gaugefixing and other optics in lattice gauge theory. Office of Scientific and Technical Information (OSTI), June 1992. http://dx.doi.org/10.2172/5082303.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Becher, Thomas G. Continuum methods in lattice perturbation theory. Office of Scientific and Technical Information (OSTI), November 2002. http://dx.doi.org/10.2172/808671.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hasslacher, B. Lattice gas hydrodynamics: Theory and simulations. Office of Scientific and Technical Information (OSTI), January 1993. http://dx.doi.org/10.2172/6441616.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hasslacher, B. Lattice gas hydrodynamics: Theory and simulations. Office of Scientific and Technical Information (OSTI), January 1993. http://dx.doi.org/10.2172/6590163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brower, Richard C. National Computational Infrastructure for Lattice Gauge Theory. Office of Scientific and Technical Information (OSTI), April 2014. http://dx.doi.org/10.2172/1127446.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Negele, John W. National Computational Infrastructure for Lattice Gauge Theory. Office of Scientific and Technical Information (OSTI), June 2012. http://dx.doi.org/10.2172/1165874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Reed, Daniel, A. National Computational Infrastructure for Lattice Gauge Theory. Office of Scientific and Technical Information (OSTI), May 2008. http://dx.doi.org/10.2172/951263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Lattices theory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography