Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Higher category theory is generally regarded as technical and forbidding, but part of it is considerably more tractable: the theory of infinity-categories, higher categories in which all higher morphisms are assumed to be invertible. In Higher Topos Theory, Jacob Lurie presents the foundations of this theory, using the language of weak Kan complexes introduced by Boardman and Vogt, and shows how existing theorems in algebraic topology can be reformulated and generalized in the theory's new language. The result is a powerful theory with applications in many areas of mathematics. The book's first five chapters give an exposition of the theory of infinity-categories that emphasizes their role as a generalization of ordinary categories. Many of the fundamental ideas from classical category theory are generalized to the infinity-categorical setting, such as limits and colimits, adjoint functors, ind-objects and pro-objects, locally accessible and presentable categories, Grothendieck fibrations, presheaves, and Yoneda's lemma. A sixth chapter presents an infinity-categorical version of the theory of Grothendieck topoi, introducing the notion of an infinity-topos, an infinity-category that resembles the infinity-category of topological spaces in the sense that it satisfies certain axioms that codify some of the basic principles of algebraic topology. A seventh and final chapter presents applications that illustrate connections between the theory of higher topoi and ideas from classical topology.

Algebraic geometry --- Topology --- Toposes --- Categories (Mathematics) --- Categories (Mathematics). --- Toposes. --- Algebra --- Mathematics --- Physical Sciences & Mathematics --- Category theory (Mathematics) --- Topoi (Mathematics) --- Algebra, Homological --- Algebra, Universal --- Group theory --- Logic, Symbolic and mathematical --- Functor theory --- Adjoint functors. --- Associative property. --- Base change map. --- Base change. --- CW complex. --- Canonical map. --- Cartesian product. --- Category of sets. --- Category theory. --- Coequalizer. --- Cofinality. --- Coherence theorem. --- Cohomology. --- Cokernel. --- Commutative property. --- Continuous function (set theory). --- Contractible space. --- Coproduct. --- Corollary. --- Derived category. --- Diagonal functor. --- Diagram (category theory). --- Dimension theory (algebra). --- Dimension theory. --- Dimension. --- Enriched category. --- Epimorphism. --- Equivalence class. --- Equivalence relation. --- Existence theorem. --- Existential quantification. --- Factorization system. --- Functor category. --- Functor. --- Fundamental group. --- Grothendieck topology. --- Grothendieck universe. --- Group homomorphism. --- Groupoid. --- Heyting algebra. --- Higher Topos Theory. --- Higher category theory. --- Homotopy category. --- Homotopy colimit. --- Homotopy group. --- Homotopy. --- I0. --- Inclusion map. --- Inductive dimension. --- Initial and terminal objects. --- Inverse limit. --- Isomorphism class. --- Kan extension. --- Limit (category theory). --- Localization of a category. --- Maximal element. --- Metric space. --- Model category. --- Monoidal category. --- Monoidal functor. --- Monomorphism. --- Monotonic function. --- Morphism. --- Natural transformation. --- Nisnevich topology. --- Noetherian topological space. --- Noetherian. --- O-minimal theory. --- Open set. --- Power series. --- Presheaf (category theory). --- Prime number. --- Pullback (category theory). --- Pushout (category theory). --- Quillen adjunction. --- Quotient by an equivalence relation. --- Regular cardinal. --- Retract. --- Right inverse. --- Sheaf (mathematics). --- Sheaf cohomology. --- Simplicial category. --- Simplicial set. --- Special case. --- Subcategory. --- Subset. --- Surjective function. --- Tensor product. --- Theorem. --- Topological space. --- Topology. --- Topos. --- Total order. --- Transitive relation. --- Universal property. --- Upper and lower bounds. --- Weak equivalence (homotopy theory). --- Yoneda lemma. --- Zariski topology. --- Zorn's lemma.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This Special Issue collects original research articles discussing cutting-edge work as well as perspectives on future directions in the whole range of theoretical and practical aspects in these research areas: i) Theory of fuzzy systems and soft computing; ii) Learning procedures; iii) Decision-making applications employing fuzzy logic and soft computing.

Research & information: general --- Mathematics & science --- fuzzy partition --- fuzzy transform --- new iterative method --- Cauchy problems --- ANFIS --- basmati rice --- image processing --- grading --- quality assessment --- fuzzy inference system --- causality --- statistics --- concept-mapping --- causal graph --- numerical methods --- systems of ordinary differential equations --- NIM --- fuzzy logics --- linear motion blur --- fuzzy deblurring --- electron beam calibration --- signal and image processing --- propagation modeling --- adaptive-network-based fuzzy system --- LoRa &amp --- LoRaWAN --- radio wave propagation --- artificial neural networks --- subtracting clustering --- dual double fuzzy semi-metric --- double fuzzy semi-metric --- fuzzy semi-metric space --- triangle inequality --- triangular norm --- eye gaze tracking --- interval type-2 fuzzy logic --- vision system --- mobile robots --- intelligent control --- ordered fuzzy number --- fuzzy relation --- preorder --- strict order --- equivalence relation --- variable neighborhood search --- experimental comparison --- statistical analysis --- traveling salesman problem --- soft computing --- modeling --- vector optimization --- methods of solution of vector problems --- optimal decision-making --- numerical realization of decision-making --- n/a

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Part exposition and part presentation of new results, this monograph deals with that area of mathematics which has both combinatorial group theory and mathematical logic in common. Its main topics are the word problem for groups, the conjugacy problem for groups, and the isomorphism problem for groups. The presentation depends on previous results of J. L. Britton, which, with other factual background, are treated in detail.

Group theory --- 510.6 --- Mathematical logic --- 510.6 Mathematical logic --- Group theory. --- Logic, Symbolic and mathematical. --- Groupes, Théorie des --- Groups, Theory of --- Substitutions (Mathematics) --- Algebra --- Algebra of logic --- Logic, Universal --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Abelian group. --- Betti number. --- Characteristic function (probability theory). --- Characterization (mathematics). --- Combinatorial group theory. --- Conjecture. --- Conjugacy class. --- Conjugacy problem. --- Contradiction. --- Corollary. --- Cyclic permutation. --- Decision problem. --- Diffeomorphism. --- Direct product. --- Direct proof. --- Effective method. --- Elementary class. --- Embedding. --- Enumeration. --- Epimorphism. --- Equation. --- Equivalence relation. --- Exact sequence. --- Existential quantification. --- Finite group. --- Finite set. --- Finitely generated group. --- Finitely presented. --- Free group. --- Free product. --- Fundamental group. --- Fundamental theorem. --- Group (mathematics). --- Gödel numbering. --- Homomorphism. --- Homotopy. --- Inner automorphism. --- Markov property. --- Mathematical logic. --- Mathematical proof. --- Mathematics. --- Monograph. --- Natural number. --- Nilpotent group. --- Normal subgroup. --- Notation. --- Permutation. --- Polycyclic group. --- Presentation of a group. --- Quotient group. --- Recursive set. --- Requirement. --- Residually finite group. --- Semigroup. --- Simple set. --- Simplicial complex. --- Solvable group. --- Statistical hypothesis testing. --- Subgroup. --- Theorem. --- Theory. --- Topology. --- Transitive relation. --- Triviality (mathematics). --- Truth table. --- Turing degree. --- Turing machine. --- Without loss of generality. --- Word problem (mathematics). --- Groupes, Théorie des --- Décidabilité (logique mathématique)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is a spectacular introduction to the modern mathematical discipline known as the Theory of Games. Harold Kuhn first presented these lectures at Princeton University in 1952. They succinctly convey the essence of the theory, in part through the prism of the most exciting developments at its frontiers half a century ago. Kuhn devotes considerable space to topics that, while not strictly the subject matter of game theory, are firmly bound to it. These are taken mainly from the geometry of convex sets and the theory of probability distributions. The book opens by addressing "matrix games," a name first introduced in these lectures as an abbreviation for two-person, zero-sum games in normal form with a finite number of pure strategies. It continues with a treatment of games in extensive form, using a model introduced by the author in 1950 that quickly supplanted von Neumann and Morgenstern's cumbersome approach. A final section deals with games that have an infinite number of pure strategies for the two players. Throughout, the theory is generously illustrated with examples, and exercises test the reader's understanding. A historical note caps off each chapter. For readers familiar with the calculus and with elementary matrix theory or vector analysis, this book offers an indispensable store of vital insights on a subject whose importance has only grown with the years.

Operational research. Game theory --- Game theory --- 519.83 --- Theory of games --- 519.83 Theory of games --- Game theory. --- Games, Theory of --- Mathematical models --- Mathematics --- Abstract algebra. --- Addition. --- Algorithm. --- Almost surely. --- Analytic geometry. --- Axiom. --- Basic solution (linear programming). --- Big O notation. --- Bijection. --- Binary relation. --- Boundary (topology). --- Bounded set (topological vector space). --- Branch point. --- Calculation. --- Cardinality of the continuum. --- Cardinality. --- Cartesian coordinate system. --- Characteristic function (probability theory). --- Combination. --- Computation. --- Connectivity (graph theory). --- Constructive proof. --- Convex combination. --- Convex function. --- Convex hull. --- Convex set. --- Coordinate system. --- David Gale. --- Diagram (category theory). --- Differential equation. --- Dimension (vector space). --- Dimensional analysis. --- Disjoint sets. --- Distribution function. --- Embedding. --- Empty set. --- Enumeration. --- Equation. --- Equilibrium point. --- Equivalence relation. --- Estimation. --- Euclidean space. --- Existential quantification. --- Expected loss. --- Extreme point. --- Formal scheme. --- Fundamental theorem. --- Galois theory. --- Geometry. --- Hyperplane. --- Inequality (mathematics). --- Infimum and supremum. --- Integer. --- Iterative method. --- Line segment. --- Linear equation. --- Linear inequality. --- Matching Pennies. --- Mathematical induction. --- Mathematical optimization. --- Mathematical theory. --- Mathematician. --- Mathematics. --- Matrix (mathematics). --- Measure (mathematics). --- Min-max theorem. --- Minimum distance. --- Mutual exclusivity. --- Prediction. --- Probability distribution. --- Probability interpretations. --- Probability measure. --- Probability theory. --- Probability. --- Proof by contradiction. --- Quantity. --- Rank (linear algebra). --- Rational number. --- Real number. --- Requirement. --- Scientific notation. --- Sign (mathematics). --- Solution set. --- Special case. --- Statistics. --- Strategist. --- Strategy (game theory). --- Subset. --- Theorem. --- Theory of Games and Economic Behavior. --- Theory. --- Three-dimensional space (mathematics). --- Total order. --- Two-dimensional space. --- Union (set theory). --- Unit interval. --- Unit square. --- Vector Analysis. --- Vector calculus. --- Vector space.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book presents a classification of all (complex)irreducible representations of a reductive group withconnected centre, over a finite field. To achieve this,the author uses etale intersection cohomology, anddetailed information on representations of Weylgroups.

512 --- Characters of groups --- Finite fields (Algebra) --- Finite groups --- Groups, Finite --- Group theory --- Modules (Algebra) --- Modular fields (Algebra) --- Algebra, Abstract --- Algebraic fields --- Galois theory --- Characters, Group --- Group characters --- Groups, Characters of --- Representations of groups --- Rings (Algebra) --- Algebra --- 512 Algebra --- Finite groups. --- Characters of groups. --- Addition. --- Algebra representation. --- Algebraic closure. --- Algebraic group. --- Algebraic variety. --- Algebraically closed field. --- Bijection. --- Borel subgroup. --- Cartan subalgebra. --- Character table. --- Character theory. --- Characteristic function (probability theory). --- Characteristic polynomial. --- Class function (algebra). --- Classical group. --- Coefficient. --- Cohomology with compact support. --- Cohomology. --- Combination. --- Complex number. --- Computation. --- Conjugacy class. --- Connected component (graph theory). --- Coxeter group. --- Cyclic group. --- Cyclotomic polynomial. --- David Kazhdan. --- Dense set. --- Derived category. --- Diagram (category theory). --- Dimension. --- Direct sum. --- Disjoint sets. --- Disjoint union. --- E6 (mathematics). --- Eigenvalues and eigenvectors. --- Endomorphism. --- Equivalence class. --- Equivalence relation. --- Existential quantification. --- Explicit formula. --- Explicit formulae (L-function). --- Fiber bundle. --- Finite field. --- Finite group. --- Fourier transform. --- Green's function. --- Group (mathematics). --- Group action. --- Group representation. --- Harish-Chandra. --- Hecke algebra. --- Identity element. --- Integer. --- Irreducible representation. --- Isomorphism class. --- Jordan decomposition. --- Line bundle. --- Linear combination. --- Local system. --- Mathematical induction. --- Maximal torus. --- Module (mathematics). --- Monodromy. --- Morphism. --- Orthonormal basis. --- P-adic number. --- Parametrization. --- Parity (mathematics). --- Partially ordered set. --- Perverse sheaf. --- Pointwise. --- Polynomial. --- Quantity. --- Rational point. --- Reductive group. --- Ree group. --- Schubert variety. --- Scientific notation. --- Semisimple Lie algebra. --- Sheaf (mathematics). --- Simple group. --- Simple module. --- Special case. --- Standard basis. --- Subset. --- Subtraction. --- Summation. --- Surjective function. --- Symmetric group. --- Tensor product. --- Theorem. --- Two-dimensional space. --- Unipotent representation. --- Vector bundle. --- Vector space. --- Verma module. --- Weil conjecture. --- Weyl group. --- Zariski topology.