https://mklab.gr/ Tue, 28 Jul 2026 22:59:29 +0000 MyBB https://mklab.gr/showthread.php?tid=1401 Wed, 29 Jul 2026 00:55:36 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1401 Thinking Better: The Art of the Shortcut in Math and Life  
BY Marcus du Sautoy


Summary

In Thinking Better: The Art of the Shortcut in Math and Life, Oxford mathematician Marcus du Sautoy argues that true problem-solving and success come not from brute-force hard work, but from finding clever shortcuts. Du Sautoy demonstrates how mathematical principles—ranging from geometry and probability to calculus—serve as the ultimate time-saving tools, allowing us to solve complex tasks efficiently so we can focus on bigger challenges. Blending history, science, psychology, and real-world anecdotes from artists and entrepreneurs, the book celebrates human ingenuity and explains how strategic thinking gives us a distinct cognitive edge over raw repetition and artificial intelligence.


BOOK]]> Thinking Better: The Art of the Shortcut in Math and Life  
BY Marcus du Sautoy


Summary

In Thinking Better: The Art of the Shortcut in Math and Life, Oxford mathematician Marcus du Sautoy argues that true problem-solving and success come not from brute-force hard work, but from finding clever shortcuts. Du Sautoy demonstrates how mathematical principles—ranging from geometry and probability to calculus—serve as the ultimate time-saving tools, allowing us to solve complex tasks efficiently so we can focus on bigger challenges. Blending history, science, psychology, and real-world anecdotes from artists and entrepreneurs, the book celebrates human ingenuity and explains how strategic thinking gives us a distinct cognitive edge over raw repetition and artificial intelligence.


BOOK]]> https://mklab.gr/showthread.php?tid=1400 Wed, 29 Jul 2026 00:49:37 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1400 Euler characteristic

Summary

The Euler characteristic (denoted by the Greek letter $\chi$) is a fundamental numerical value in topology and polyhedral geometry that describes the intrinsic structure or shape of a mathematical space regardless of how it is bent or stretched. Originally discovered for polyhedra and formalized by Leonhard Euler, it was classically calculated using the formula $\chi = V - E + F$, where $V$, $E$, and $F$ represent the number of vertices, edges, and faces of a polyhedron (yielding $\chi = 2$ for all convex polyhedra and spheres). 

In modern mathematics, this concept extends to higher-dimensional shapes and abstract spaces as the alternating sum of cell counts ($\chi = k_0 - k_1 + k_2 - \dots$) or Betti numbers ($\chi = b_0 - b_1 + b_2 - \dots$), serving as a crucial topological invariant used to classify surfaces and distinguish non-equivalent geometric spaces.

ARTICLE]]> Euler characteristic

Summary

The Euler characteristic (denoted by the Greek letter $\chi$) is a fundamental numerical value in topology and polyhedral geometry that describes the intrinsic structure or shape of a mathematical space regardless of how it is bent or stretched. Originally discovered for polyhedra and formalized by Leonhard Euler, it was classically calculated using the formula $\chi = V - E + F$, where $V$, $E$, and $F$ represent the number of vertices, edges, and faces of a polyhedron (yielding $\chi = 2$ for all convex polyhedra and spheres). 

In modern mathematics, this concept extends to higher-dimensional shapes and abstract spaces as the alternating sum of cell counts ($\chi = k_0 - k_1 + k_2 - \dots$) or Betti numbers ($\chi = b_0 - b_1 + b_2 - \dots$), serving as a crucial topological invariant used to classify surfaces and distinguish non-equivalent geometric spaces.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1399 Wed, 29 Jul 2026 00:47:00 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1399

Wallace–Bolyai–Gerwien theorem

Summary

The Wallace–Bolyai–Gerwien theorem states that any two flat, two-dimensional polygons of equal area are equidecomposable (or scissors-congruent) — meaning one can be cut into a finite number of polygonal pieces and reassembled using only translations and rotations to form the other. 

Proved independently by William Wallace (1807), Farkas Bolyai (1833), and Paul Gerwien (1835), the theorem offers a constructive proof that does not rely on the Axiom of Choice, making the rearrangement physically achievable by slicing and rejoining the pieces (such as turning a square into an equilateral triangle of the same area). While this holds true for 2D shapes in Euclidean, hyperbolic, and spherical geometries, it notably fails in three dimensions, as shown by Max Dehn's resolution of Hilbert's third problem.

ARTICLE]]>

Wallace–Bolyai–Gerwien theorem

Summary

The Wallace–Bolyai–Gerwien theorem states that any two flat, two-dimensional polygons of equal area are equidecomposable (or scissors-congruent) — meaning one can be cut into a finite number of polygonal pieces and reassembled using only translations and rotations to form the other. 

Proved independently by William Wallace (1807), Farkas Bolyai (1833), and Paul Gerwien (1835), the theorem offers a constructive proof that does not rely on the Axiom of Choice, making the rearrangement physically achievable by slicing and rejoining the pieces (such as turning a square into an equilateral triangle of the same area). While this holds true for 2D shapes in Euclidean, hyperbolic, and spherical geometries, it notably fails in three dimensions, as shown by Max Dehn's resolution of Hilbert's third problem.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1398 Wed, 29 Jul 2026 00:43:20 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1398 Envy-free cake-cutting

Summary

Envy-free cake-cutting is a classical problem in fair division and game theory that seeks to partition a heterogeneous resource (the "cake") among $n$ participants such that every individual considers their assigned portion to be at least as valuable as anyone else's, eliminating any subjective envy. While two-player divisions are easily resolved using the ancient "divide and choose" method, the problem becomes significantly more complex for three or more participants. 

Research splits into two main variants: connected pieces, where each person receives a single continuous slice, and general pieces, where shares can consist of multiple disjoint fragments. Although an envy-free division with connected pieces is mathematically guaranteed to exist under mild conditions, provably no finite protocol exists to compute it for three or more partners; in contrast, for general pieces, finite bounded algorithms do exist—such as the landmark discrete protocol developed by Haris Aziz and Simon Mackenzie—though determining the exact runtime complexity remains an open question in computer science.

ARTICLE]]> Envy-free cake-cutting

Summary

Envy-free cake-cutting is a classical problem in fair division and game theory that seeks to partition a heterogeneous resource (the "cake") among $n$ participants such that every individual considers their assigned portion to be at least as valuable as anyone else's, eliminating any subjective envy. While two-player divisions are easily resolved using the ancient "divide and choose" method, the problem becomes significantly more complex for three or more participants. 

Research splits into two main variants: connected pieces, where each person receives a single continuous slice, and general pieces, where shares can consist of multiple disjoint fragments. Although an envy-free division with connected pieces is mathematically guaranteed to exist under mild conditions, provably no finite protocol exists to compute it for three or more partners; in contrast, for general pieces, finite bounded algorithms do exist—such as the landmark discrete protocol developed by Haris Aziz and Simon Mackenzie—though determining the exact runtime complexity remains an open question in computer science.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1397 Wed, 29 Jul 2026 00:40:23 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1397 Devil's Staircase

Summary

The Devil’s Staircase is a self-similar, monotonic fractal function—most famously illustrated by the Cantor function and mode-locking behavior in circle maps—that continuously maps the interval $[0,1]$ onto $[0,1]$ while remaining constant almost everywhere except on a set of measure zero (such as a Cantor set). In nonlinear dynamics, it models systems whose winding numbers lock into rational values at each step, forming a staircase where simpler rational steps occupy larger intervals. 

MathWorld also notes a related arithmetic variation defined via infinite sums of floor functions, which yields a function that is continuous at irrational inputs and discontinuous at rational ones, highlighting deep connections between non-differentiable fractal curves, chaos theory, and number theory.

ARTICLE]]> Devil's Staircase

Summary

The Devil’s Staircase is a self-similar, monotonic fractal function—most famously illustrated by the Cantor function and mode-locking behavior in circle maps—that continuously maps the interval $[0,1]$ onto $[0,1]$ while remaining constant almost everywhere except on a set of measure zero (such as a Cantor set). In nonlinear dynamics, it models systems whose winding numbers lock into rational values at each step, forming a staircase where simpler rational steps occupy larger intervals. 

MathWorld also notes a related arithmetic variation defined via infinite sums of floor functions, which yields a function that is continuous at irrational inputs and discontinuous at rational ones, highlighting deep connections between non-differentiable fractal curves, chaos theory, and number theory.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1396 Wed, 29 Jul 2026 00:37:33 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1396 The paradox of derivatives and integrals

Summary

In this blog post, Andrew Gelman explores the paradox between the analytical and computational natures of calculus, noting that while derivatives are analytically simple—easily solved using rules like the chain rule—they are computationally volatile because differentiating amplifies noise in data. 

Conversely, integrals are notoriously difficult to solve analytically in closed form, yet computationally stable since integration acts as an averaging mechanism that smooths out variation. He extends this contrast to fields like econometrics, where estimating aggregate, sum-like effects (integrals) is straightforward, whereas pinpointing marginal, difference-based effects (derivatives) requires far more modeling because data on the sharp margin is inherently sparse and sensitive.

ARTICLE]]> The paradox of derivatives and integrals

Summary

In this blog post, Andrew Gelman explores the paradox between the analytical and computational natures of calculus, noting that while derivatives are analytically simple—easily solved using rules like the chain rule—they are computationally volatile because differentiating amplifies noise in data. 

Conversely, integrals are notoriously difficult to solve analytically in closed form, yet computationally stable since integration acts as an averaging mechanism that smooths out variation. He extends this contrast to fields like econometrics, where estimating aggregate, sum-like effects (integrals) is straightforward, whereas pinpointing marginal, difference-based effects (derivatives) requires far more modeling because data on the sharp margin is inherently sparse and sensitive.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1395 Wed, 29 Jul 2026 00:28:03 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1395
Borsuk–Ulam theorem

Summary

The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous function from an $n$-sphere into $n$-dimensional Euclidean space must map at least one pair of diametrically opposite (antipodal) points to the exact same point. 

Informally, this means that if you continuously map a spherical surface into a flat space of one lower dimension, there will always be a pair of opposite points that end up at the same location—a classic meteorological consequence of which is that at any given moment, there are always two opposite points on Earth's surface that share the exact same temperature and barometric pressure.

ARTICLE]]>
Borsuk–Ulam theorem

Summary

The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous function from an $n$-sphere into $n$-dimensional Euclidean space must map at least one pair of diametrically opposite (antipodal) points to the exact same point. 

Informally, this means that if you continuously map a spherical surface into a flat space of one lower dimension, there will always be a pair of opposite points that end up at the same location—a classic meteorological consequence of which is that at any given moment, there are always two opposite points on Earth's surface that share the exact same temperature and barometric pressure.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1394 Wed, 29 Jul 2026 00:21:11 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1394 Szemerédi's theorem

Summary

Szemerédi's theorem is a fundamental result in arithmetic combinatorics, originally conjectured by Paul Erdős and Paul Turán in 1936 and proved by Hungarian mathematician Endre Szemerédi in 1975. The theorem states that any subset of the natural numbers with positive upper density (meaning it contains a non-zero proportion of the integers as the set grows infinitely) contains an arithmetic progression of length $k$ for every positive integer $k$.

 Beyond its primary statement, the result is famous for driving deep mathematical connections; distinct proofs were later established using combinatorics, ergodic theory, and Fourier analysis, earning the theorem a reputation as a "Rosetta stone" linking disparate areas of mathematics and inspiring major breakthroughs like the Green–Tao theorem on prime numbers.

ARTICLE]]> Szemerédi's theorem

Summary

Szemerédi's theorem is a fundamental result in arithmetic combinatorics, originally conjectured by Paul Erdős and Paul Turán in 1936 and proved by Hungarian mathematician Endre Szemerédi in 1975. The theorem states that any subset of the natural numbers with positive upper density (meaning it contains a non-zero proportion of the integers as the set grows infinitely) contains an arithmetic progression of length $k$ for every positive integer $k$.

 Beyond its primary statement, the result is famous for driving deep mathematical connections; distinct proofs were later established using combinatorics, ergodic theory, and Fourier analysis, earning the theorem a reputation as a "Rosetta stone" linking disparate areas of mathematics and inspiring major breakthroughs like the Green–Tao theorem on prime numbers.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1393 Wed, 29 Jul 2026 00:16:43 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1393 Waring’s problem

Summary

Proposed by English mathematician Edward Waring in 1770, Waring's problem is a fundamental question in number theory asking whether, for every positive integer $k$, there exists a corresponding minimum integer $g(k)$ such that every natural number can be expressed as the sum of at most $g(k)$ natural numbers raised to the $k$-th power. For example, every natural number is the sum of at most 4 squares ($g(2) = 4$), 9 cubes ($g(3) = 9$), or 19 fourth powers ($g(4) = 19$). 

David Hilbert affirmatively proved the existence of such a finite limit for every power $k$ in 1909—a result known as the Hilbert–Waring theorem—and modern research continues to explore exact formulas for $g(k)$ as well as $G(k)$, which measures the maximum number of $k$-th powers required to express all sufficiently large integers.

ARTICLE]]> Waring’s problem

Summary

Proposed by English mathematician Edward Waring in 1770, Waring's problem is a fundamental question in number theory asking whether, for every positive integer $k$, there exists a corresponding minimum integer $g(k)$ such that every natural number can be expressed as the sum of at most $g(k)$ natural numbers raised to the $k$-th power. For example, every natural number is the sum of at most 4 squares ($g(2) = 4$), 9 cubes ($g(3) = 9$), or 19 fourth powers ($g(4) = 19$). 

David Hilbert affirmatively proved the existence of such a finite limit for every power $k$ in 1909—a result known as the Hilbert–Waring theorem—and modern research continues to explore exact formulas for $g(k)$ as well as $G(k)$, which measures the maximum number of $k$-th powers required to express all sufficiently large integers.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1392 Wed, 29 Jul 2026 00:13:03 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1392
Summary

Ramsey's theorem is a foundational result in combinatorics that guarantees the emergence of order within large systems, often summarized by the idea that "complete disorder is impossible." In graph theory, it states that if you color the edges of a sufficiently large complete graph with a fixed number of colors, you are guaranteed to find a complete subgraph whose edges are all a single color (a monochromatic clique). 

The smallest number of vertices needed to guarantee such a pattern is called a Ramsey number (denoted as $R(r, s)$ for two colors); a popular example is the "theorem on friends and strangers" ($R(3,3)=6$), which shows that in any group of six people, there must be at least three mutual acquaintances or three total strangers. Proved by Frank P. Ramsey in 1930, the theorem laid the groundwork for Ramsey theory, though calculating the exact values of larger Ramsey numbers remains one of the hardest open problems in modern mathematics.

ARTICLE]]>
Summary

Ramsey's theorem is a foundational result in combinatorics that guarantees the emergence of order within large systems, often summarized by the idea that "complete disorder is impossible." In graph theory, it states that if you color the edges of a sufficiently large complete graph with a fixed number of colors, you are guaranteed to find a complete subgraph whose edges are all a single color (a monochromatic clique). 

The smallest number of vertices needed to guarantee such a pattern is called a Ramsey number (denoted as $R(r, s)$ for two colors); a popular example is the "theorem on friends and strangers" ($R(3,3)=6$), which shows that in any group of six people, there must be at least three mutual acquaintances or three total strangers. Proved by Frank P. Ramsey in 1930, the theorem laid the groundwork for Ramsey theory, though calculating the exact values of larger Ramsey numbers remains one of the hardest open problems in modern mathematics.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1391 Wed, 29 Jul 2026 00:10:19 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1391
Summary

Wilson's theorem is a fundamental result in number theory stating that a natural number $n > 1$ is a prime number if and only if the product of all positive integers less than $n$ is one less than a multiple of $n$—expressed in modular arithmetic as $(n-1)! \equiv -1 \pmod n$. 

First stated by Persian mathematician Ibn al-Haytham around 1000 AD and later named after John Wilson (with its first published proof by Joseph-Louis Lagrange in 1771), the theorem provides a theoretical condition for primality, though it is practically useless for testing large prime numbers due to the steep computational complexity of calculating large factorials.

ARTICLE]]>
Summary

Wilson's theorem is a fundamental result in number theory stating that a natural number $n > 1$ is a prime number if and only if the product of all positive integers less than $n$ is one less than a multiple of $n$—expressed in modular arithmetic as $(n-1)! \equiv -1 \pmod n$. 

First stated by Persian mathematician Ibn al-Haytham around 1000 AD and later named after John Wilson (with its first published proof by Joseph-Louis Lagrange in 1771), the theorem provides a theoretical condition for primality, though it is practically useless for testing large prime numbers due to the steep computational complexity of calculating large factorials.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1390 Wed, 29 Jul 2026 00:07:23 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1390 Steinitz exchange lemma

Summary

The Steinitz exchange lemma is a foundational theorem in linear algebra stating that if $U$ is a linearly independent set of vectors and $W$ is a spanning set for a vector space, then $U$ cannot contain more elements than $W$ ($\vert{}U\vert{} \le \vert{}W\vert{}$), and a subset of elements from $W$ can be replaced by elements of $U$ to maintain a complete spanning set. 

Named after German mathematician Ernst Steinitz (and extended to matroids as the Steinitz–Mac Lane exchange lemma), it is a crucial tool used to prove that every basis of a finite-dimensional vector space has the exact same number of elements, thereby providing a rigorous foundation for the concept of dimension.

ARTICLE]]> Steinitz exchange lemma

Summary

The Steinitz exchange lemma is a foundational theorem in linear algebra stating that if $U$ is a linearly independent set of vectors and $W$ is a spanning set for a vector space, then $U$ cannot contain more elements than $W$ ($\vert{}U\vert{} \le \vert{}W\vert{}$), and a subset of elements from $W$ can be replaced by elements of $U$ to maintain a complete spanning set. 

Named after German mathematician Ernst Steinitz (and extended to matroids as the Steinitz–Mac Lane exchange lemma), it is a crucial tool used to prove that every basis of a finite-dimensional vector space has the exact same number of elements, thereby providing a rigorous foundation for the concept of dimension.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1389 Wed, 29 Jul 2026 00:04:44 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1389 Gauss's lemma

Summary

Gauss's lemma for polynomials is a fundamental algebraic theorem stating that the product of two primitive polynomials—those whose coefficients share a greatest common divisor of 1—is also primitive. Originating in Carl Friedrich Gauss's 1801 treatise Disquisitiones Arithmeticae, the lemma holds for polynomials over the integers and extends to any unique factorization domain (UFD). Its primary corollary proves that a non-constant primitive polynomial is irreducible over an integral domain (like the integers) if and only if it is irreducible over its field of fractions (like the rational numbers). This key result guarantees that polynomial rings over UFDs are themselves UFDs, forming the core theoretical foundation for modern polynomial factorization and greatest common divisor algorithms.

ARTICE]]> Gauss's lemma

Summary

Gauss's lemma for polynomials is a fundamental algebraic theorem stating that the product of two primitive polynomials—those whose coefficients share a greatest common divisor of 1—is also primitive. Originating in Carl Friedrich Gauss's 1801 treatise Disquisitiones Arithmeticae, the lemma holds for polynomials over the integers and extends to any unique factorization domain (UFD). Its primary corollary proves that a non-constant primitive polynomial is irreducible over an integral domain (like the integers) if and only if it is irreducible over its field of fractions (like the rational numbers). This key result guarantees that polynomial rings over UFDs are themselves UFDs, forming the core theoretical foundation for modern polynomial factorization and greatest common divisor algorithms.

ARTICE]]> https://mklab.gr/showthread.php?tid=1388 Tue, 28 Jul 2026 23:59:49 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1388 Euler's criterion

Summary

In number theory, Euler's criterion (formulated by Leonhard Euler in 1748) provides a direct method to determine whether an integer $a$ coprime to an odd prime $p$ is a quadratic residue—meaning whether the congruence $x^2 \equiv a \pmod p$ has a integer solution. The criterion states that $a^{(p-1)/2} \equiv 1 \pmod p$ if $a$ is a quadratic residue, and $a^{(p-1)/2} \equiv -1 \pmod p$ if it is a nonresidue, which can be concisely expressed using the Legendre symbol as $\left(\frac{a}{p}\right) \equiv a^{\frac{p-1}{2}} \pmod p$. 

Derived from Fermat's Little Theorem and Lagrange's Theorem on polynomial roots, this fundamental result plays a crucial role in modular arithmetic, connects to the law of quadratic reciprocity, and serves as the theoretical backbone for probabilistic primality tests such as the Solovay–Strassen test.

ARTICLE]]> Euler's criterion

Summary

In number theory, Euler's criterion (formulated by Leonhard Euler in 1748) provides a direct method to determine whether an integer $a$ coprime to an odd prime $p$ is a quadratic residue—meaning whether the congruence $x^2 \equiv a \pmod p$ has a integer solution. The criterion states that $a^{(p-1)/2} \equiv 1 \pmod p$ if $a$ is a quadratic residue, and $a^{(p-1)/2} \equiv -1 \pmod p$ if it is a nonresidue, which can be concisely expressed using the Legendre symbol as $\left(\frac{a}{p}\right) \equiv a^{\frac{p-1}{2}} \pmod p$. 

Derived from Fermat's Little Theorem and Lagrange's Theorem on polynomial roots, this fundamental result plays a crucial role in modular arithmetic, connects to the law of quadratic reciprocity, and serves as the theoretical backbone for probabilistic primality tests such as the Solovay–Strassen test.

ARTICLE]]> https://mklab.gr/showthread.php?tid=1387 Tue, 28 Jul 2026 23:56:51 +0300 mklabgr]]> https://mklab.gr/showthread.php?tid=1387
Sperner's lemma

Summary

Sperner's lemma is a combinatorial theorem in mathematics that concerns the colorings of triangulations on simplices, stating that any valid Sperner coloring of a triangulated $n$-dimensional simplex must contain an odd number of fully labeled sub-simplices whose vertices all possess distinct colors. 

Proved by Emanuel Sperner in 1928, this lemma is widely recognized for its application in algebraic topology, where it serves as a combinatorial equivalent to the Brouwer fixed-point theorem and is used to guarantee the existence of fixed points in continuous functions.


ARTICLE]]>
Sperner's lemma

Summary

Sperner's lemma is a combinatorial theorem in mathematics that concerns the colorings of triangulations on simplices, stating that any valid Sperner coloring of a triangulated $n$-dimensional simplex must contain an odd number of fully labeled sub-simplices whose vertices all possess distinct colors. 

Proved by Emanuel Sperner in 1928, this lemma is widely recognized for its application in algebraic topology, where it serves as a combinatorial equivalent to the Brouwer fixed-point theorem and is used to guarantee the existence of fixed points in continuous functions.


ARTICLE]]>