Search results for "table"
showing 10 items of 2807 documents
Efficient computation of the branching structure of an algebraic curve
2012
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant points of the curve are constructed via a minimal spanning tree of the discriminant points. This leads to paths of minimal length between the points, which is important for a later stage where these paths are used as integration contours to compute periods of the surface. The branching structure of the surface is obtained by analytically continuing the roots of the equation defining the algebraic curve along the constructed generators of the fundamental gro…
Periodic Groups Covered by Transitive Subgroups of Finitary Permutations or by Irreducible Subgroups of Finitary Transformations
1999
Let X be either the class of all transitive groups of finitary permutations, or the class of all periodic irreducible finitary linear groups. We show that almost primitive X-groups are countably recognizable, while totally imprimitive X-groups are in general not countably recognizable. In addition we derive a structure theorem for groups all of whose countable subsets are contained in totally imprimitive X-subgroups. It turns out that totally imprimitive p-groups in the class X are countably recognizable.
ℓp-solutions of countable infinite systems of equations and applications to electrical circuits
1991
In the preceding chapter we have studied a lumped parameter model of a class of circuits containing a finite number of elements. Here we are interested in qualitative properties of the network in Figure 3.1.
Precise bounds for the sequential order of products of some Fréchet topologies
1998
Abstract The sequential order of a topological space is the least ordinal for which the corresponding iteration of the sequential closure is idempotent. Lower estimates for the sequential order of the product of two regular Frechet topologies and upper estimates for the sequential order of the product of two subtransverse topologies are given in terms of their fascicularity and sagittality. It is shown that for every countable ordinal α, there exists a Lasnev topology such that the sequential order of its square is equal to α.
Archimedean actions on median pretrees
2001
In this paper we consider group actions on generalized treelike structures (termed ‘pretrees’) defined simply in terms of betweenness relations. Using a result of Levitt, we show that if a countable group admits an archimedean action on a median pretree, then it admits an action by isometries on an [open face R]-tree. Thus the theory of isometric actions on [open face R]-trees may be extended to a more general setting where it merges naturally with the theory of right-orderable groups. This approach has application also to the study of convergence group actions on continua.
Kolmogorov numberings and minimal identification
1997
Abstract Identification of programs for computable functions from their graphs by algorithmic devices is a well studied problem in learning theory. Freivalds and Chen consider identification of ‘minimal’ and ‘nearly minimal’ programs for functions from their graphs. To address certain problems in minimal identification for Godel numberings, Freivalds later considered minimal identification in Kolmogorov numberings. Kolmogorov numberings are in some sense optimal numberings and have some nice properties. We prove certain separation results for minimal identification in every Kolmogorov numbering. In addition we also compare minimal identification in Godel numberings versus minimal identifica…
Vector-valued meromorphic functions
2002
A locally complete locally convex space E satisfies that every weakly meromorphic function defined on an open subset of \( \mathbb{C} \) with values in E is meromorphic if and only if E does not contain a countable product of copies of \( \mathbb{C} \). A characterization of locally complete spaces in the spirit of known characterizations of the (metric) convex compactness property is also given.
The branch set of a quasiregular mapping between metric manifolds
2016
Abstract In this note, we announce some new results on quantitative countable porosity of the branch set of a quasiregular mapping in very general metric spaces. As applications, we solve a recent conjecture of Fassler et al., an open problem of Heinonen–Rickman, and an open question of Heinonen–Semmes.
Topological invariants of stable immersions of oriented 3-manifolds in R4
2012
Abstract We show that the Z -module of first order local Vassiliev type invariants of stable immersions of oriented 3-manifolds into R 4 is generated by 3 topological invariants: The number of pairs of quadruple points and the positive and negative linking invariants l + and l − introduced by V. Goryunov (1997) [7] . We obtain the expression for the Euler characteristic of the immersed 3-manifold in terms of these invariants. We also prove that the total number of connected components of the triple points curve is a non-local Vassiliev type invariant.
On the use of relational expressions in the design of efficient algorithms
2005
Relational expressions have finite binary relations as arguments and the operations are composition (·), closure (*), inverse (−1), and union (U). The efficient computation of the relation denoted by a relational expression is considered, and a tight bound is established on the complexity of the algorithm suggested by Hunt, Szymanski and Ullman. The result implies a unified method for deriving efficient algorithms for many problems in parsing. For example, optimal algorithms are derived for strong LL(1) and strong LL(2) parser construction and an efficient polynomialtime algorithm is derived for determining the inessential error entries in an LR(1) parsing table.