Related papers: Topological classification of generic real rationa…
If $R$ is a rational map, the Main Result is a uniformization Theorem for the space of decompositions of the iterates of $R$. Secondly, we show that Fatou conjecture holds for decomposable rational maps.
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
We consider a tower of function fields F_0 < F_1 < ... over a finite field such that every place of every F_i ramified in the tower and the sequence genus(F_i)/[F_i:F_0] has a finite limit. We also construct a tower in which every place…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
We consider the operation of intersecting with a locally principal Cartier divisor (i.e., a Cartier divisor which is principal on some neighborhood of its support). We describe this operation explicitly on the level of cycles and rational…
The concept of derivative coordinate functions proved useful in the formulation of analytic fractal functions to represent smooth symmetric binary fractal trees [1]. In this paper we introduce a new geometry that defines the fractal space…
Jacobian conjectures (that nonsingular implies invertible) for rational everywhere defined maps of real n-space to itself are considered, with no requirement for a constant Jacobian determinant or a rational inverse. The associated…
We consider in the plane the problem of reconstructing a domain from the normal derivative of its Green's function with pole at a fixed point in the domain. By means of the theory of conformal mappings, we obtain existence, uniqueness,…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…
We have been interested in graphs and realizing them as Reeb graphs of explicit real algebraic functions. The Reeb graph of a differentiable function is the quotient space of the manifold of the domain, regarded as the space consisting of…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We propose a method to adapt functional logic programming to deal with reasoning on coinductively interpreted programs as well as on inductively interpreted programs. In order to do so, we consider a class of objects interesting for this…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…
We define decision trees for monotone functions on a simplicial complex. We define homology decidability of monotone functions, and show that various monotone functions related to semimatroids are homology decidable. Homology decidability…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we…
The regular objects in various categories, such as maps, hypermaps or covering spaces, can be identified with the normal subgroups N of a given group \Gamma, with quotient group isomorphic to \Gamma/N. It is shown how to enumerate such…