Choose an application

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

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms.

Research & information: general --- Mathematics & science --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times --- forgotten index --- balaban index --- reclassified the zagreb indices --- ABC4 index --- GA5 index --- HDN3(m) --- THDN3(m) --- RHDN3(m) --- degree of vertex --- extended adjacency index --- scheduling with rejection --- machine non-availability --- operator non-availability --- dynamic programming --- FPTAS --- Transportation --- batching scheduling --- total weighted completion time --- unary NP-hard --- approximation algorithm --- bi-criteria scheduling --- online algorithm --- makespan --- maximum machine cost --- competitive ratio --- network optimization --- dynamic flow --- evacuation planning --- contraflow configuration --- partial lane reversals, algorithms and complexity --- logistic supports --- scheduling algorithm --- release-time --- due-date --- divisible numbers --- lateness --- bin packing --- time complexity --- batch scheduling --- linear deterioration --- job families --- Max-cut problem --- combinatorial optimization --- deep learning --- pointer network --- supervised learning --- reinforcement learning --- capacitated lot sizing --- mixed integer formulation --- retail --- inventory --- shortages --- graph --- join product --- crossing number --- cyclic permutation --- arithmetic mean --- combinatorial generation --- method --- algorithm --- AND/OR tree --- Euler-Catalan's triangle --- labeled Dyck path --- ranking algorithm --- unranking algorithm --- Harris hawks optimizer --- load frequency control --- sensitivity analysis --- smart grid --- particle swarm optimization --- genetic algorithm --- meta-heuristics --- packing --- irregular 3D objects --- quasi-phi-function s --- nonlinear optimization --- single-machine scheduling --- minimization of maximum penalty --- dual problem --- inverse problem --- branch and bound --- LNS --- numerical conversion --- RISC --- FPGA --- embedded systems --- scheduling --- job-shop --- makespan criterion --- uncertain processing times

Choose an application

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

The description for this book, Linear Inequalities and Related Systems. (AM-38), Volume 38, will be forthcoming.

Operational research. Game theory --- Linear programming. --- Matrices. --- Game theory. --- Games, Theory of --- Theory of games --- Mathematical models --- Mathematics --- Algebra, Matrix --- Cracovians (Mathematics) --- Matrix algebra --- Matrixes (Algebra) --- Algebra, Abstract --- Algebra, Universal --- Production scheduling --- Programming (Mathematics) --- Banach space. --- Basic solution (linear programming). --- Big O notation. --- Bilinear form. --- Boundary (topology). --- Brouwer fixed-point theorem. --- Characterization (mathematics). --- Coefficient. --- Combination. --- Computation. --- Computational problem. --- Convex combination. --- Convex cone. --- Convex hull. --- Convex set. --- Corollary. --- Correlation and dependence. --- Cramer's rule. --- Cyclic permutation. --- Dedekind cut. --- Degeneracy (mathematics). --- Determinant. --- Diagram (category theory). --- Dilworth's theorem. --- Dimension (vector space). --- Directional derivative. --- Disjoint sets. --- Doubly stochastic matrix. --- Dual space. --- Duality (mathematics). --- Duality (optimization). --- Eigenvalues and eigenvectors. --- Elementary proof. --- Equation solving. --- Equation. --- Equivalence class. --- Euclidean space. --- Existence theorem. --- Existential quantification. --- Extreme point. --- Fixed-point theorem. --- Functional analysis. --- Fundamental theorem. --- General equilibrium theory. --- Hall's theorem. --- Hilbert space. --- Incidence matrix. --- Inequality (mathematics). --- Infimum and supremum. --- Invertible matrix. --- Kakutani fixed-point theorem. --- Lagrange multiplier. --- Linear equation. --- Linear inequality. --- Linear map. --- Linear space (geometry). --- Linear subspace. --- Loss function. --- Main diagonal. --- Mathematical induction. --- Mathematical optimization. --- Mathematical problem. --- Max-flow min-cut theorem. --- Maxima and minima. --- Maximal set. --- Maximum flow problem. --- Menger's theorem. --- Minor (linear algebra). --- Monotonic function. --- N-vector. --- Nonlinear programming. --- Nonnegative matrix. --- Parity (mathematics). --- Partially ordered set. --- Permutation matrix. --- Permutation. --- Polyhedron. --- Quantity. --- Representation theorem. --- Row and column vectors. --- Scientific notation. --- Sensitivity analysis. --- Set notation. --- Sign (mathematics). --- Simplex algorithm. --- Simultaneous equations. --- Solution set. --- Special case. --- Subset. --- Summation. --- System of linear equations. --- Theorem. --- Transpose. --- Unit sphere. --- Unit vector. --- Upper and lower bounds. --- Variable (mathematics). --- Vector space. --- Von Neumann's theorem.

Choose an application

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

Group theory and topology are closely related. The region of their interaction, combining the logical clarity of algebra with the depths of geometric intuition, is the subject of Combinatorial Group Theory and Topology. The work includes papers from a conference held in July 1984 at Alta Lodge, Utah.Contributors to the book include Roger Alperin, Hyman Bass, Max Benson, Joan S. Birman, Andrew J. Casson, Marshall Cohen, Donald J. Collins, Robert Craggs, Michael Dyer, Beno Eckmann, Stephen M. Gersten, Jane Gilman, Robert H. Gilman, Narain D. Gupta, John Hempel, James Howie, Roger Lyndon, Martin Lustig, Lee P. Neuwirth, Andrew J. Nicas, N. Patterson, John G. Ratcliffe, Frank Rimlinger, Caroline Series, John R. Stallings, C. W. Stark, and A. Royce Wolf.

Combinatorial group theory --- Topology --- Abelian group. --- Algebraic equation. --- Algebraic integer. --- Automorphism. --- Basis (linear algebra). --- Betti number. --- Cayley graph. --- Cayley–Hamilton theorem. --- Characteristic polynomial. --- Characteristic subgroup. --- Characterization (mathematics). --- Classifying space. --- Combinatorial group theory. --- Combinatorics. --- Commutative algebra. --- Commutative property. --- Commutator subgroup. --- Compactification (mathematics). --- Complement (set theory). --- Conformal map. --- Conjugacy class. --- Connected component (graph theory). --- Connectivity (graph theory). --- Coprime integers. --- Coset. --- Coxeter group. --- Cyclic group. --- Cyclic permutation. --- Degeneracy (mathematics). --- Dehn's lemma. --- Diagram (category theory). --- Dirac delta function. --- Disk (mathematics). --- Epimorphism. --- Equation. --- Euclidean group. --- Finite group. --- Finitely generated abelian group. --- Finitely generated group. --- Free abelian group. --- Free group. --- Freiheitssatz. --- Fuchsian group. --- Function (mathematics). --- Fundamental domain. --- Fundamental group. --- Fundamental lemma (Langlands program). --- G-module. --- General linear group. --- Generating set of a group. --- Geodesic. --- Graph (discrete mathematics). --- Graph of groups. --- Graph product. --- Group theory. --- Haken manifold. --- Harmonic analysis. --- Homological algebra. --- Homology (mathematics). --- Homomorphism. --- Homotopy. --- Hurwitz's theorem (number theory). --- Hyperbolic 3-manifold. --- Identity theorem. --- Inclusion map. --- Inequality (mathematics). --- Inner automorphism. --- Intersection (set theory). --- Intersection number (graph theory). --- Intersection number. --- Invertible matrix. --- Jacobian matrix and determinant. --- Knot theory. --- Limit point. --- Mapping class group. --- Mapping cone (homological algebra). --- Mathematical induction. --- Module (mathematics). --- Parity (mathematics). --- Poincaré conjecture. --- Prime number. --- Pullback (category theory). --- Quotient group. --- Representation theory. --- Residually finite group. --- Riemann surface. --- Seifert–van Kampen theorem. --- Separatrix (mathematics). --- Set theory. --- Simplicial complex. --- Sphere theorem (3-manifolds). --- Sphere theorem. --- Subgroup. --- Sylow theorems. --- Theorem. --- Topology. --- Union (set theory). --- Uniqueness theorem. --- Variable (mathematics). --- Word problem (mathematics).

Choose an application

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

A general principle, discovered by Robert Langlands and named by him the "functoriality principle," predicts relations between automorphic forms on arithmetic subgroups of different reductive groups. Langlands functoriality relates the eigenvalues of Hecke operators acting on the automorphic forms on two groups (or the local factors of the "automorphic representations" generated by them). In the few instances where such relations have been probed, they have led to deep arithmetic consequences. This book studies one of the simplest general problems in the theory, that of relating automorphic forms on arithmetic subgroups of GL(n,E) and GL(n,F) when E/F is a cyclic extension of number fields. (This is known as the base change problem for GL(n).) The problem is attacked and solved by means of the trace formula. The book relies on deep and technical results obtained by several authors during the last twenty years. It could not serve as an introduction to them, but, by giving complete references to the published literature, the authors have made the work useful to a reader who does not know all the aspects of the theory of automorphic forms.

511.33 --- Analytical and multiplicative number theory. Asymptotics. Sieves etc. --- 511.33 Analytical and multiplicative number theory. Asymptotics. Sieves etc. --- Automorfe vormen --- Automorphic forms --- Formes automorphes --- Representation des groupes --- Representations of groups --- Trace formulas --- Vertegenwoordiging van groepen --- Formulas, Trace --- Discontinuous groups --- Group representation (Mathematics) --- Groups, Representation theory of --- Group theory --- Automorphic functions --- Forms (Mathematics) --- Analytical and multiplicative number theory. Asymptotics. Sieves etc --- Representations of groups. --- Trace formulas. --- Automorphic forms. --- 0E. --- Addition. --- Admissible representation. --- Algebraic group. --- Algebraic number field. --- Approximation. --- Archimedean property. --- Automorphic form. --- Automorphism. --- Base change. --- Big O notation. --- Binomial coefficient. --- Canonical map. --- Cartan subalgebra. --- Cartan subgroup. --- Central simple algebra. --- Characteristic polynomial. --- Closure (mathematics). --- Combination. --- Computation. --- Conjecture. --- Conjugacy class. --- Connected component (graph theory). --- Continuous function. --- Contradiction. --- Corollary. --- Counting. --- Coxeter element. --- Cusp form. --- Cyclic permutation. --- Dense set. --- Density theorem. --- Determinant. --- Diagram (category theory). --- Discrete series representation. --- Discrete spectrum. --- Division algebra. --- Eigenvalues and eigenvectors. --- Eisenstein series. --- Exact sequence. --- Existential quantification. --- Field extension. --- Finite group. --- Finite set. --- Fourier transform. --- Functor. --- Fundamental lemma (Langlands program). --- Galois extension. --- Galois group. --- Global field. --- Grothendieck group. --- Group representation. --- Haar measure. --- Harmonic analysis. --- Hecke algebra. --- Hilbert's Theorem 90. --- Identity component. --- Induced representation. --- Infinite product. --- Infinitesimal character. --- Invariant measure. --- Irreducibility (mathematics). --- Irreducible representation. --- L-function. --- Langlands classification. --- Laurent series. --- Lie algebra. --- Lie group. --- Linear algebraic group. --- Local field. --- Mathematical induction. --- Maximal compact subgroup. --- Multiplicative group. --- Nilpotent group. --- Orbital integral. --- P-adic number. --- Paley–Wiener theorem. --- Parameter. --- Parametrization. --- Permutation. --- Poisson summation formula. --- Real number. --- Reciprocal lattice. --- Reductive group. --- Root of unity. --- Scientific notation. --- Semidirect product. --- Special case. --- Spherical harmonics. --- Subgroup. --- Subset. --- Summation. --- Support (mathematics). --- Tensor product. --- Theorem. --- Trace formula. --- Unitary representation. --- Weil group. --- Weyl group. --- Zero of a function.