scientific article; zbMATH DE number 6902897
From MaRDI portal
Publication:4576543
zbMath1391.11020MaRDI QIDQ4576543
Publication date: 12 July 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
iterationself-orthogonal Latin squaresaffine semigroups and the 3x+1 problemCoppersmith's complement covering criterionErdős's density probleminteger affine functionKlarner-Rado sequenceKlarner's criterion for free semigroupssemigroups of integer affine maps
Semigroups of transformations, relations, partitions, etc. (20M20) Other combinatorial number theory (11B75) Orthogonal arrays, Latin squares, Room squares (05B15) Special sequences and polynomials (11B83) Density, gaps, topology (11B05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets of integers closed under affine operators. The closure of finite sets
- Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
- Sets of integers closed under affine operators - the finite basis theorems
- A sufficient condition for certain semigroups to be free
- Some fascinating integer sequences
- The complement of certain recursively defined sets
- Recurrence relations based on minimization
- Arithmetic properties of certain recursively defined sets
- Remarks on Sade's disproof of the Euler conjecture with an application to Latin squares orthogonal to their transpose
- m-recognizability of sets closed under certain affine functions
- On Unsettleable Arithmetical Problems
- On the decidability of semigroup freeness
- ON THE FALSITY OF EULER'S CONJECTURE ABOUT THE NON-EXISTENCE OF TWO ORTHOGONAL LATIN SQUARES OF ORDER 4t + 2
- On the Construction of Sets of Mutually Orthogonal Latin Squares and the Falsity of a Conjecture of Euler
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- The 3x + 1 Problem and Its Generalizations
- An algorithm to determine when certain sets have 0-density
- Self-orthogonal latin squares of all orders 𝑛≠2,3,6
- Linear Combinations of Sets of Consecutive Integers
- Automatic Sequences
- ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
- Don't Try to Solve These Problems
- ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
- Unsolved problems in number theory
This page was built for publication:
