Irreducible disjoint covering systems
Generalized pascal triangles: overview of new results
On a generalization of Mycielski's and Znám's conjectures about coset decomposition of Abelian groups
On a problem of V. Pták
Beweis des Axioms der Konstruktivität in der Theorie endlicher Mengen
Definability of arithmetical operations from binary quadratic forms
Results on disjoint covering systems on the ring of integers
Concrete representation of some equivalence lattices
The problem, generalized Pascal triangles and cellular automata
Lower bounds for perfect rational cuboids
Palindromic squares for various number system bases
A density estimate for the problem
Structures related to Pascal’s triangle modulo and their elementary theories
Reversibility in generalized Pascal triangles and binary reversibility in one-dimensional cellular automata
Disjoint covering systems and product-invariant relations
Definability within structures related to Pascal’s triangle modulo an integer
Let Sq denote the set of squares, and let be the squaring function restricted to powers of n; let ⊥ denote the coprimeness relation. Let . For every integer n ≥ 2 addition and multiplication are definable in the structures ⟨ℕ; Bn,⊥⟩ and ⟨ℕ; Bn,Sq⟩; thus their elementary theories are undecidable. On the other hand, for every prime p the elementary theory of ⟨ℕ; Bp,SQp⟩ is decidable.
On disjoint covering of groups by their cosets
Summer session on ordered sets at Cikháj
Úlohy o veľkých číslach
Page 1