The following pages link to Apoloniusz Tyszka (Q206649):
Displayed 50 items.
- A discrete form of the Beckman-Quarles theorem for mappings from \(\mathbb{R}^2\,(\mathbb{C}^2)\) to \(\mathbb{F}^2\), where \(\mathbb{F}\) is a subfield of a commutative field extending \(\mathbb{R}\,(\mathbb{C})\) (Q860240) (← links)
- On binary relations without non-identical endomorphisms (Q1349034) (← links)
- A discrete form of the Beckman-Quarles theorem for rational spaces (Q1601387) (← links)
- (Q1766168) (redirect page) (← links)
- The Beckman-Quarles theorem for mappings from \(\mathbb{R}^2\) of \(\mathbb{F}^2\), where \(\mathbb{F}\) is a subfield of a commutative field extending \(\mathbb{R}\) (Q1766169) (← links)
- Beckman-Quarles type theorems for mappings from \(\mathbb{R}^n\) to \(\mathbb{C}^n\) (Q1881595) (← links)
- Discrete versions of the Beckman-Quarles theorem (Q1972864) (← links)
- A stronger form of the theorem on the existence of a rigid binary relation on any set (Q2386085) (← links)
- Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation (Q2445235) (← links)
- A discrete form of the theorem that each field endomorphism of \(\mathbb R(\mathbb Q_p)\) is the identity (Q2490652) (← links)
- The Beckman-Quarles theorem for continuous mappings from \({\mathbb C}^{n}\) to \({\mathbb C}^{n}\) (Q2505167) (← links)
- On \(\emptyset\)-definable elements in a field (Q2642842) (← links)
- (Q2725861) (← links)
- (Q2765390) (← links)
- All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computa (Q2790449) (← links)
- Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? (Q2843817) (← links)
- A new characterization of computable functions (Q2922764) (← links)
- (Q3124434) (← links)
- Some conjectures on addition and multiplication of complex (real) numbers (Q3185150) (← links)
- (Q3518882) (← links)
- Two conjectures on the arithmetic in ℝ and ℂ (Q3552394) (← links)
- (Q3625141) (← links)
- (Q4275546) (← links)
- (Q4288836) (← links)
- A Discrete Form of the Beckman-Quarles Theorem (Q4373317) (← links)
- (Q4504213) (← links)
- ON ONE COMBINATORIAL LEMMA AND ITS GEOMETRIC CONSEQUENCES (Q4696211) (← links)
- (Q4804716) (← links)
- (Q4843243) (← links)
- (Q4848340) (← links)
- (Q4939327) (← links)
- On the Relationship Between Matiyasevich's and Smorynski's Theorems (Q5089608) (← links)
- (Q5285422) (← links)
- An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k (Q5401917) (← links)
- A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set (Q5401918) (← links)
- (Q5475653) (← links)
- A discrete form of the Beckman-Quarles theorem for rational eight-space (Q5945049) (← links)
- A common approach to three open problems in number theory (Q6063834) (← links)
- Erratum to: A common approach to three open problems in number theory (Q6063852) (← links)
- (Q6201768) (← links)
- Two conjectures on integer arithmetic and their applications to Diophantine equations (Q6216163) (← links)
- Small systems of Diophantine equations which have only very large integer solutions (Q6223678) (← links)
- Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the number (heights) of integer solutions, if these solutions form a finite set? (Q6225681) (← links)
- A subset of Z^n whose non-computability leads to the existence of a Diophantine equation whose solvability is logically undecidable (Q6226817) (← links)
- Small systems of Diophantine equations with a prescribed number of solutions in non-negative integers (Q6228399) (← links)
- Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? (Q6244802) (← links)
- Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers? (Q6250967) (← links)
- A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions (Q6259174) (← links)
- On systems of Diophantine equations with a large number of integer solutions (Q6267367) (← links)
- Is there a computable upper bound on the heights of rational solutions of a Diophantine equation with a finite number of solutions? (Q6267606) (← links)