A finite equational base for CCS with left merge and communication merge
... that proves that they should not be equated. (We refer to the survey [Aceto et al. 2005b] for a discussion of proof techniques and for an overview of results and open problems in the area. We remark in passing that one of our main results in this paper, viz. Corollary 4.10, solves the open problem m ...
... that proves that they should not be equated. (We refer to the survey [Aceto et al. 2005b] for a discussion of proof techniques and for an overview of results and open problems in the area. We remark in passing that one of our main results in this paper, viz. Corollary 4.10, solves the open problem m ...
The symplectic Verlinde algebras and string K e
... so (10) has positive valuation if and only if ζ2m i valuation if and only if = p for some i. Indeed, sufficiency follows from the fact that ((x + i i−1 1)p − 1)/((x + 1)p − 1) is an Eisenstein polynomial with root ζpi − 1. To see necessity, if ζ − 1 has positive valuation, so does ζ p − 1, so it suffi ...
... so (10) has positive valuation if and only if ζ2m i valuation if and only if = p for some i. Indeed, sufficiency follows from the fact that ((x + i i−1 1)p − 1)/((x + 1)p − 1) is an Eisenstein polynomial with root ζpi − 1. To see necessity, if ζ − 1 has positive valuation, so does ζ p − 1, so it suffi ...
THE CONGRUENT NUMBER PROBLEM 1. Introduction
... Example 3.4. Since Fermat showed 1 and 2 are not congruent numbers, there is no arithmetic progression of 3 rational squares with common difference 1 or 2 (or, more generally, common difference a nonzero square or twice a nonzero square). We now can explain the origin of the peculiar name “congruent ...
... Example 3.4. Since Fermat showed 1 and 2 are not congruent numbers, there is no arithmetic progression of 3 rational squares with common difference 1 or 2 (or, more generally, common difference a nonzero square or twice a nonzero square). We now can explain the origin of the peculiar name “congruent ...
