2-adic absolute value 2026-10-14
The 2-adic absolute value is the p-adic absolute value for the prime number . It is defined on the rational numbers by for and , and extends to their P-adic number completion . For a nonzero integer, count factors of two until the remaining factor is odd; for a rational number, subtract the denominator's count from the numerator's count.
The associated metric reverses a familiar comparison:
Although is eight units from on the ordinary number line, it agrees with modulo , whereas already disagrees modulo . The 2-adic absolute value measures that agreement. The value also shows why this Non-Archimedean absolute value must be distinguished from the ordinary absolute value .
Figure 1.
Ordinary absolute value and 2-adic absolute value give different distance patterns for the same sixteen integers
. Details.
In the left panel, differences farther from the diagonal grow in ordinary absolute value. In the right panel, nonzero even differences are closer than odd differences, and each further factor of two halves the 2-adic absolute value. The highlighted pairs have opposite distance rankings. The repeated pattern is the nested congruence class structure of an ultrametric space, visible without adding any new points.
2-adic integer Created 2026-10-14 Updated 2026-11-05
A 2-adic integer is an element of the p-adic integers for , equivalently a compatible sequence of residues modulo . Its binary p-adic digits begin with its parity. The highlighted residue-tree path for begins , while modular inversion converges to a p-adic inverse computes the infinite expansion of .
3-j symbol Created 2026-10-06 Updated 2026-11-05
A symmetrized form of the Clebsch-Gordan coefficients used for coupling three angular momenta. The relation is . The symbol vanishes unless the magnetic indices sum to zero and the angular momenta obey the triangle and integrality conditions. Products of two such symbols express the Gaunt integral; the zero-magnetic-index symbol enforces even total multipole for integer spherical harmonics.
47-smooth number Created 2026-10-20 Updated 2026-11-05
A 47-smooth number is a positive integer whose prime factors are all at most . Equivalently, it is a product of nonnegative powers of . The number one is included as the empty product.
For example, is 47-smooth, while is not. The bound constrains the prime factors rather than the size of the number. Such classes make multiplicative searches manageable by replacing an arbitrary factorization with an exponent vector over a fixed finite prime set.
5-smooth number Created 2026-10-20 Updated 2026-11-05
A 5-smooth number, also called a Hamming number, is a positive integer of the form with . The sequence begins .
The number seven is absent, while arbitrarily large powers of two are present. To generate the sequence in increasing order, merge the three sorted sequences formed by multiplying earlier values by , removing duplicates. For a finite bound , an equivalent search enumerates exponent triples satisfying .
7-adic integer Created 2026-10-14 Updated 2026-11-05
A 7-adic integer is an element of the p-adic integers for , equivalently a compatible sequence of residues modulo . Its p-adic digits lie in . For example, has low-to-high digits .
Abacus of a partition Created 2026-09-28 Updated 2026-11-05
An -runner abacus arranges the nonnegative integers by their residues modulo and places beads at the positions in a beta set. Moving a bead up one place on its runner removes a rim hook of length , provided the destination is empty.
An abacus represents the beta set of a partition by beads at integer positions. Positions with the same residue modulo the chosen runner count lie on one runner; moving a bead to an empty position above it represents the corresponding rim-hook removal.
abc conjecture Created 2026-10-14 Updated 2026-11-05
For every , the abc conjecture asserts that there is a constant such that all coprime positive integers satisfy
The radical of an integer is the product of its distinct prime factors. The condition makes the three entries pairwise coprime. Repeated prime powers enlarge a number without enlarging its radical in the same way, so the conjecture constrains how often addition can relate unusually concentrated prime factorizations.
The example has and is an abc-hit. Such examples are compatible with the conjecture: its bound includes both the constant and the exponent . Conditional applications include the primitive Fermat bound from abc and the Catalan power bound from abc.
More generally, fix positive integers , a nonzero integer , and positive integers satisfying . Put , which divides . Applying the conjecture to the normalized positive triple formed from , and gives, for ,
Indeed, the largest normalized entry is at least a fixed multiple of , while the radical is at most . Taking makes the exponent at least for , bounding uniformly; if , it also bounds . The separate case can satisfy the equation for every when .
Abelian group Created 2026-09-24 Updated 2026-11-05
An abelian group is a group whose group operation is commutative: for every . Thus rearranging a finite sequence of operations preserves the result. Associativity already permits changing parentheses; commutativity additionally permits exchanging the elements.
The additive integers, the additive real numbers, and every cyclic group are abelian groups. Additive notation is often convenient: the identity element is written , the inverse element of is , and . It does not force an element to be an ordinary number: in , an element is a pair of binary coordinates, added componentwise modulo two.
Commutativity is useful because an integer linear combination of chosen group elements depends only on their coefficients, rather than on the order in which the operations were performed. The Fundamental theorem of finitely generated abelian groups turns this simplicity into a classification by cyclic groups. However, commutativity does not imply that a single generator of a group suffices: the Klein four-group is the smallest counterexample, as the cyclic group of order four and Klein four-group demonstrate.
Abelian groups as integer modules Created 2026-10-14 Updated 2026-10-25
Every abelian group has exactly one unital module structure over the integers. For , define by adding to itself times, put , and put . The module axioms force this action, so no additional choice is involved. Moreover, every Abelian group homomorphism respects it and is a module homomorphism. See David McKinnon's Modules, the integer-scalar example.
For example, in the free module ,
In the cyclic group , the same repeated-addition rule gives and . The scalar is nonzero in the scalar ring , even though it kills the nonzero module element . Thus the scalar ring and the module must be kept distinct.
In the Heisenberg group over a commutative ring with , the subset is an Abelian subgroup of group order 16. Its product has central coordinate , symmetric in the two factors. Its inverse element is . The map is a surjective group homomorphism to the additive group of , with kernel of a group homomorphism . Thus is a normal subgroup and has four cosets in the 64-element group.
Unlike the odd-prime case, division by two is unavailable. In fact take and . Then , where the binomial coefficient is computed as an integer before reduction modulo four. Hence and has element order eight. The element has element order two and is not a power of : the powers with outer coordinates two have central coordinates one or three. Their generated subgroups intersect trivially, so the 16-element Abelian group is the direct product of groups .
Absolute logarithmic Weil height Created 2026-09-24 Updated 2026-11-05
The Absolute logarithmic Weil height is the logarithm of the absolute multiplicative height of an algebraic number. If its primitive integer minimal polynomial is , then
Thus it is the logarithm of the Mahler measure divided by the degree.
For a reduced rational , . It satisfies for nonzero and integral . Unlike a single absolute value, it records denominator complexity and the behavior of all conjugates, making it suitable for arithmetic bounds that should not depend on a chosen embedding.
Absolutely normal number Created 2026-10-05 Updated 2026-10-14
An absolutely normal number is a normal number in every integer base . This requires every finite word in every such positional notation to have its appropriate limiting digit block frequency. Knowing base-ten normality alone does not establish absolute normality; the base is part of the statement.
Borel's 1909 result says that absolute normality holds almost everywhere for Lebesgue measure: within the exceptions form a Lebesgue null set. In particular, the set of absolutely normal numbers has Lebesgue measure one there. This is a statement about the size of an exceptional set, not a test for a specified constant. [ref] [ref]
A modern route uses the Birkhoff ergodic theorem and ergodicity of integer multiplication on the circle. For each fixed base and digit interval, the time proportion equals its Lebesgue measure almost everywhere. The bases and finite words form countable sets, so a countable intersection of these measure-one sets still has Lebesgue measure one. For an absolutely normal number, the word therefore has frequency in base two, in base three, and in base ten. The same symbols represent different intervals in different bases.
Abstract syntax tree 2026-10-13
An abstract syntax tree is a rooted tree recording the meaningful syntactic pieces of a program and how they fit together. A program identifier such as x, a literal value such as 2, and a node representing addition have different roles. Their arrangement answers structural questions: which program expression supplies an operand, which name is a variable assignment target, and which construct encloses another. This makes an abstract syntax tree useful to a compiler, an interpreter, and the type system that checks a program.
The word "abstract" describes what is omitted. Lexical analysis first recognizes lexical tokens, such as x, =, 2, +, 3, *, 4. A concrete parse tree can retain grammar derivation structure, including punctuation and intermediate context-free grammar categories such as expression, term and factor. An abstract syntax tree usually keeps the operation and its operands without all those grammar scaffolds. Parentheses can determine its shape without surviving as separate nodes. A parser may construct the abstract syntax tree directly; it need not first allocate a concrete parse tree.
An abstract syntax tree records programming language syntax, but does not by itself supply all programming language semantics. In a+b, the names do not reveal their current values, and + might perform addition of integers or concatenate strings. The programming language rules, name bindings, and operand types determine the meaning. In Python, successfully calling ast.parse also does not guarantee that later compilation will accept the result: parsing return 42 succeeds, but compiling that statement outside a function fails. [ref]
An abstract syntax tree is not machine code. Its nodes describe language constructs. A compiler can check and transform this structure before translating it into executable instructions; an interpreter can evaluate an appropriate tree directly. The little evaluator below demonstrates this distinction without pretending to implement an entire programming language.
Abstract syntax tree precedence example Created 2026-10-13 Updated 2026-10-31
Consider Python programs x=2+3*4 and x=(2+3)*4. Operator precedence places multiplication inside the right operand of addition in the first abstract syntax tree. The parentheses instead place addition inside the left operand of multiplication in the second. Their right-hand sides evaluate to and . No rule that simply reads all operators left to right would recover both structures. [ref]
Figure 1.
Two abstract syntax trees for variable assignment: operator precedence gives x=2+3*4 the value , while parentheses give x=(2+3)*4 the value
. Details.
These are schematic views of Python trees: Module is omitted, and the Add/Mult and Store markers are written inside their owning nodes. In the actual schema, BinOp has left, op and right fields; Assign has a list of targets and a value. Name(id='x', ctx=Store()) marks the name as a variable assignment target. Reading x in a program expression instead uses Load. A variable assignment is a statement, not an equation asserting that two values are equal. [ref]
A restricted recursive evaluator can follow those fields. It accepts only integer literal values and binary addition, subtraction and multiplication; the surrounding variable assignment remains a separate action. Using type(value) is int excludes Boolean constants, even though Python treats bool as a subclass of int.
import ast

OPS = {ast.Add: lambda a, b: a + b,
       ast.Sub: lambda a, b: a - b,
       ast.Mult: lambda a, b: a * b}

def evaluate(node):
    if isinstance(node, ast.Constant) and type(node.value) is int:
        return node.value
    if isinstance(node, ast.BinOp) and type(node.op) in OPS:
        return OPS[type(node.op)](evaluate(node.left), evaluate(node.right))
    raise ValueError("outside the integer-expression language")

for source in ("x=2+3*4", "x=(2+3)*4"):
    tree = ast.parse(source, optimize=0)
    statement = tree.body[0]
    print(statement.targets[0].id, evaluate(statement.value))
# x 14
# x 20
The children in a rooted tree have ordered roles: left and right cannot be interchanged. For subtraction, 8-3 gives while 3-8 gives . Operator associativity also matters: 8-3-1 parses as (8-3)-1, giving , whereas 8-(3-1) gives . Here the syntax groups operators to the left; this does not assert the mathematical associativity of subtraction. Operator precedence determines grouping, rather than a general permission to reorder execution. For example, Python evaluates the calls in f()+g()*h() in the order f, g, h, although the multiplication result must be ready before the outer addition. [ref]
Achilles number Created 2026-10-20 Updated 2026-11-05
An Achilles number is a powerful number greater than one that is not a perfect power. In its prime factorization
every prime exponent satisfies , and . The first condition is precisely the definition of a powerful number. For the second, with integers exactly when divides every prime exponent; hence a greatest common divisor greater than one is precisely the obstruction.
For example, is an Achilles number because . By contrast, is powerful but is a perfect square, so it is not an Achilles number.
Acyclic quiver representations degenerate to zero Created 2026-10-06 Updated 2026-11-05
Choose integer vertex weights increasing along every arrow of a finite acyclic quiver. Acting at vertex by multiplies each arrow by a positive power of . At all arrows vanish. Thus every orbit closure contains the origin of the quiver representation space.
Addition modulo an integer Created 2026-10-18 Updated 2026-11-05
For an integer , add residue classes by adding their representatives and taking the class modulo . This is well-defined because replacing either representative by a multiple-of- translate changes the sum by a multiple of . The associativity, identity class and inverse are inherited from integer addition. The result is the additive cyclic group .
Additive combinatorics Created 2026-09-24 Updated 2026-10-13
Additive combinatorics studies how the cardinalities and sumset representation functions of sumsets reveal structure in finite sets contained in abelian groups. Write the group operation as addition: the ambient abelian group may be the integers , a finite cyclic group, or another abelian group. The same definitions apply, but the ambient group changes which bounds are possible.
The basic experiment is to add every ordered pair of members of a finite set. The sumset records the distinct answers; the sumset representation function records how often each answer occurs; the additive energy counts coincidences between those answers. An arithmetic progression produces many repeated sums, so its sumset grows slowly and its additive energy is relatively large. The doubling constant measures that growth relative to the original cardinality.
The examples below compare the arithmetic progression with the more spread-out integer set . Their four members give sixteen ordered pairs in each case, but different numbers of distinct sums. This small comparison illustrates the definitions; it does not establish a claim about arbitrarily large sets. For a systematic introduction, see Tao and Vu's author page for Additive Combinatorics, with free sample chapters on sum set estimates and additive geometry.
Additive energy Created 2026-09-24 Updated 2026-10-13
The additive energy of a finite set in an abelian group counts additive quadruples, with order and repeated members allowed:
At a fixed sum , independently choosing two of its ordered pairs gives additive quadruples. Thus additive energy weights heavily represented sums more strongly than the cardinality of the sumset does.
For and , the sumset representation functions give
The arithmetic progression has additional coincidences such as . The set still has coincidences forced by commutativity, including , so its additive energy is not merely the sixteen identical-pair comparisons.
The same additive energy can be counted using the difference set. Define . The identity is equivalent to , and the coordinate rearrangement is a bijection. Consequently
For , the difference counts from through are again . For , the zero difference has four representations and each of the twelve nonzero differences has one, giving . The sumset representation functions for sums and differences can look different while their squared totals agree.
For every nonempty finite set in an abelian group ,
The lower bound follows from the Cauchy-Schwarz inequality and the total sumset representation function count:
For the upper bound, any three members determine at most one fourth member of an additive quadruple. See Yufei Zhao's MIT lecture 25, pages 1-3, for representation counts and the energy bounds.
In the two integer examples, the lower bounds are and , and the upper bound is . For the subgroup of , each element of has three sum representations, so and both bounds are equalities.
For nonempty , dividing additive energy by gives a relative measure between and one. Small doubling constant therefore forces relatively large additive energy. A converse requires care: the Balog-Szemerédi-Gowers theorem extracts a large subset with small doubling constant, rather than asserting that all of has small doubling constant.