Generating functions for the digital sum and other digit counting sequences.
Generating normal numbers over Gaussian integers
Generating units modulo an odd integer by addition and subtraction
Geometric study of the beta-integers for a Perron number and mathematical quasicrystals
We investigate in a geometrical way the point sets of obtained by the -numeration that are the -integers where is a Perron number. We show that there exist two canonical cut-and-project schemes associated with the -numeration, allowing to lift up the -integers to some points of the lattice ( degree of ) lying about the dominant eigenspace of the companion matrix of . When is in particular a Pisot number, this framework gives another proof of the fact that is...
Geometrický důkaz poučky Wilsonovy
Global restrictions on ramification in number fields.
Good Lattice Points Modulo Composite Numbers.
Greatest common divisors in shifted Fibonacci sequences.
Greedy and lazy representations in negative base systems
We consider positional numeration systems with negative real base , where , and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of minimal and maximal -representation with respect to the alternate order. We also show that both extremal representations can be obtained as representations in the positive base with a non-integer alphabet. This enables us to characterize digit sequences admissible as greedy...