Narrow your search

Library

KU Leuven (32)

UAntwerpen (17)

ULiège (17)

VUB (17)

LUCA School of Arts (16)

Odisee (16)

Thomas More Kempen (16)

Thomas More Mechelen (16)

UCLL (16)

VIVES (16)

More...

Resource type

book (43)


Language

English (43)


Year
From To Submit

2021 (10)

2020 (1)

2016 (7)

2015 (3)

2014 (1)

More...
Listing 1 - 10 of 43 << page
of 5
>>
Sort by

Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"


Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"


Book
Networks, Communication, and Computing Vol. 2
Author:
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

Networks, communications, and computing have become ubiquitous and inseparable parts of everyday life. This book is based on a Special Issue of the Algorithms journal, and it is devoted to the exploration of the many-faceted relationship of networks, communications, and computing. The included papers explore the current state-of-the-art research in these areas, with a particular interest in the interactions among the fields.


Book
Mathematical Logic and Its Applications 2020
Authors: ---
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

The issue "Mathematical Logic and Its Applications 2020" contains articles related to the following three directions: Descriptive Set Theory (3 articles). Solutions for long-standing problems, including those of A. Tarski and H. Friedman, are presented. Exact combinatorial optimization algorithms, in which the complexity relative to the source data is characterized by a low, or even first degree, polynomial (1 article). III. Applications of mathematical logic and the theory of algorithms (2 articles). The first article deals with the Jacobian and M. Kontsevich’s conjectures, and algorithmic undecidability; for these purposes, non-standard analysis is used. The second article provides a quantitative description of the balance and adaptive resource of a human. Submissions are invited for the next issue "Mathematical Logic and Its Applications 2021"

Keywords

Research & information: general --- Mathematics & science --- definability --- nonconstructible reals --- projective hierarchy --- generic models --- almost disjoint forcing --- Harvey Friedman’s problem --- almost-disjoint forcing --- universal algebraic geometry --- affine algebraic geometry --- elementary equivalence --- isotypic algebras --- first order rigidity --- Ind-group --- affine spaces --- automorphisms --- free associative algebras --- Weyl algebra automorphisms --- polynomial symplectomorphisms --- deformation quantization --- infinite prime number --- semi-inner automorphism --- embeddability of varieties --- undecidability --- noncommutative Gröbner-Shirshov basis --- finitely presented algebraic systems --- algorithmic unsolvability --- turing machine --- discrete optimization --- exact algorithm --- additively exact algorithm --- graph transformation --- graph of degree 2 --- chain-cycle graph --- operation cost --- minimization of total cost --- definability of definable --- tarski problem --- type theoretic hierarchy --- adaptive resource --- resilience --- resistance --- tipping point --- theory of catastrophes --- definability --- nonconstructible reals --- projective hierarchy --- generic models --- almost disjoint forcing --- Harvey Friedman’s problem --- almost-disjoint forcing --- universal algebraic geometry --- affine algebraic geometry --- elementary equivalence --- isotypic algebras --- first order rigidity --- Ind-group --- affine spaces --- automorphisms --- free associative algebras --- Weyl algebra automorphisms --- polynomial symplectomorphisms --- deformation quantization --- infinite prime number --- semi-inner automorphism --- embeddability of varieties --- undecidability --- noncommutative Gröbner-Shirshov basis --- finitely presented algebraic systems --- algorithmic unsolvability --- turing machine --- discrete optimization --- exact algorithm --- additively exact algorithm --- graph transformation --- graph of degree 2 --- chain-cycle graph --- operation cost --- minimization of total cost --- definability of definable --- tarski problem --- type theoretic hierarchy --- adaptive resource --- resilience --- resistance --- tipping point --- theory of catastrophes


Book
Networks, Communication, and Computing Vol. 2
Author:
Year: 2021 Publisher: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute

Loading...
Export citation

Choose an application

Bookmark

Abstract

Networks, communications, and computing have become ubiquitous and inseparable parts of everyday life. This book is based on a Special Issue of the Algorithms journal, and it is devoted to the exploration of the many-faceted relationship of networks, communications, and computing. The included papers explore the current state-of-the-art research in these areas, with a particular interest in the interactions among the fields.

Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134), Volume 134
Authors: ---
ISBN: 0691036411 0691036403 1400882532 9780691036403 9780691036410 Year: 2016 Volume: 134 Publisher: Princeton, NJ : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book offers a self-contained account of the 3-manifold invariants arising from the original Jones polynomial. These are the Witten-Reshetikhin-Turaev and the Turaev-Viro invariants. Starting from the Kauffman bracket model for the Jones polynomial and the diagrammatic Temperley-Lieb algebra, higher-order polynomial invariants of links are constructed and combined to form the 3-manifold invariants. The methods in this book are based on a recoupling theory for the Temperley-Lieb algebra. This recoupling theory is a q-deformation of the SU(2) spin networks of Roger Penrose. The recoupling theory is developed in a purely combinatorial and elementary manner. Calculations are based on a reformulation of the Kirillov-Reshetikhin shadow world, leading to expressions for all the invariants in terms of state summations on 2-cell complexes. Extensive tables of the invariants are included. Manifolds in these tables are recognized by surgery presentations and by means of 3-gems (graph encoded 3-manifolds) in an approach pioneered by Sostenes Lins. The appendices include information about gems, examples of distinct manifolds with the same invariants, and applications to the Turaev-Viro invariant and to the Crane-Yetter invariant of 4-manifolds.

Keywords

Drie-menigvuldigheden (Topologie) --- Knopentheorie --- Knot theory --- Noeuds [Theorie des ] --- Three-manifolds (Topology) --- Trois-variétés (Topologie) --- Knot theory. --- Algebraic topology --- Invariants --- Mathematics --- Invariants (Mathematics) --- Invariants. --- 3-manifolds (Topology) --- Manifolds, Three dimensional (Topology) --- Three-dimensional manifolds (Topology) --- Low-dimensional topology --- Topological manifolds --- Knots (Topology) --- 3-manifold. --- Addition. --- Algorithm. --- Ambient isotopy. --- Axiom. --- Backslash. --- Barycentric subdivision. --- Bijection. --- Bipartite graph. --- Borromean rings. --- Boundary parallel. --- Bracket polynomial. --- Calculation. --- Canonical form. --- Cartesian product. --- Cobordism. --- Coefficient. --- Combination. --- Commutator. --- Complex conjugate. --- Computation. --- Connected component (graph theory). --- Connected sum. --- Cubic graph. --- Diagram (category theory). --- Dimension. --- Disjoint sets. --- Disjoint union. --- Elaboration. --- Embedding. --- Equation. --- Equivalence class. --- Explicit formula. --- Explicit formulae (L-function). --- Factorial. --- Fundamental group. --- Graph (discrete mathematics). --- Graph embedding. --- Handlebody. --- Homeomorphism. --- Homology (mathematics). --- Identity element. --- Intersection form (4-manifold). --- Inverse function. --- Jones polynomial. --- Kirby calculus. --- Line segment. --- Linear independence. --- Matching (graph theory). --- Mathematical physics. --- Mathematical proof. --- Mathematics. --- Maxima and minima. --- Monograph. --- Natural number. --- Network theory. --- Notation. --- Numerical analysis. --- Orientability. --- Orthogonality. --- Pairing. --- Pairwise. --- Parametrization. --- Parity (mathematics). --- Partition function (mathematics). --- Permutation. --- Poincaré conjecture. --- Polyhedron. --- Quantum group. --- Quantum invariant. --- Recoupling. --- Recursion. --- Reidemeister move. --- Result. --- Roger Penrose. --- Root of unity. --- Scientific notation. --- Sequence. --- Significant figures. --- Simultaneous equations. --- Smoothing. --- Special case. --- Sphere. --- Spin network. --- Summation. --- Symmetric group. --- Tetrahedron. --- The Geometry Center. --- Theorem. --- Theory. --- Three-dimensional space (mathematics). --- Time complexity. --- Tubular neighborhood. --- Two-dimensional space. --- Vector field. --- Vector space. --- Vertex (graph theory). --- Winding number. --- Writhe.

Characters of Reductive Groups over a Finite Field. (AM-107), Volume 107
Author:
ISBN: 0691083509 0691083517 1400881773 9780691083513 9780691083506 Year: 2016 Volume: 107 Publisher: Princeton, NJ : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Keywords

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.

Dynamics in one complex variable
Author:
ISBN: 9780691124889 9780691124872 0691124884 0691124876 9786613001481 1400835534 1283001489 9781400835539 9781283001489 6613001481 Year: 2006 Publisher: Princeton, N.J. : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume studies the dynamics of iterated holomorphic mappings from a Riemann surface to itself, concentrating on the classical case of rational maps of the Riemann sphere. This subject is large and rapidly growing. These lectures are intended to introduce some key ideas in the field, and to form a basis for further study. The reader is assumed to be familiar with the rudiments of complex variable theory and of two-dimensional differential geometry, as well as some basic topics from topology. This third edition contains a number of minor additions and improvements: A historical survey has been added, the definition of Lattés map has been made more inclusive, and the écalle-Voronin theory of parabolic points is described. The résidu itératif is studied, and the material on two complex variables has been expanded. Recent results on effective computability have been added, and the references have been expanded and updated. Written in his usual brilliant style, the author makes difficult mathematics look easy. This book is a very accessible source for much of what has been accomplished in the field.

Keywords

Functions of complex variables --- Holomorphic mappings --- Riemann surfaces --- Fonctions d'une variable complexe --- Applications holomorphes --- Riemann, surfaces de --- Holomorphic mappings. --- Mappings, Holomorphic --- Functions of complex variables. --- Riemann surfaces. --- Surfaces, Riemann --- Functions --- Functions of several complex variables --- Mappings (Mathematics) --- Complex variables --- Elliptic functions --- Functions of real variables --- Absolute value. --- Addition. --- Algebraic equation. --- Attractor. --- Automorphism. --- Beltrami equation. --- Blaschke product. --- Boundary (topology). --- Branched covering. --- Coefficient. --- Compact Riemann surface. --- Compact space. --- Complex analysis. --- Complex number. --- Complex plane. --- Computation. --- Connected component (graph theory). --- Connected space. --- Constant function. --- Continued fraction. --- Continuous function. --- Coordinate system. --- Corollary. --- Covering space. --- Cross-ratio. --- Derivative. --- Diagram (category theory). --- Diameter. --- Diffeomorphism. --- Differentiable manifold. --- Disjoint sets. --- Disjoint union. --- Disk (mathematics). --- Division by zero. --- Equation. --- Euler characteristic. --- Existential quantification. --- Exponential map (Lie theory). --- Fundamental group. --- Harmonic function. --- Holomorphic function. --- Homeomorphism. --- Hyperbolic geometry. --- Inequality (mathematics). --- Integer. --- Inverse function. --- Irrational rotation. --- Iteration. --- Jordan curve theorem. --- Julia set. --- Lebesgue measure. --- Lecture. --- Limit point. --- Line segment. --- Linear map. --- Linearization. --- Mandelbrot set. --- Mathematical analysis. --- Maximum modulus principle. --- Metric space. --- Monotonic function. --- Montel's theorem. --- Normal family. --- Open set. --- Orbifold. --- Parameter space. --- Parameter. --- Periodic point. --- Point at infinity. --- Polynomial. --- Power series. --- Proper map. --- Quadratic function. --- Rational approximation. --- Rational function. --- Rational number. --- Real number. --- Riemann sphere. --- Riemann surface. --- Root of unity. --- Rotation number. --- Schwarz lemma. --- Scientific notation. --- Sequence. --- Simply connected space. --- Special case. --- Subgroup. --- Subsequence. --- Subset. --- Summation. --- Tangent space. --- Theorem. --- Topological space. --- Topology. --- Uniform convergence. --- Uniformization theorem. --- Unit circle. --- Unit disk. --- Upper half-plane. --- Winding number.


Book
Outer billiards on kites
Author:
ISBN: 1282458582 9786612458583 1400831970 9781400831975 0691142483 9780691142487 0691142491 9780691142494 9781282458581 6612458585 Year: 2009 Publisher: Princeton, NJ : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Outer billiards is a basic dynamical system defined relative to a convex shape in the plane. B. H. Neumann introduced this system in the 1950's, and J. Moser popularized it as a toy model for celestial mechanics. All along, the so-called Moser-Neumann question has been one of the central problems in the field. This question asks whether or not one can have an outer billiards system with an unbounded orbit. The Moser-Neumann question is an idealized version of the question of whether, because of small disturbances in its orbit, the Earth can break out of its orbit and fly away from the Sun. In Outer Billiards on Kites, Richard Schwartz presents his affirmative solution to the Moser-Neumann problem. He shows that an outer billiards system can have an unbounded orbit when defined relative to any irrational kite. A kite is a quadrilateral having a diagonal that is a line of bilateral symmetry. The kite is irrational if the other diagonal divides the quadrilateral into two triangles whose areas are not rationally related. In addition to solving the basic problem, Schwartz relates outer billiards on kites to such topics as Diophantine approximation, the modular group, self-similar sets, polytope exchange maps, profinite completions of the integers, and solenoids--connections that together allow for a fairly complete analysis of the dynamical system.

Keywords

Hyperbolic spaces. --- Singularities (Mathematics) --- Transformations (Mathematics) --- Geometry, Plane. --- Plane geometry --- Algorithms --- Differential invariants --- Geometry, Differential --- Geometry, Algebraic --- Hyperbolic complex manifolds --- Manifolds, Hyperbolic complex --- Spaces, Hyperbolic --- Geometry, Non-Euclidean --- Abelian group. --- Automorphism. --- Big O notation. --- Bijection. --- Binary number. --- Bisection. --- Borel set. --- C0. --- Calculation. --- Cantor set. --- Cartesian coordinate system. --- Combination. --- Compass-and-straightedge construction. --- Congruence subgroup. --- Conjecture. --- Conjugacy class. --- Continuity equation. --- Convex lattice polytope. --- Convex polytope. --- Coprime integers. --- Counterexample. --- Cyclic group. --- Diameter. --- Diophantine approximation. --- Diophantine equation. --- Disjoint sets. --- Disjoint union. --- Division by zero. --- Embedding. --- Equation. --- Equivalence class. --- Ergodic theory. --- Ergodicity. --- Factorial. --- Fiber bundle. --- Fibonacci number. --- Fundamental domain. --- Gauss map. --- Geometry. --- Half-integer. --- Homeomorphism. --- Hyperbolic geometry. --- Hyperplane. --- Ideal triangle. --- Intersection (set theory). --- Interval exchange transformation. --- Inverse function. --- Inverse limit. --- Isometry group. --- Lattice (group). --- Limit set. --- Line segment. --- Linear algebra. --- Linear function. --- Line–line intersection. --- Main diagonal. --- Modular group. --- Monotonic function. --- Multiple (mathematics). --- Orthant. --- Outer billiard. --- Parallelogram. --- Parameter. --- Partial derivative. --- Penrose tiling. --- Permutation. --- Piecewise. --- Polygon. --- Polyhedron. --- Polytope. --- Product topology. --- Projective geometry. --- Rectangle. --- Renormalization. --- Rhombus. --- Right angle. --- Rotational symmetry. --- Sanity check. --- Scientific notation. --- Semicircle. --- Sign (mathematics). --- Special case. --- Square root of 2. --- Subsequence. --- Summation. --- Symbolic dynamics. --- Symmetry group. --- Tangent. --- Tetrahedron. --- Theorem. --- Toy model. --- Translational symmetry. --- Trapezoid. --- Triangle group. --- Triangle inequality. --- Two-dimensional space. --- Upper and lower bounds. --- Upper half-plane. --- Without loss of generality. --- Yair Minsky.

The real Fatou conjecture
Authors: ---
ISBN: 0691002576 1400865182 9781400865185 9780691002583 9780691002576 0691002584 9780691002583 Year: 1998 Publisher: Princeton, New Jersey : Princeton University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract

In 1920, Pierre Fatou expressed the conjecture that--except for special cases--all critical points of a rational map of the Riemann sphere tend to periodic orbits under iteration. This conjecture remains the main open problem in the dynamics of iterated maps. For the logistic family x- ax(1-x), it can be interpreted to mean that for a dense set of parameters "a," an attracting periodic orbit exists. The same question appears naturally in science, where the logistic family is used to construct models in physics, ecology, and economics. In this book, Jacek Graczyk and Grzegorz Swiatek provide a rigorous proof of the Real Fatou Conjecture. In spite of the apparently elementary nature of the problem, its solution requires advanced tools of complex analysis. The authors have written a self-contained and complete version of the argument, accessible to someone with no knowledge of complex dynamics and only basic familiarity with interval maps. The book will thus be useful to specialists in real dynamics as well as to graduate students.

Keywords

Geodesics (Mathematics) --- Polynomials. --- Mappings (Mathematics) --- Maps (Mathematics) --- Functions --- Functions, Continuous --- Topology --- Transformations (Mathematics) --- Algebra --- Geometry, Differential --- Global analysis (Mathematics) --- Mathematics --- Absolute value. --- Affine transformation. --- Algebraic function. --- Analytic continuation. --- Analytic function. --- Arithmetic. --- Automorphism. --- Big O notation. --- Bounded set (topological vector space). --- C0. --- Calculation. --- Canonical map. --- Change of variables. --- Chebyshev polynomials. --- Combinatorics. --- Commutative property. --- Complex number. --- Complex plane. --- Complex quadratic polynomial. --- Conformal map. --- Conjecture. --- Conjugacy class. --- Conjugate points. --- Connected component (graph theory). --- Connected space. --- Continuous function. --- Corollary. --- Covering space. --- Critical point (mathematics). --- Dense set. --- Derivative. --- Diffeomorphism. --- Dimension. --- Disjoint sets. --- Disjoint union. --- Disk (mathematics). --- Equicontinuity. --- Estimation. --- Existential quantification. --- Fibonacci. --- Functional equation. --- Fundamental domain. --- Generalization. --- Great-circle distance. --- Hausdorff distance. --- Holomorphic function. --- Homeomorphism. --- Homotopy. --- Hyperbolic function. --- Imaginary number. --- Implicit function theorem. --- Injective function. --- Integer. --- Intermediate value theorem. --- Interval (mathematics). --- Inverse function. --- Irreducible polynomial. --- Iteration. --- Jordan curve theorem. --- Julia set. --- Limit of a sequence. --- Linear map. --- Local diffeomorphism. --- Mathematical induction. --- Mathematical proof. --- Maxima and minima. --- Meromorphic function. --- Moduli (physics). --- Monomial. --- Monotonic function. --- Natural number. --- Neighbourhood (mathematics). --- Open set. --- Parameter. --- Periodic function. --- Periodic point. --- Phase space. --- Point at infinity. --- Polynomial. --- Projection (mathematics). --- Quadratic function. --- Quadratic. --- Quasiconformal mapping. --- Renormalization. --- Riemann sphere. --- Riemann surface. --- Schwarzian derivative. --- Scientific notation. --- Subsequence. --- Theorem. --- Theory. --- Topological conjugacy. --- Topological entropy. --- Topology. --- Union (set theory). --- Unit circle. --- Unit disk. --- Upper and lower bounds. --- Upper half-plane. --- Z0.

Listing 1 - 10 of 43 << page
of 5
>>
Sort by