Searches , social queries for LATTICE ORDER
Search references for LATTICE ORDER. Phrases containing LATTICE ORDER
See searches and references containing LATTICE ORDER!
Search references for LATTICE ORDER. Phrases containing LATTICE ORDER
See searches and references containing LATTICE ORDER!LATTICE ORDER
Set whose pairs have minima and maxima
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered
Lattice_(order)
Positive-definite integral set of repeated points with Abelian group-rank 24
Niemeier lattice for each of these Dynkin diagrams. The complete list of Niemeier lattices is given in the following table. In the table, G0 is the order of
Niemeier_lattice
1990 book on mathematical order theory
Introduction to Lattices and Order is a mathematical textbook on order theory by Brian A. Davey and Hilary Priestley. It was published by the Cambridge
Introduction to Lattices and Order
Introduction_to_Lattices_and_Order
Type of lattice in mathematical order theory
In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition, Modular law a ≤ b implies
Modular_lattice
Special type of lattice
structure of order theory or of universal algebra. Both views and their mutual correspondence are discussed in the article on lattices. In the present
Distributive_lattice
Periodic set of points
Coordinate-wise addition or subtraction of two points in the lattice produces another lattice point. The lattice points are all separated by some minimum distance
Lattice_(group)
Banach space with a compatible structure of a lattice
in functional analysis and order theory, a Banach lattice (X,‖·‖) is a complete normed vector space with a lattice order, ≤ {\displaystyle \leq } , such
Banach_lattice
Bound lattice in which every element has a complement
In the mathematical discipline of order theory, a complemented lattice is a bounded lattice (with least element 0 and greatest element 1), in which every
Complemented_lattice
Topics referred to by the same term
partially ordered access privileges Skew lattice, a non-commutative generalization of order-theoretic lattices Lattice multiplication, a multiplication algorithm
Lattice
In mathematics, and in particular in order theory, a bounded lattice is a lattice that has a least element and a greatest element, usually denoted by 0
Bounded_lattice
24-dimensional repeating pattern of points
In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24-dimensional Euclidean space, E24. It is one of the best models for the kissing
Leech_lattice
Partially ordered set in which all subsets have both a supremum and infimum
lattices may be incomplete. Complete lattices appear in many applications in mathematics and computer science. Both order theory and universal algebra study
Complete_lattice
Group with a compatible partial order
G+. If the order on the group is a linear order, then it is said to be a linearly ordered group. If the order on the group is a lattice order, i.e. any
Partially_ordered_group
Lattice in 8-dimensional space with special properties
mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive-definite, even, unimodular lattice of rank 8. The name
E8_lattice
Quantum chromodynamics on a lattice
introduces a momentum cut-off at the order 1/a, where a is the lattice spacing, which regularizes the theory. As a result, lattice QCD is mathematically well-defined
Lattice_QCD
Algebraic structure
and geometric properties of associativity. More formally, the Tamari lattice of order n, introduced by Dov Tamari (1951) and sometimes notated Tn or Yn,
Tamari_lattice
Subset of incomparable elements
every finite distributive lattice can be represented via join and meet operations on antichains of a finite partial order, or equivalently as union and
Antichain
Nonempty, upper-bounded, downward-closed subset
notion. Ideals are of great importance for many constructions in order and lattice theory. A subset I of a partially ordered set ( P , ≤ ) {\displaystyle
Ideal_(order_theory)
Lattice group in Euclidean space whose points are integer n-tuples
^{n}} whose lattice points are n-tuples of integers. The two-dimensional integer lattice is also called the square lattice (or grid lattice) and the three-dimensional
Integer_lattice
treated in any textbook on lattice and order theory. See the literature given for the articles on order theory and lattice theory. More specific literature
Distributivity_(order_theory)
Topics referred to by the same term
generalizations a lattice ordered group, a group that with a partial ordering that is a lattice order This disambiguation page lists mathematics articles associated
Lattice_group
Equivalence of distributive lattices and set families
distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations
Birkhoff's representation theorem
Birkhoff's_representation_theorem
Lattice whose elements are the subgroups of a given group
subgroups of G {\displaystyle G} , with the partial ordering being set inclusion. In this lattice, the join of two subgroups is the subgroup generated
Lattice_of_subgroups
Concept in mathematics
The concept of a lattice arises in order theory, a branch of mathematics. The Hasse diagram below depicts the inclusion relationships among some important
Map_of_lattices
Existence of certain infima or suprema of a given poset
non-empty finite sets. An order in which all non-empty finite sets have both a supremum and an infimum is called a lattice. It suffices to require that
Completeness_(order_theory)
Partial order with joins
this partial order. A lattice is a partially ordered set that is both a meet- and join-semilattice with respect to the same partial order. Algebraically
Semilattice
Mathematical concept
In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice. As free objects, they have the universal property
Free_lattice
Join-meet algebra on matroid flats
matroids and lattices, a geometric lattice is a finite atomistic semimodular lattice, and a matroid lattice is an atomistic semimodular lattice without the
Geometric_lattice
Concept in order theory
meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible
Join_and_meet
Topics referred to by the same term
Atomic lattice may refer to: In mineralogy, atomic lattice refers to the arrangement of atoms into a crystal structure. In order theory, a lattice is called
Atomic_lattice
lattice fixed by a certain automorphism of order 3, and is analogous to the Barnes–Wall lattice. The automorphism group of the Coxeter–Todd lattice has
Coxeter–Todd_lattice
Completeness (order theory) Dense order Distributivity (order theory) Modular lattice Distributive lattice Completely distributive lattice Ascending chain
List_of_order_theory_topics
Order whose elements are all comparable
set that is closed in the order topology is compact. A totally ordered set (with its order topology) which is a complete lattice is compact. Examples are
Total_order
Ring with a compatible partial order
)} where ≤ {\displaystyle \,\leq \,} is additionally a total order. An l-ring, or lattice-ordered ring, is a partially ordered ring ( A , ≤ ) {\displaystyle
Partially_ordered_ring
recent research has shown that the condition that the partial order of labels must form a lattice unnecessarily limits the power of the model. If this condition
Lattice-based_access_control
Theorem in order and lattice theory
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:
Knaster–Tarski_theorem
Generalized alphabetical order
lexicographic or lexicographical order (also known as lexical order, or dictionary order) is a generalization of the alphabetical order of the dictionaries to sequences
Lexicographic_order
In the branch of mathematics known as order theory, a semimodular lattice, is a lattice that satisfies the following condition: Semimodular law a ∧ b <: a
Semimodular_lattice
Semiconductor company
Lattice Semiconductor Corporation is an American semiconductor company specializing in the design and manufacturing of low-power field-programmable gate
Lattice_Semiconductor
Law in algebra
free variables of the defining pair of identities. Absorption (logic) Lattice (order) See Boolean algebra (structure)#Axiomatics for a proof of the absorption
Absorption_law
Lattice formed by all integer partitions
now called Young diagrams and the partial order on them played a key, even decisive, role. Young's lattice prominently figures in algebraic combinatorics
Young's_lattice
Glossary of terms used in branch of mathematics
that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful
Glossary_of_order_theory
Partially ordered vector space, ordered as a lattice
Riesz space, lattice-ordered vector space or vector lattice is a partially ordered vector space where the order structure is a lattice. Riesz spaces
Riesz_space
algebra, a skew lattice is an algebraic structure that is a non-commutative generalization of a lattice. While the term skew lattice can be used to refer
Skew_lattice
Mathematical operation
mathematics, the goal of lattice basis reduction is to find a basis with short, nearly orthogonal vectors when given an integer lattice basis as input. This
Lattice_reduction
Class of computational fluid dynamics methods
The lattice Boltzmann methods (LBM), originated from the lattice gas automata (LGA) method (Hardy-Pomeau-Pazzis and Frisch-Hasslacher-Pomeau models), is
Lattice_Boltzmann_methods
ordering. The order dual of a vector lattice is an order complete vector lattice. The order dual of a vector lattice X {\displaystyle X} can be finite dimension
Order dual (functional analysis)
Order_dual_(functional_analysis)
Term in the mathematical area of order theory
second may hold; see the N5 lattice for an example. Davey, B.A.; Priestley, H. A. (2002), Introduction to Lattices and Order (2nd ed.), Cambridge University
Duality_(order_theory)
Order-preserving mathematical function
antitone, and if the domain of f is a lattice, then f must be constant. Monotone functions are central in order theory. They appear in most articles on
Monotonic_function
Physical dimensions of unit cells in a crystal
lattice constant or lattice parameter is one of the physical dimensions and angles that determine the geometry of the unit cells in a crystal lattice
Lattice_constant
Classification of a two-dimensional repetitive pattern
notation: [4,4]+ Lattice: square Point group: C4 The group p4 has two rotation centres of order four (90°), and one rotation centre of order two (180°). It
Wallpaper_group
is directed complete is almost a complete lattice (possibly lacking a least element)—see completeness (order theory) for details. The most basic example
Compact_element
BL-algebras whose lattice order is linear Standard semantics, formed of all standard BL-algebras — that is, all BL-algebras whose lattice reduct is the real
BL_(logic)
The division lattice is an infinite complete bounded distributive lattice whose elements are the natural numbers ordered by divisibility. Its least element
Division_lattice
Presence/absence of symmetry or correlation in a many-particle system
quenched disorder is annealed disorder. The strictest form of order in a solid is lattice periodicity: a certain pattern (the arrangement of atoms in a
Order_and_disorder
Multiplication algorithm
Lattice multiplication, also known as the Italian method, Chinese method, Chinese lattice, gelosia multiplication, sieve multiplication, shabakh, diagonally
Lattice_multiplication
Topology of an ordered vector space
The lattice structure can compensate in part for any lack of an order unit: Theorem—Let X {\displaystyle X} be a vector lattice with a regular order and
Order topology (functional analysis)
Order_topology_(functional_analysis)
Regular infinite tree structure used in statistical mechanics
Bethe lattice (also called a regular tree) is an infinite symmetric regular tree where all vertices have the same number of neighbors. The Bethe lattice was
Bethe_lattice
Algebraic structure used in logic
a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0
Heyting_algebra
of lattice have been studied; see map of lattices for a list. Partially ordered sets (or posets), orderings in which some pairs are comparable and others
List of order structures in mathematics
List_of_order_structures_in_mathematics
Type of crystal structure
the face-centered cubic Bravais lattice. The lattice describes the repeat pattern; for diamond cubic crystals this lattice is "decorated" with a motif of
Diamond_cubic
Tiling of a plane by regular hexagons and equilateral triangles
this geometrical frustration does not propagate into a rigid order of the whole lattice but leaves a macroscopically large number of degenerate low-energy
Trihexagonal_tiling
substructural logics, or logics of residuated lattices; it extends the logic of commutative bounded integral residuated lattices (known as Höhle's monoidal logic,
Monoidal_t-norm_logic
In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets
Completely distributive lattice
Completely_distributive_lattice
Partial order in lattice theory
In order theory, the strong set order ≤ s {\displaystyle \leq _{s}} is a partial order over the subsets of a lattice. It is widely used to study monotone
Strong_set_order
In the mathematical study of order, a metric lattice L is a lattice that admits a positive valuation: a function v ∈ L → ℝ satisfying, for any a, b ∈ L
Metric_lattice
in order theory and functional analysis, a filter F {\displaystyle {\mathcal {F}}} in an order complete vector lattice X {\displaystyle X} is order convergent
Order_convergence
Smallest complete lattice containing a partial order
mathematics, specifically order theory, the Dedekind–MacNeille completion of a partially ordered set is the smallest complete lattice that contains it. It
Dedekind–MacNeille_completion
Quasiparticle of mechanical vibrations
amorphous) lattice is composed of N particles. These particles may be atoms or molecules. N is a large number, say of the order of 1023, or on the order of the
Phonon
A compactification of T1 topological spaces
compactification is essentially the same as the Stone–Čech compactification. Lattice (order) Pointless topology Aleksandrov, P.S. (2001) [1994], "Wallman_compactification"
Wallman_compactification
Sporadic simple group
p. 125). Its double cover acts on a 28-dimensional lattice over the Gaussian integers. The lattice has 4×4060 minimal vectors; if minimal vectors are
Rudvalis_group
Mathematical object
discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts
Ideal_lattice
Method of deriving an ontology
order theory. One such possibility of very general nature is that data tables can be transformed into algebraic structures called complete lattices,
Formal_concept_analysis
Mathematical set with an ordering
confusion with convex sets of geometry, one uses order-convex instead of "convex". A convex sublattice of a lattice L is a sublattice of L that is also a convex
Partially_ordered_set
Mathematical model of ferromagnetism in statistical mechanics
of two states (+1 or −1). The spins are arranged in a graph, usually a lattice (where the local structure repeats periodically in all directions), allowing
Ising_model
qubit. In order to actually do computation, these individual qubits must be able to talk to one another, and that is the purpose of lattice surgery. The
Lattice_surgery
mathematics, particularly in order theory, a pseudocomplement is one generalization of the notion of complement. In a lattice L with bottom element 0, an
Pseudocomplement
Discrete math concept
dominance ordering, denoted Ln, and the operation of conjugation is an antiautomorphism of this lattice. To explicitly describe the lattice operations
Dominance_order
of coatoms. Davey, B. A.; Priestley, H. A. (2002), Introduction to Lattices and Order, Cambridge University Press, ISBN 978-0-521-78451-1 "Atom". PlanetMath
Atom_(order_theory)
Theory of quantum gauge fields on a lattice
In physics, lattice gauge theory is the study of gauge theories on a spacetime that has been discretized into a lattice. Gauge theories are important
Lattice_gauge_theory
Topological vector lattice
specifically in order theory and functional analysis, a Fréchet lattice is a topological vector lattice that is also a Fréchet space. Fréchet lattices are important
Fréchet_lattice
Well-quasi-ordering of finite trees
reverse mathematics as a statement that cannot be proved in ATR0 (a second-order arithmetic theory with a form of arithmetical transfinite recursion). In
Kruskal's_tree_theorem
Set with operations obeying given axioms
lattice: a lattice in which arbitrary meet and joins exist. Bounded lattice: a lattice with a greatest element and least element. Distributive lattice: a lattice
Algebraic_structure
1979 conjecture in combinatorics
{\displaystyle j\subseteq A} , that is, j ≤ A {\displaystyle j\leq A} in the lattice order. So every set in A {\displaystyle {\mathcal {A}}} containing a belongs
Union-closed_sets_conjecture
Physical model defined on a lattice
In mathematical physics, a lattice model is a mathematical model of a physical system that is defined on a lattice, as opposed to a continuum, such as
Lattice_model_(physics)
Ordered arrangement of atoms, ions, or molecules in a crystalline material
the Bravais lattice. The lengths of principal axes/edges, of the unit cell and angles between them are lattice constants, also called lattice parameters
Crystal_structure
In lattice theory, a mathematical discipline, a finite lattice is slim if no three join-irreducible elements form an antichain. Every slim lattice is
Slim_lattice
Quantum-safe key encapsulation mechanism
ML-KEM (Module-Lattice-Based Key-Encapsulation Mechanism), also known by its original name Kyber, is a key encapsulation mechanism (KEM) designed to be
ML-KEM
Type of model in quantum statistical physics
typically consist of particles with magnetic spin located at fixed sites on a lattice. A prototypical example is the quantum Heisenberg model. Interactions between
Spin_chain
Theorem about admissible crystal symmetries
theorem characterizes the possible orders of rotational symmetry in a lattice. In 2 or 3 dimensions, the rotational symmetries are restricted to 2-fold
Crystallographic restriction theorem
Crystallographic_restriction_theorem
Regular pattern of magnetic moment ordering
in an ordered lattice are oriented antiparallel to one another. Since there are multiple ways of arranging magnetic moments on a lattice (especially in
Antiferromagnetism
mathematics, specifically in order theory and functional analysis, a locally convex vector lattice (LCVL) is a topological vector lattice that is also a locally
Locally_convex_vector_lattice
Branch of mathematics
complete lattice, more precisely a complete Heyting algebra (or "frame" or "locale"). Filters and nets are notions closely related to order theory and
Order_theory
Visual depiction of a partially ordered set
are known: If the partial order to be drawn is a lattice, then it can be drawn without crossings if and only if it has order dimension at most two. In
Hasse_diagram
Geometric arrangements of points, foundational to Lie theory
in the root lattice of the sublattice generated by long roots, D denotes the determinant of the Cartan matrix, and |W| denotes the order of the Weyl group
Root_system
Form of geometry without distances
Affine geometry Cyclic order Erlangen program Euclidean geometry Hilbert's axioms Tarski's axioms Incidence geometry Lattice (order) Non-Euclidean geometry
Ordered_geometry
Theorem in mathematical economics
s\,\partial p}}<0} . If the feasible speed set S is a lattice and optimal speeds exist, the order-dual version of Topkis's theorem implies that the maximal
Topkis's_theorem
Repeating unit formed by the vectors spanning the points of a lattice
cell is a repeating unit formed by the vectors spanning the points of a lattice. Despite its suggestive name, the unit cell (unlike a unit vector, for
Unit_cell
Property of objects which appear unchanged after a partial rotation
parallelogrammic, rectangular, and rhombic lattice. p3 (333): 3×3-fold; not the rotation group of any lattice (every lattice is upside-down the same, but that
Rotational_symmetry
Algebra whose elements are stable matchings
mathematics, economics, and computer science, a lattice of stable matchings is a distributive lattice whose elements are all the solutions to a given
Lattice_of_stable_matchings
travel, tourism, insurance
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
LATTICE ORDER
travel, tourism, insurance