Displaying similar documents to “Transcendental numbers having explicit g -adic and Jacobi-Perron expansions”

Non-free two-generator subgroups of SL(Q).

S. Peter Farbman (1995)

Publicacions Matemàtiques

Similarity:

The question of whether two parabolic elements A, B of SL(C) are a free basis for the group they generate is considered. Some known results are generalized, using the parameter τ = tr(AB) - 2. If τ = a/b ∈ Q, |τ| < 4, and |a| ≤ 16, then the group is not free. If the subgroup generated by b in Z / aZ has a set of representatives, each of which divides one of b ± 1, then the subgroup of SL(C) will not be free.

Differential equations on the plane with given solutions.

R. Ramírez, N. Sadovskaia (1996)

Collectanea Mathematica

Similarity:

The aim of this paper is to construct the analytic vector fields with given as trajectories or solutions. In particular we construct the polynomial vector field from given conics (ellipses, hyperbola, parabola, straight lines) and determine the differential equations from a finite number of solutions.

Efficiency of some algorithms for prediction in finite stationary time series

Pavel Ranocha (2004)

Kybernetika

Similarity:

Important characteristics of any algorithm are its complexity and speed in real calculations. From this point of view, we analyze some algorithms for prediction in finite stationary time series. First, we review results developed by P. Bondon [1] and then, we derive the complexities of Levinson and a new algorithm. It is shown that the time needed for real calculations of predictions is proportional to the theoretical complexity of the algorithm. Some practical recommendations for the...

CAPS in Z(2,n)

Kurz, Sascha (2009)

Serdica Journal of Computing

Similarity:

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.