maths.free › Combinatorics & Graph Theory › The Many Faces of Combinatorics › Arithmetic Combinatorics
Arithmetic Combinatorics
In recent years, a great deal of attention has been focused on topics in arithmetic combinatorics, with a number of deep and exciting discoveries in the offing.
Arithmetic Combinatorics
In recent years, a great deal of attention has been focused on topics in arithmetic combinatorics, with a number of deep and exciting discoveries in the offing. In some sense, this area is closely aligned with Ramsey theory and number theory, but recent work shows connections with real and complex analysis, as well. Furthermore, the roots of arithmetic combinatorics go back many years. In this section, we present a brief overview of this rich and rapidly changing area.
Recall that an increasing sequence \(a_1\lt a_2\lt a_3\lt \dots\lt a_t)\) of integers is called an arithmetic progression when there exists a positive integer \(d\) for which \(a_{i+1}-a_i=d\), for all \(i=1,2,\dots,t-1\). The integer \(t\) is called the length of the arithmetic progression.
Material will be added here.
Agora tu Nenhuma calculadora resolve esta, mas as peças dela são computáveis. Tente um abaixo, ou digite seu próprio.
Uma conta gratuita adiciona notas sobre cada lição, um registro do que você terminou, seus problemas resolvidos em um lugar, e um tutor que você pode perguntar sobre esta página. A própria matemática está aberta a todos, assinada ou não.
Inscrever-se LoginSímbolos usados aqui
Toque em qualquer símbolo para a definição completa, uma imagem e o que cada letra nela significa.
Perguntas que as pessoas fazem
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
Partes desta página são adaptadas a partir de Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Condensado e reexplicado aqui; erros são nossos.
Mais em Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs