1 - 5 of 5
Number of results to display per page
Search Results
2. Basic bounds of Fréchet classes
- Creator:
- Skřivánek, Jaroslav
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- algebraic bound, basic bound, copula, Diophantine equation, Fréchet class, and pointed convex polyhedral conde
- Language:
- English
- Description:
- Algebraic bounds of Fréchet classes of copulas can be derived from the fundamental attributes of the associated copulas. A minimal system of algebraic bounds and related basic bounds can be defined using properties of pointed convex polyhedral cones and their relationship with non-negative solutions of systems of linear homogeneous Diophantine equations, largely studied in Combinatorics. The basic bounds are an algebraic improving of the Fréchet-Hoeffding bounds. We provide conditions of compatibility and propose tools for an explicit description of the basic bounds of simple Fréchet classes.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
3. Bounds of general Fréchet classes
- Creator:
- Skřivánek, Jaroslav
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- copula, Fréchet class, and Diophantine equation
- Language:
- English
- Description:
- This paper deals with conditions of compatibility of a system of copulas and with bounds of general Fréchet classes. Algebraic search for the bounds is interpreted as a solution to a linear system of Diophantine equations. Classical analytical specification of the bounds is described.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
4. Diophantine equations involving factorials
- Creator:
- Alzer, Horst and Luca, Florian
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Diophantine equation and factorial
- Language:
- English
- Description:
- We study the Diophantine equations (k!)n − k n = (n!)k − n k and (k!)n + k n = (n!)k + n k , where k and n are positive integers. We show that the first one holds if and only if k = n or (k, n) = (1, 2), (2, 1) and that the second one holds if and only if k = n.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public
5. On the Diophantine equation $x^{2}-kxy+y^{2}-2^{n}=0$
- Creator:
- Keskin, Refik, Şiar, Zafer, and Karaatlı, Olcay
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- Diophantine equation, Pell equation, generalized Fibonacci number, and generalized Lucas number
- Language:
- English
- Description:
- In this study, we determine when the Diophantine equation $x^{2}-kxy+y^{2}-2^{n}=0$ has an infinite number of positive integer solutions $x$ and $y$ for $0\leq n\leq 10.$ Moreover, we give all positive integer solutions of the same equation for $0\leq n\leq 10$ in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation $x^{2}-kxy+y^{2}-2^{n}=0$.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public